./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 551b0097 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-?-551b009-m [2025-01-08 23:56:04,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:56:04,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:56:04,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:56:04,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:56:04,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:56:04,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:56:04,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:56:04,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:56:04,249 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:56:04,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:56:04,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:56:04,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:56:04,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:56:04,249 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:56:04,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:56:04,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:56:04,249 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:56:04,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:56:04,250 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:56:04,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:56:04,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:56:04,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:56:04,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:56:04,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:56:04,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:56:04,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:56:04,254 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:56:04,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:56:04,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:56:04,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:56:04,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:56:04,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:56:04,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:56:04,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:56:04,255 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-01-08 23:56:04,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:56:04,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:56:04,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:56:04,497 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:56:04,497 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:56:04,499 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-01-08 23:56:05,727 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/967fe1b14/2db3cd7b8cac4021a818f85e92fa86e7/FLAG7efb2c5bc [2025-01-08 23:56:06,216 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:56:06,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label54.c [2025-01-08 23:56:06,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/967fe1b14/2db3cd7b8cac4021a818f85e92fa86e7/FLAG7efb2c5bc [2025-01-08 23:56:06,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/967fe1b14/2db3cd7b8cac4021a818f85e92fa86e7 [2025-01-08 23:56:06,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:56:06,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:56:06,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:56:06,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:56:06,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:56:06,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:56:06" (1/1) ... [2025-01-08 23:56:06,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:06, skipping insertion in model container [2025-01-08 23:56:06,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:56:06" (1/1) ... [2025-01-08 23:56:06,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:56:06,539 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-01-08 23:56:07,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:56:07,072 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:56:07,088 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-01-08 23:56:07,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:56:07,389 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:56:07,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07 WrapperNode [2025-01-08 23:56:07,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:56:07,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:56:07,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:56:07,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:56:07,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:07,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:07,854 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:56:07,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:56:07,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:56:07,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:56:07,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:56:07,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:07,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:07,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:08,180 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-01-08 23:56:08,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:08,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:08,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:08,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:08,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:08,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:08,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:08,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:56:08,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:56:08,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:56:08,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:56:08,492 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (1/1) ... [2025-01-08 23:56:08,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:56:08,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:56:08,517 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-01-08 23:56:08,522 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-01-08 23:56:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:56:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:56:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:56:08,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:56:08,601 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:56:08,602 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:56:12,459 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:56:12,459 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:56:12,479 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:56:12,479 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:56:12,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:56:12 BoogieIcfgContainer [2025-01-08 23:56:12,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:56:12,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:56:12,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:56:12,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:56:12,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:56:06" (1/3) ... [2025-01-08 23:56:12,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2449104b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:56:12, skipping insertion in model container [2025-01-08 23:56:12,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:56:07" (2/3) ... [2025-01-08 23:56:12,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2449104b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:56:12, skipping insertion in model container [2025-01-08 23:56:12,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:56:12" (3/3) ... [2025-01-08 23:56:12,487 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label54.c [2025-01-08 23:56:12,496 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:56:12,497 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-01-08 23:56:12,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:56:12,556 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;@7b2db74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:56:12,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:56:12,565 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-01-08 23:56:12,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 23:56:12,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:12,569 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-01-08 23:56:12,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:12,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:12,572 INFO L85 PathProgramCache]: Analyzing trace with hash 271890780, now seen corresponding path program 1 times [2025-01-08 23:56:12,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:12,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932830729] [2025-01-08 23:56:12,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:12,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:12,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 23:56:12,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 23:56:12,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:12,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:56:12,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:12,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932830729] [2025-01-08 23:56:12,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932830729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:12,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:12,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:56:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413952831] [2025-01-08 23:56:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:12,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:12,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:12,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:12,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:12,833 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-01-08 23:56:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:16,327 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-01-08 23:56:16,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:16,329 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-01-08 23:56:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:16,351 INFO L225 Difference]: With dead ends: 3035 [2025-01-08 23:56:16,352 INFO L226 Difference]: Without dead ends: 1873 [2025-01-08 23:56:16,362 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-01-08 23:56:16,365 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 878 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:16,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-08 23:56:16,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-01-08 23:56:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-01-08 23:56:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 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-01-08 23:56:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-01-08 23:56:16,465 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 27 [2025-01-08 23:56:16,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:16,466 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-01-08 23:56:16,466 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-01-08 23:56:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-01-08 23:56:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-08 23:56:16,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:16,469 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] [2025-01-08 23:56:16,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:56:16,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:16,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1169212976, now seen corresponding path program 1 times [2025-01-08 23:56:16,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:16,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347612018] [2025-01-08 23:56:16,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:16,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:16,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-08 23:56:16,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-08 23:56:16,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:16,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:56:16,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:16,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347612018] [2025-01-08 23:56:16,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347612018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:16,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:16,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:56:16,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956278888] [2025-01-08 23:56:16,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:16,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:16,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:16,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:16,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:16,742 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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-01-08 23:56:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:20,307 INFO L93 Difference]: Finished difference Result 5405 states and 8404 transitions. [2025-01-08 23:56:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:20,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-08 23:56:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:20,318 INFO L225 Difference]: With dead ends: 5405 [2025-01-08 23:56:20,318 INFO L226 Difference]: Without dead ends: 3548 [2025-01-08 23:56:20,320 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-01-08 23:56:20,320 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 862 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3343 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 3785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 3343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:20,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1040 Invalid, 3785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 3343 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-08 23:56:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2025-01-08 23:56:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3476. [2025-01-08 23:56:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3476 states, 3475 states have (on average 1.4897841726618706) internal successors, (5177), 3475 states have internal predecessors, (5177), 0 states have call successors, (0), 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-01-08 23:56:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 5177 transitions. [2025-01-08 23:56:20,369 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 5177 transitions. Word has length 99 [2025-01-08 23:56:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:20,369 INFO L471 AbstractCegarLoop]: Abstraction has 3476 states and 5177 transitions. [2025-01-08 23:56:20,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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-01-08 23:56:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 5177 transitions. [2025-01-08 23:56:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-08 23:56:20,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:20,375 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] [2025-01-08 23:56:20,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:56:20,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:20,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash 473429657, now seen corresponding path program 1 times [2025-01-08 23:56:20,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:20,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687914519] [2025-01-08 23:56:20,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:20,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:20,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-08 23:56:20,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-08 23:56:20,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:20,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:56:20,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:20,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687914519] [2025-01-08 23:56:20,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687914519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:20,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:56:20,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298647617] [2025-01-08 23:56:20,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:20,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:20,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:20,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:20,530 INFO L87 Difference]: Start difference. First operand 3476 states and 5177 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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-01-08 23:56:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:23,634 INFO L93 Difference]: Finished difference Result 10142 states and 15129 transitions. [2025-01-08 23:56:23,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:23,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-01-08 23:56:23,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:23,651 INFO L225 Difference]: With dead ends: 10142 [2025-01-08 23:56:23,651 INFO L226 Difference]: Without dead ends: 6668 [2025-01-08 23:56:23,654 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-01-08 23:56:23,657 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 964 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:23,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 848 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:56:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2025-01-08 23:56:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 6659. [2025-01-08 23:56:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6659 states, 6658 states have (on average 1.364373685791529) internal successors, (9084), 6658 states have internal predecessors, (9084), 0 states have call successors, (0), 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-01-08 23:56:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6659 states to 6659 states and 9084 transitions. [2025-01-08 23:56:23,734 INFO L78 Accepts]: Start accepts. Automaton has 6659 states and 9084 transitions. Word has length 113 [2025-01-08 23:56:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:23,735 INFO L471 AbstractCegarLoop]: Abstraction has 6659 states and 9084 transitions. [2025-01-08 23:56:23,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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-01-08 23:56:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 6659 states and 9084 transitions. [2025-01-08 23:56:23,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-08 23:56:23,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:23,739 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] [2025-01-08 23:56:23,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:56:23,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:23,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash 228015382, now seen corresponding path program 1 times [2025-01-08 23:56:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:23,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446954081] [2025-01-08 23:56:23,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:23,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-08 23:56:23,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-08 23:56:23,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:23,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:56:23,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:23,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446954081] [2025-01-08 23:56:23,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446954081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:23,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:23,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:56:23,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884185975] [2025-01-08 23:56:23,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:23,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:23,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:23,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:23,851 INFO L87 Difference]: Start difference. First operand 6659 states and 9084 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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-01-08 23:56:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:26,669 INFO L93 Difference]: Finished difference Result 16505 states and 23199 transitions. [2025-01-08 23:56:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-01-08 23:56:26,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:26,695 INFO L225 Difference]: With dead ends: 16505 [2025-01-08 23:56:26,695 INFO L226 Difference]: Without dead ends: 9848 [2025-01-08 23:56:26,702 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-01-08 23:56:26,704 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 997 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 973 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 3382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 973 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:26,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 908 Invalid, 3382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [973 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:56:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9848 states. [2025-01-08 23:56:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9848 to 9836. [2025-01-08 23:56:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9836 states, 9835 states have (on average 1.3705134722928318) internal successors, (13479), 9835 states have internal predecessors, (13479), 0 states have call successors, (0), 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-01-08 23:56:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9836 states to 9836 states and 13479 transitions. [2025-01-08 23:56:26,827 INFO L78 Accepts]: Start accepts. Automaton has 9836 states and 13479 transitions. Word has length 116 [2025-01-08 23:56:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:26,828 INFO L471 AbstractCegarLoop]: Abstraction has 9836 states and 13479 transitions. [2025-01-08 23:56:26,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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-01-08 23:56:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 9836 states and 13479 transitions. [2025-01-08 23:56:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-08 23:56:26,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:26,830 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] [2025-01-08 23:56:26,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:56:26,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:26,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:26,831 INFO L85 PathProgramCache]: Analyzing trace with hash 781748510, now seen corresponding path program 1 times [2025-01-08 23:56:26,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:26,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879904410] [2025-01-08 23:56:26,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:26,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:26,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-08 23:56:26,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-08 23:56:26,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:26,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:56:27,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:27,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879904410] [2025-01-08 23:56:27,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879904410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:27,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:27,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:56:27,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774267113] [2025-01-08 23:56:27,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:27,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:56:27,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:27,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:56:27,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:56:27,180 INFO L87 Difference]: Start difference. First operand 9836 states and 13479 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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-01-08 23:56:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:31,399 INFO L93 Difference]: Finished difference Result 29905 states and 40769 transitions. [2025-01-08 23:56:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:56:31,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-01-08 23:56:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:31,430 INFO L225 Difference]: With dead ends: 29905 [2025-01-08 23:56:31,430 INFO L226 Difference]: Without dead ends: 20071 [2025-01-08 23:56:31,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:56:31,438 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 2465 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 4305 mSolverCounterSat, 830 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2465 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 5135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 830 IncrementalHoareTripleChecker+Valid, 4305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:31,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2465 Valid, 1127 Invalid, 5135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [830 Valid, 4305 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-08 23:56:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20071 states. [2025-01-08 23:56:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20071 to 20070. [2025-01-08 23:56:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20070 states, 20069 states have (on average 1.2763964323085355) internal successors, (25616), 20069 states have internal predecessors, (25616), 0 states have call successors, (0), 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-01-08 23:56:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20070 states to 20070 states and 25616 transitions. [2025-01-08 23:56:31,630 INFO L78 Accepts]: Start accepts. Automaton has 20070 states and 25616 transitions. Word has length 132 [2025-01-08 23:56:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:31,631 INFO L471 AbstractCegarLoop]: Abstraction has 20070 states and 25616 transitions. [2025-01-08 23:56:31,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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-01-08 23:56:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 20070 states and 25616 transitions. [2025-01-08 23:56:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-08 23:56:31,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:31,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:56:31,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:56:31,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:31,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:31,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1640738866, now seen corresponding path program 1 times [2025-01-08 23:56:31,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:31,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868761342] [2025-01-08 23:56:31,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:31,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:31,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-08 23:56:31,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-08 23:56:31,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:31,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:56:31,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:31,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868761342] [2025-01-08 23:56:31,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868761342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:31,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:31,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:56:31,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545049400] [2025-01-08 23:56:31,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:31,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:31,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:31,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:31,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:31,792 INFO L87 Difference]: Start difference. First operand 20070 states and 25616 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-01-08 23:56:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:35,111 INFO L93 Difference]: Finished difference Result 55919 states and 72271 transitions. [2025-01-08 23:56:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:35,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 208 [2025-01-08 23:56:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:35,152 INFO L225 Difference]: With dead ends: 55919 [2025-01-08 23:56:35,153 INFO L226 Difference]: Without dead ends: 36638 [2025-01-08 23:56:35,165 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-01-08 23:56:35,166 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 908 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 2863 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 3413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:35,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 586 Invalid, 3413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2863 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:56:35,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36638 states. [2025-01-08 23:56:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36638 to 36628. [2025-01-08 23:56:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36628 states, 36627 states have (on average 1.2476315286537254) internal successors, (45697), 36627 states have internal predecessors, (45697), 0 states have call successors, (0), 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-01-08 23:56:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36628 states to 36628 states and 45697 transitions. [2025-01-08 23:56:35,644 INFO L78 Accepts]: Start accepts. Automaton has 36628 states and 45697 transitions. Word has length 208 [2025-01-08 23:56:35,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:35,645 INFO L471 AbstractCegarLoop]: Abstraction has 36628 states and 45697 transitions. [2025-01-08 23:56:35,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-01-08 23:56:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 36628 states and 45697 transitions. [2025-01-08 23:56:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-08 23:56:35,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:35,648 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-01-08 23:56:35,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:56:35,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:35,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1029097253, now seen corresponding path program 1 times [2025-01-08 23:56:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:35,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627432227] [2025-01-08 23:56:35,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:35,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:35,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-08 23:56:35,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-08 23:56:35,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:35,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:56:35,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:35,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627432227] [2025-01-08 23:56:35,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627432227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:35,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:35,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:56:35,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2339047] [2025-01-08 23:56:35,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:35,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:35,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:35,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:35,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:35,832 INFO L87 Difference]: Start difference. First operand 36628 states and 45697 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-01-08 23:56:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:38,693 INFO L93 Difference]: Finished difference Result 83497 states and 104593 transitions. [2025-01-08 23:56:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:38,694 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-01-08 23:56:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:38,793 INFO L225 Difference]: With dead ends: 83497 [2025-01-08 23:56:38,794 INFO L226 Difference]: Without dead ends: 47658 [2025-01-08 23:56:38,818 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-01-08 23:56:38,818 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 837 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2426 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 2426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:38,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1037 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 2426 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:56:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47658 states. [2025-01-08 23:56:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47658 to 47648. [2025-01-08 23:56:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47648 states, 47647 states have (on average 1.2338027577811825) internal successors, (58787), 47647 states have internal predecessors, (58787), 0 states have call successors, (0), 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-01-08 23:56:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47648 states to 47648 states and 58787 transitions. [2025-01-08 23:56:39,337 INFO L78 Accepts]: Start accepts. Automaton has 47648 states and 58787 transitions. Word has length 226 [2025-01-08 23:56:39,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:39,338 INFO L471 AbstractCegarLoop]: Abstraction has 47648 states and 58787 transitions. [2025-01-08 23:56:39,338 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-01-08 23:56:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 47648 states and 58787 transitions. [2025-01-08 23:56:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-01-08 23:56:39,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:39,344 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, 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] [2025-01-08 23:56:39,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:56:39,344 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:39,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:39,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2135135325, now seen corresponding path program 1 times [2025-01-08 23:56:39,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:39,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444728485] [2025-01-08 23:56:39,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:39,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:39,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-01-08 23:56:39,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-01-08 23:56:39,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:39,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:56:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:39,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444728485] [2025-01-08 23:56:39,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444728485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:39,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:39,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:56:39,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751088664] [2025-01-08 23:56:39,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:39,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:39,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:39,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:39,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:39,522 INFO L87 Difference]: Start difference. First operand 47648 states and 58787 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-01-08 23:56:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:43,327 INFO L93 Difference]: Finished difference Result 134633 states and 167260 transitions. [2025-01-08 23:56:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:43,327 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 257 [2025-01-08 23:56:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:43,650 INFO L225 Difference]: With dead ends: 134633 [2025-01-08 23:56:43,650 INFO L226 Difference]: Without dead ends: 87774 [2025-01-08 23:56:43,707 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-01-08 23:56:43,707 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 853 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 3182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:43,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 991 Invalid, 3182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-08 23:56:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87774 states. [2025-01-08 23:56:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87774 to 79897. [2025-01-08 23:56:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79897 states, 79896 states have (on average 1.1834885350956243) internal successors, (94556), 79896 states have internal predecessors, (94556), 0 states have call successors, (0), 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-01-08 23:56:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79897 states to 79897 states and 94556 transitions. [2025-01-08 23:56:44,590 INFO L78 Accepts]: Start accepts. Automaton has 79897 states and 94556 transitions. Word has length 257 [2025-01-08 23:56:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:44,591 INFO L471 AbstractCegarLoop]: Abstraction has 79897 states and 94556 transitions. [2025-01-08 23:56:44,591 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-01-08 23:56:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 79897 states and 94556 transitions. [2025-01-08 23:56:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-01-08 23:56:44,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:44,597 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:56:44,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:56:44,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:44,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1595674595, now seen corresponding path program 1 times [2025-01-08 23:56:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223551390] [2025-01-08 23:56:44,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:44,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:44,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-08 23:56:44,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-08 23:56:44,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:44,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:56:44,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:44,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223551390] [2025-01-08 23:56:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223551390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:56:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062994552] [2025-01-08 23:56:44,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:44,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:44,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:44,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:44,809 INFO L87 Difference]: Start difference. First operand 79897 states and 94556 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-01-08 23:56:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:48,332 INFO L93 Difference]: Finished difference Result 177111 states and 212132 transitions. [2025-01-08 23:56:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:48,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-01-08 23:56:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:48,447 INFO L225 Difference]: With dead ends: 177111 [2025-01-08 23:56:48,447 INFO L226 Difference]: Without dead ends: 98003 [2025-01-08 23:56:48,494 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-01-08 23:56:48,494 INFO L435 NwaCegarLoop]: 1756 mSDtfsCounter, 847 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 725 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 725 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:48,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1907 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [725 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:56:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98003 states. [2025-01-08 23:56:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98003 to 97211. [2025-01-08 23:56:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97211 states, 97210 states have (on average 1.1635839934163152) internal successors, (113112), 97210 states have internal predecessors, (113112), 0 states have call successors, (0), 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-01-08 23:56:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97211 states to 97211 states and 113112 transitions. [2025-01-08 23:56:49,558 INFO L78 Accepts]: Start accepts. Automaton has 97211 states and 113112 transitions. Word has length 315 [2025-01-08 23:56:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:49,559 INFO L471 AbstractCegarLoop]: Abstraction has 97211 states and 113112 transitions. [2025-01-08 23:56:49,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-01-08 23:56:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 97211 states and 113112 transitions. [2025-01-08 23:56:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-08 23:56:49,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:49,563 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-01-08 23:56:49,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:56:49,564 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:49,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash 182898035, now seen corresponding path program 1 times [2025-01-08 23:56:49,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:49,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711857458] [2025-01-08 23:56:49,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:49,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:49,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-08 23:56:49,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-08 23:56:49,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:49,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 288 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 23:56:50,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:50,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711857458] [2025-01-08 23:56:50,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711857458] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:56:50,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247629360] [2025-01-08 23:56:50,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:50,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:56:50,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:56:50,200 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-01-08 23:56:50,204 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-01-08 23:56:50,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-08 23:56:50,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-08 23:56:50,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:50,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:50,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:56:50,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:56:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 23:56:50,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:56:50,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247629360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:50,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:56:50,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:56:50,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085534132] [2025-01-08 23:56:50,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:50,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:50,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:50,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:50,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:56:50,911 INFO L87 Difference]: Start difference. First operand 97211 states and 113112 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-01-08 23:56:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:54,263 INFO L93 Difference]: Finished difference Result 240846 states and 283610 transitions. [2025-01-08 23:56:54,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:54,264 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-01-08 23:56:54,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:54,449 INFO L225 Difference]: With dead ends: 240846 [2025-01-08 23:56:54,449 INFO L226 Difference]: Without dead ends: 157024 [2025-01-08 23:56:54,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:56:54,497 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 727 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:54,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1174 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:56:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157024 states. [2025-01-08 23:56:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157024 to 102694. [2025-01-08 23:56:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102694 states, 102693 states have (on average 1.1428334940064075) internal successors, (117361), 102693 states have internal predecessors, (117361), 0 states have call successors, (0), 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-01-08 23:56:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102694 states to 102694 states and 117361 transitions. [2025-01-08 23:56:56,022 INFO L78 Accepts]: Start accepts. Automaton has 102694 states and 117361 transitions. Word has length 324 [2025-01-08 23:56:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:56,022 INFO L471 AbstractCegarLoop]: Abstraction has 102694 states and 117361 transitions. [2025-01-08 23:56:56,022 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-01-08 23:56:56,022 INFO L276 IsEmpty]: Start isEmpty. Operand 102694 states and 117361 transitions. [2025-01-08 23:56:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-01-08 23:56:56,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:56,026 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-01-08 23:56:56,032 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-01-08 23:56:56,230 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,SelfDestructingSolverStorable9 [2025-01-08 23:56:56,230 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:56,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash -239952522, now seen corresponding path program 1 times [2025-01-08 23:56:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:56,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370656626] [2025-01-08 23:56:56,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:56,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-08 23:56:56,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-08 23:56:56,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:56,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 218 proven. 113 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 23:56:56,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:56,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370656626] [2025-01-08 23:56:56,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370656626] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:56:56,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151566661] [2025-01-08 23:56:56,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:56,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:56:56,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:56:56,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-01-08 23:56:56,990 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-01-08 23:56:57,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-08 23:56:57,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-08 23:56:57,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:57,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:57,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:56:57,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:56:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-01-08 23:56:57,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:56:57,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151566661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:57,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:56:57,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:56:57,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394301338] [2025-01-08 23:56:57,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:57,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:57,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:57,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:56:57,190 INFO L87 Difference]: Start difference. First operand 102694 states and 117361 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-01-08 23:57:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:01,057 INFO L93 Difference]: Finished difference Result 204597 states and 233927 transitions. [2025-01-08 23:57:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:01,057 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-01-08 23:57:01,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:01,189 INFO L225 Difference]: With dead ends: 204597 [2025-01-08 23:57:01,189 INFO L226 Difference]: Without dead ends: 102692 [2025-01-08 23:57:01,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:57:01,276 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 1120 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:01,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 1439 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 23:57:01,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102692 states. [2025-01-08 23:57:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102692 to 102691. [2025-01-08 23:57:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102691 states, 102690 states have (on average 1.1016652059596845) internal successors, (113130), 102690 states have internal predecessors, (113130), 0 states have call successors, (0), 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-01-08 23:57:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102691 states to 102691 states and 113130 transitions. [2025-01-08 23:57:02,539 INFO L78 Accepts]: Start accepts. Automaton has 102691 states and 113130 transitions. Word has length 353 [2025-01-08 23:57:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:02,540 INFO L471 AbstractCegarLoop]: Abstraction has 102691 states and 113130 transitions. [2025-01-08 23:57:02,540 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-01-08 23:57:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 102691 states and 113130 transitions. [2025-01-08 23:57:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-01-08 23:57:02,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:02,553 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:02,567 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-01-08 23:57:02,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:02,754 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:02,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1666942054, now seen corresponding path program 1 times [2025-01-08 23:57:02,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:02,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578942715] [2025-01-08 23:57:02,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:02,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-01-08 23:57:02,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-01-08 23:57:02,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:02,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:57:03,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578942715] [2025-01-08 23:57:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578942715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:03,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:03,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:03,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880865302] [2025-01-08 23:57:03,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:03,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:03,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:03,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:03,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:03,474 INFO L87 Difference]: Start difference. First operand 102691 states and 113130 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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-01-08 23:57:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:09,285 INFO L93 Difference]: Finished difference Result 269186 states and 296007 transitions. [2025-01-08 23:57:09,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:09,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 420 [2025-01-08 23:57:09,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:09,477 INFO L225 Difference]: With dead ends: 269186 [2025-01-08 23:57:09,478 INFO L226 Difference]: Without dead ends: 167284 [2025-01-08 23:57:09,528 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-01-08 23:57:09,529 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1528 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 6008 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 6688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 6008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:09,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 899 Invalid, 6688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 6008 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-08 23:57:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167284 states. [2025-01-08 23:57:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167284 to 163331. [2025-01-08 23:57:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163331 states, 163330 states have (on average 1.092965162554338) internal successors, (178514), 163330 states have internal predecessors, (178514), 0 states have call successors, (0), 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-01-08 23:57:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163331 states to 163331 states and 178514 transitions. [2025-01-08 23:57:11,239 INFO L78 Accepts]: Start accepts. Automaton has 163331 states and 178514 transitions. Word has length 420 [2025-01-08 23:57:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:11,240 INFO L471 AbstractCegarLoop]: Abstraction has 163331 states and 178514 transitions. [2025-01-08 23:57:11,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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-01-08 23:57:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 163331 states and 178514 transitions. [2025-01-08 23:57:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-01-08 23:57:11,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:11,245 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-01-08 23:57:11,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:57:11,246 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:11,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:11,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2050666160, now seen corresponding path program 1 times [2025-01-08 23:57:11,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:11,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985094228] [2025-01-08 23:57:11,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:11,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:11,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-01-08 23:57:11,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-01-08 23:57:11,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:11,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:57:11,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985094228] [2025-01-08 23:57:11,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985094228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:11,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:11,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:11,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842613025] [2025-01-08 23:57:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:11,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:11,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:11,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:11,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:11,694 INFO L87 Difference]: Start difference. First operand 163331 states and 178514 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-01-08 23:57:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:14,928 INFO L93 Difference]: Finished difference Result 325879 states and 356251 transitions. [2025-01-08 23:57:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:14,928 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-01-08 23:57:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:15,312 INFO L225 Difference]: With dead ends: 325879 [2025-01-08 23:57:15,312 INFO L226 Difference]: Without dead ends: 163337 [2025-01-08 23:57:15,374 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-01-08 23:57:15,375 INFO L435 NwaCegarLoop]: 1745 mSDtfsCounter, 794 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:15,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1896 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:57:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163337 states. [2025-01-08 23:57:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163337 to 160959. [2025-01-08 23:57:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160959 states, 160958 states have (on average 1.064793300115558) internal successors, (171387), 160958 states have internal predecessors, (171387), 0 states have call successors, (0), 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-01-08 23:57:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160959 states to 160959 states and 171387 transitions. [2025-01-08 23:57:17,288 INFO L78 Accepts]: Start accepts. Automaton has 160959 states and 171387 transitions. Word has length 421 [2025-01-08 23:57:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:17,288 INFO L471 AbstractCegarLoop]: Abstraction has 160959 states and 171387 transitions. [2025-01-08 23:57:17,289 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-01-08 23:57:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 160959 states and 171387 transitions. [2025-01-08 23:57:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-08 23:57:17,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:17,309 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-01-08 23:57:17,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:57:17,309 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:17,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:17,309 INFO L85 PathProgramCache]: Analyzing trace with hash -581234435, now seen corresponding path program 1 times [2025-01-08 23:57:17,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:17,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288047661] [2025-01-08 23:57:17,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:17,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:17,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-08 23:57:17,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-08 23:57:17,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:17,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 290 proven. 110 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 23:57:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:18,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288047661] [2025-01-08 23:57:18,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288047661] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:18,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610746591] [2025-01-08 23:57:18,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:18,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:18,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:18,116 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-01-08 23:57:18,119 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-01-08 23:57:18,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-08 23:57:18,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-08 23:57:18,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:18,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:18,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:57:18,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-08 23:57:18,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:18,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610746591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:18,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:18,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:57:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285394769] [2025-01-08 23:57:18,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:18,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:18,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:18,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:18,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:57:18,418 INFO L87 Difference]: Start difference. First operand 160959 states and 171387 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-01-08 23:57:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:21,730 INFO L93 Difference]: Finished difference Result 317167 states and 339011 transitions. [2025-01-08 23:57:21,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:21,731 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-01-08 23:57:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:22,155 INFO L225 Difference]: With dead ends: 317167 [2025-01-08 23:57:22,155 INFO L226 Difference]: Without dead ends: 168021 [2025-01-08 23:57:22,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:57:22,218 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1133 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 851 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 851 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:22,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 386 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [851 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:57:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168021 states. [2025-01-08 23:57:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168021 to 168021. [2025-01-08 23:57:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168021 states, 168020 states have (on average 1.0661468872753244) internal successors, (179134), 168020 states have internal predecessors, (179134), 0 states have call successors, (0), 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-01-08 23:57:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168021 states to 168021 states and 179134 transitions. [2025-01-08 23:57:24,132 INFO L78 Accepts]: Start accepts. Automaton has 168021 states and 179134 transitions. Word has length 457 [2025-01-08 23:57:24,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:24,133 INFO L471 AbstractCegarLoop]: Abstraction has 168021 states and 179134 transitions. [2025-01-08 23:57:24,133 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-01-08 23:57:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 168021 states and 179134 transitions. [2025-01-08 23:57:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-08 23:57:24,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:24,144 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:57:24,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 23:57:24,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:24,345 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:24,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:24,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1395864084, now seen corresponding path program 1 times [2025-01-08 23:57:24,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:24,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958174357] [2025-01-08 23:57:24,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:24,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:24,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-08 23:57:24,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-08 23:57:24,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:24,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 507 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-01-08 23:57:24,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:24,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958174357] [2025-01-08 23:57:24,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958174357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:24,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:24,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:24,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908494552] [2025-01-08 23:57:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:24,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:24,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:24,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:24,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:24,608 INFO L87 Difference]: Start difference. First operand 168021 states and 179134 transitions. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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-01-08 23:57:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:30,771 INFO L93 Difference]: Finished difference Result 439333 states and 468497 transitions. [2025-01-08 23:57:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:30,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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 458 [2025-01-08 23:57:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:31,103 INFO L225 Difference]: With dead ends: 439333 [2025-01-08 23:57:31,103 INFO L226 Difference]: Without dead ends: 272101 [2025-01-08 23:57:31,175 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-01-08 23:57:31,176 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 1679 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 6529 mSolverCounterSat, 945 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 7474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 945 IncrementalHoareTripleChecker+Valid, 6529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:31,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 824 Invalid, 7474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [945 Valid, 6529 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-08 23:57:31,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272101 states.