./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i -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 433e151ff3abdaf4e4718c9ced99d2dc7cf27dfb3e48e73977d43bba901b54fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:41:26,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:41:26,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:41:26,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:41:26,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:41:26,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:41:26,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:41:26,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:41:26,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:41:26,166 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:41:26,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:41:26,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:41:26,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:41:26,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:41:26,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:41:26,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:41:26,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:41:26,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:41:26,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:41:26,168 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:41:26,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:41:26,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:41:26,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:41:26,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:41:26,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:41:26,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:41:26,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:41:26,168 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 -> 433e151ff3abdaf4e4718c9ced99d2dc7cf27dfb3e48e73977d43bba901b54fd [2025-02-06 02:41:26,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:41:26,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:41:26,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:41:26,393 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:41:26,393 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:41:26,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i [2025-02-06 02:41:27,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21e417b7d/9dd7c3e2af8e45c897cdb9938f56db24/FLAG642d5049c [2025-02-06 02:41:27,995 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:41:27,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i [2025-02-06 02:41:28,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21e417b7d/9dd7c3e2af8e45c897cdb9938f56db24/FLAG642d5049c [2025-02-06 02:41:28,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21e417b7d/9dd7c3e2af8e45c897cdb9938f56db24 [2025-02-06 02:41:28,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:41:28,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:41:28,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:41:28,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:41:28,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:41:28,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d10cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28, skipping insertion in model container [2025-02-06 02:41:28,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:41:28,369 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/hardness-nfm22/hardness_operatoramount_amount500_file-53.i[916,929] [2025-02-06 02:41:28,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:41:28,591 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:41:28,600 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/hardness-nfm22/hardness_operatoramount_amount500_file-53.i[916,929] [2025-02-06 02:41:28,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:41:28,675 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:41:28,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28 WrapperNode [2025-02-06 02:41:28,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:41:28,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:41:28,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:41:28,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:41:28,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,750 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 609 [2025-02-06 02:41:28,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:41:28,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:41:28,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:41:28,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:41:28,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,835 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:41:28,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:41:28,883 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:41:28,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:41:28,883 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:41:28,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (1/1) ... [2025-02-06 02:41:28,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:41:28,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:28,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:41:28,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:41:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:41:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:41:28,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:41:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:41:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:41:28,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:41:29,037 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:41:29,038 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:41:29,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L629: havoc property_#t~bitwise44#1;havoc property_#t~short45#1;havoc property_#t~bitwise46#1;havoc property_#t~short47#1; [2025-02-06 02:41:30,006 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-02-06 02:41:30,006 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:41:30,048 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:41:30,048 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:41:30,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:30 BoogieIcfgContainer [2025-02-06 02:41:30,049 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:41:30,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:41:30,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:41:30,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:41:30,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:41:28" (1/3) ... [2025-02-06 02:41:30,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe2cb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:30, skipping insertion in model container [2025-02-06 02:41:30,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:28" (2/3) ... [2025-02-06 02:41:30,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe2cb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:30, skipping insertion in model container [2025-02-06 02:41:30,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:30" (3/3) ... [2025-02-06 02:41:30,060 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-53.i [2025-02-06 02:41:30,069 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:41:30,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-53.i that has 2 procedures, 247 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:41:30,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:41:30,136 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;@17686161, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:41:30,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:41:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 247 states, 177 states have (on average 1.576271186440678) internal successors, (279), 178 states have internal predecessors, (279), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 02:41:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:41:30,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:30,166 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:30,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:30,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1833307070, now seen corresponding path program 1 times [2025-02-06 02:41:30,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:30,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229517485] [2025-02-06 02:41:30,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:30,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:30,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:30,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:30,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:30,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-02-06 02:41:30,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:30,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229517485] [2025-02-06 02:41:30,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229517485] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:30,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278397565] [2025-02-06 02:41:30,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:30,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:30,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:30,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:41:30,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:41:31,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:31,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:31,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:31,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:31,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:41:31,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-02-06 02:41:31,298 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:41:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278397565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:31,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:41:31,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:41:31,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334250469] [2025-02-06 02:41:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:31,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:41:31,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:31,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:41:31,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:41:31,329 INFO L87 Difference]: Start difference. First operand has 247 states, 177 states have (on average 1.576271186440678) internal successors, (279), 178 states have internal predecessors, (279), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-06 02:41:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:31,397 INFO L93 Difference]: Finished difference Result 488 states and 888 transitions. [2025-02-06 02:41:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:41:31,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 456 [2025-02-06 02:41:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:31,409 INFO L225 Difference]: With dead ends: 488 [2025-02-06 02:41:31,410 INFO L226 Difference]: Without dead ends: 244 [2025-02-06 02:41:31,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:41:31,416 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:31,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:41:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-06 02:41:31,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-02-06 02:41:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 175 states have (on average 1.5542857142857143) internal successors, (272), 175 states have internal predecessors, (272), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 02:41:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 406 transitions. [2025-02-06 02:41:31,490 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 406 transitions. Word has length 456 [2025-02-06 02:41:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:31,491 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 406 transitions. [2025-02-06 02:41:31,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-06 02:41:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 406 transitions. [2025-02-06 02:41:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:41:31,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:31,501 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:31,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:41:31,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:41:31,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:31,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1253324453, now seen corresponding path program 1 times [2025-02-06 02:41:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:31,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695771883] [2025-02-06 02:41:31,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:31,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:31,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:31,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:31,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:41:32,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695771883] [2025-02-06 02:41:32,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695771883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:32,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:32,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:32,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080626642] [2025-02-06 02:41:32,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:32,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:32,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:32,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:32,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:32,232 INFO L87 Difference]: Start difference. First operand 244 states and 406 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:32,397 INFO L93 Difference]: Finished difference Result 634 states and 1056 transitions. [2025-02-06 02:41:32,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:32,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-02-06 02:41:32,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:32,403 INFO L225 Difference]: With dead ends: 634 [2025-02-06 02:41:32,405 INFO L226 Difference]: Without dead ends: 393 [2025-02-06 02:41:32,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:32,406 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 227 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:32,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 780 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-02-06 02:41:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2025-02-06 02:41:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 294 states have (on average 1.5748299319727892) internal successors, (463), 295 states have internal predecessors, (463), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-06 02:41:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 649 transitions. [2025-02-06 02:41:32,453 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 649 transitions. Word has length 456 [2025-02-06 02:41:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:32,453 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 649 transitions. [2025-02-06 02:41:32,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 649 transitions. [2025-02-06 02:41:32,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:41:32,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:32,462 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:32,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:41:32,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:32,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash 418218781, now seen corresponding path program 1 times [2025-02-06 02:41:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:32,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664944453] [2025-02-06 02:41:32,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:32,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:32,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:32,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:32,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:32,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:41:32,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664944453] [2025-02-06 02:41:32,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664944453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:32,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:32,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:32,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747150402] [2025-02-06 02:41:32,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:32,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:32,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:32,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:32,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:32,892 INFO L87 Difference]: Start difference. First operand 390 states and 649 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:33,027 INFO L93 Difference]: Finished difference Result 1162 states and 1937 transitions. [2025-02-06 02:41:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:33,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-02-06 02:41:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:33,035 INFO L225 Difference]: With dead ends: 1162 [2025-02-06 02:41:33,035 INFO L226 Difference]: Without dead ends: 775 [2025-02-06 02:41:33,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:33,039 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 387 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:33,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1148 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-06 02:41:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 771. [2025-02-06 02:41:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 580 states have (on average 1.5655172413793104) internal successors, (908), 582 states have internal predecessors, (908), 186 states have call successors, (186), 4 states have call predecessors, (186), 4 states have return successors, (186), 184 states have call predecessors, (186), 186 states have call successors, (186) [2025-02-06 02:41:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1280 transitions. [2025-02-06 02:41:33,127 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1280 transitions. Word has length 456 [2025-02-06 02:41:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:33,128 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1280 transitions. [2025-02-06 02:41:33,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1280 transitions. [2025-02-06 02:41:33,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:41:33,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:33,135 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:33,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:41:33,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:33,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:33,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2143699678, now seen corresponding path program 1 times [2025-02-06 02:41:33,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:33,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563053868] [2025-02-06 02:41:33,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:33,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:33,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:33,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:33,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:41:33,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:33,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563053868] [2025-02-06 02:41:33,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563053868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:33,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:33,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:33,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128969734] [2025-02-06 02:41:33,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:33,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:33,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:33,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:33,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:33,405 INFO L87 Difference]: Start difference. First operand 771 states and 1280 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:33,547 INFO L93 Difference]: Finished difference Result 2299 states and 3818 transitions. [2025-02-06 02:41:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:33,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-02-06 02:41:33,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:33,560 INFO L225 Difference]: With dead ends: 2299 [2025-02-06 02:41:33,560 INFO L226 Difference]: Without dead ends: 1531 [2025-02-06 02:41:33,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:33,565 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 379 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:33,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1126 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2025-02-06 02:41:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1529. [2025-02-06 02:41:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1148 states have (on average 1.5540069686411149) internal successors, (1784), 1152 states have internal predecessors, (1784), 372 states have call successors, (372), 8 states have call predecessors, (372), 8 states have return successors, (372), 368 states have call predecessors, (372), 372 states have call successors, (372) [2025-02-06 02:41:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2528 transitions. [2025-02-06 02:41:33,664 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2528 transitions. Word has length 456 [2025-02-06 02:41:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:33,665 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2528 transitions. [2025-02-06 02:41:33,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2528 transitions. [2025-02-06 02:41:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:41:33,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:33,668 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:33,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:41:33,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:33,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:33,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1821501857, now seen corresponding path program 1 times [2025-02-06 02:41:33,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:33,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62334245] [2025-02-06 02:41:33,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:33,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:33,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:33,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:33,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:33,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:41:33,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:33,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62334245] [2025-02-06 02:41:33,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62334245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:33,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:33,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:33,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994119467] [2025-02-06 02:41:33,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:33,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:33,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:33,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:33,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:33,946 INFO L87 Difference]: Start difference. First operand 1529 states and 2528 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:34,104 INFO L93 Difference]: Finished difference Result 4257 states and 7018 transitions. [2025-02-06 02:41:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:34,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-02-06 02:41:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:34,120 INFO L225 Difference]: With dead ends: 4257 [2025-02-06 02:41:34,121 INFO L226 Difference]: Without dead ends: 2731 [2025-02-06 02:41:34,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:34,128 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 276 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:34,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 781 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2025-02-06 02:41:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2725. [2025-02-06 02:41:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2725 states, 1972 states have (on average 1.5212981744421907) internal successors, (3000), 1984 states have internal predecessors, (3000), 736 states have call successors, (736), 16 states have call predecessors, (736), 16 states have return successors, (736), 724 states have call predecessors, (736), 736 states have call successors, (736) [2025-02-06 02:41:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 4472 transitions. [2025-02-06 02:41:34,374 INFO L78 Accepts]: Start accepts. Automaton has 2725 states and 4472 transitions. Word has length 456 [2025-02-06 02:41:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:34,375 INFO L471 AbstractCegarLoop]: Abstraction has 2725 states and 4472 transitions. [2025-02-06 02:41:34,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 4472 transitions. [2025-02-06 02:41:34,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:41:34,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:34,381 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:34,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:41:34,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:34,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:34,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1958782748, now seen corresponding path program 1 times [2025-02-06 02:41:34,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:34,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062715059] [2025-02-06 02:41:34,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:34,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:34,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:34,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:34,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:34,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:41:35,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:35,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062715059] [2025-02-06 02:41:35,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062715059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:35,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:35,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:35,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633141743] [2025-02-06 02:41:35,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:35,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:35,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:35,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:35,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:35,302 INFO L87 Difference]: Start difference. First operand 2725 states and 4472 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:35,811 INFO L93 Difference]: Finished difference Result 8169 states and 13410 transitions. [2025-02-06 02:41:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:35,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-02-06 02:41:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:35,848 INFO L225 Difference]: With dead ends: 8169 [2025-02-06 02:41:35,848 INFO L226 Difference]: Without dead ends: 5447 [2025-02-06 02:41:35,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:35,860 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 223 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:35,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 784 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5447 states. [2025-02-06 02:41:36,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5447 to 5429. [2025-02-06 02:41:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5429 states, 3924 states have (on average 1.5137614678899083) internal successors, (5940), 3948 states have internal predecessors, (5940), 1472 states have call successors, (1472), 32 states have call predecessors, (1472), 32 states have return successors, (1472), 1448 states have call predecessors, (1472), 1472 states have call successors, (1472) [2025-02-06 02:41:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 8884 transitions. [2025-02-06 02:41:36,310 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 8884 transitions. Word has length 456 [2025-02-06 02:41:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:36,311 INFO L471 AbstractCegarLoop]: Abstraction has 5429 states and 8884 transitions. [2025-02-06 02:41:36,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 8884 transitions. [2025-02-06 02:41:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:41:36,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:36,315 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:36,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:41:36,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:36,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:36,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1762269243, now seen corresponding path program 1 times [2025-02-06 02:41:36,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:36,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700485780] [2025-02-06 02:41:36,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:36,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:36,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:36,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:36,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:36,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:41:38,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:38,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700485780] [2025-02-06 02:41:38,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700485780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:38,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:38,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:41:38,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975955200] [2025-02-06 02:41:38,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:38,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:41:38,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:38,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:41:38,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:41:38,144 INFO L87 Difference]: Start difference. First operand 5429 states and 8884 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-06 02:41:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:39,531 INFO L93 Difference]: Finished difference Result 15272 states and 24928 transitions. [2025-02-06 02:41:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:41:39,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 456 [2025-02-06 02:41:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:39,578 INFO L225 Difference]: With dead ends: 15272 [2025-02-06 02:41:39,578 INFO L226 Difference]: Without dead ends: 9846 [2025-02-06 02:41:39,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:41:39,597 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 1033 mSDsluCounter, 2027 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 2509 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:39,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 2509 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 02:41:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9846 states. [2025-02-06 02:41:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 6586. [2025-02-06 02:41:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6586 states, 5010 states have (on average 1.5538922155688624) internal successors, (7785), 5034 states have internal predecessors, (7785), 1539 states have call successors, (1539), 36 states have call predecessors, (1539), 36 states have return successors, (1539), 1515 states have call predecessors, (1539), 1539 states have call successors, (1539) [2025-02-06 02:41:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 10863 transitions. [2025-02-06 02:41:40,086 INFO L78 Accepts]: Start accepts. Automaton has 6586 states and 10863 transitions. Word has length 456 [2025-02-06 02:41:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:40,087 INFO L471 AbstractCegarLoop]: Abstraction has 6586 states and 10863 transitions. [2025-02-06 02:41:40,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-06 02:41:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 6586 states and 10863 transitions. [2025-02-06 02:41:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:41:40,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:40,094 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:40,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:41:40,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:40,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:40,095 INFO L85 PathProgramCache]: Analyzing trace with hash 806747964, now seen corresponding path program 1 times [2025-02-06 02:41:40,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:40,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196751424] [2025-02-06 02:41:40,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:40,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:40,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:40,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:40,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:41:41,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:41,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196751424] [2025-02-06 02:41:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196751424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:41,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:41,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:41:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948855453] [2025-02-06 02:41:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:41,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:41:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:41,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:41:41,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:41:41,441 INFO L87 Difference]: Start difference. First operand 6586 states and 10863 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-06 02:41:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:43,039 INFO L93 Difference]: Finished difference Result 23943 states and 39507 transitions. [2025-02-06 02:41:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:41:43,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 456 [2025-02-06 02:41:43,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:43,124 INFO L225 Difference]: With dead ends: 23943 [2025-02-06 02:41:43,124 INFO L226 Difference]: Without dead ends: 18005 [2025-02-06 02:41:43,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:41:43,156 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 1195 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:43,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1188 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:41:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18005 states. [2025-02-06 02:41:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18005 to 10927. [2025-02-06 02:41:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10927 states, 9127 states have (on average 1.5919798400350609) internal successors, (14530), 9183 states have internal predecessors, (14530), 1731 states have call successors, (1731), 68 states have call predecessors, (1731), 68 states have return successors, (1731), 1675 states have call predecessors, (1731), 1731 states have call successors, (1731) [2025-02-06 02:41:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10927 states to 10927 states and 17992 transitions. [2025-02-06 02:41:43,939 INFO L78 Accepts]: Start accepts. Automaton has 10927 states and 17992 transitions. Word has length 456 [2025-02-06 02:41:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:43,940 INFO L471 AbstractCegarLoop]: Abstraction has 10927 states and 17992 transitions. [2025-02-06 02:41:43,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-06 02:41:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 10927 states and 17992 transitions. [2025-02-06 02:41:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:41:43,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:43,949 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:43,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:41:43,950 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:43,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash -37723907, now seen corresponding path program 1 times [2025-02-06 02:41:43,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:43,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003593969] [2025-02-06 02:41:43,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:43,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:43,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:44,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:44,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:44,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:41:44,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:44,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003593969] [2025-02-06 02:41:44,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003593969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:44,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:44,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:44,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557821307] [2025-02-06 02:41:44,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:44,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:44,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:44,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:44,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:44,986 INFO L87 Difference]: Start difference. First operand 10927 states and 17992 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:45,466 INFO L93 Difference]: Finished difference Result 19945 states and 32705 transitions. [2025-02-06 02:41:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:45,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-02-06 02:41:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:45,501 INFO L225 Difference]: With dead ends: 19945 [2025-02-06 02:41:45,501 INFO L226 Difference]: Without dead ends: 10703 [2025-02-06 02:41:45,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:45,525 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 376 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:45,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 648 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:41:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10703 states. [2025-02-06 02:41:46,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10703 to 10703. [2025-02-06 02:41:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10703 states, 8903 states have (on average 1.5772211614062674) internal successors, (14042), 8959 states have internal predecessors, (14042), 1731 states have call successors, (1731), 68 states have call predecessors, (1731), 68 states have return successors, (1731), 1675 states have call predecessors, (1731), 1731 states have call successors, (1731) [2025-02-06 02:41:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10703 states to 10703 states and 17504 transitions. [2025-02-06 02:41:46,068 INFO L78 Accepts]: Start accepts. Automaton has 10703 states and 17504 transitions. Word has length 456 [2025-02-06 02:41:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:46,070 INFO L471 AbstractCegarLoop]: Abstraction has 10703 states and 17504 transitions. [2025-02-06 02:41:46,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10703 states and 17504 transitions. [2025-02-06 02:41:46,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:41:46,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:46,078 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:46,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:41:46,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:46,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:46,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1446539807, now seen corresponding path program 1 times [2025-02-06 02:41:46,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:46,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289826303] [2025-02-06 02:41:46,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:46,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:46,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:46,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:46,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:46,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:41:46,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:46,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289826303] [2025-02-06 02:41:46,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289826303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:46,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:46,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512550808] [2025-02-06 02:41:46,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:46,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:46,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:46,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:46,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:46,754 INFO L87 Difference]: Start difference. First operand 10703 states and 17504 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:47,234 INFO L93 Difference]: Finished difference Result 22179 states and 36314 transitions. [2025-02-06 02:41:47,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:47,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-02-06 02:41:47,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:47,272 INFO L225 Difference]: With dead ends: 22179 [2025-02-06 02:41:47,272 INFO L226 Difference]: Without dead ends: 12233 [2025-02-06 02:41:47,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:47,294 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 338 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:47,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1719 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2025-02-06 02:41:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 8215. [2025-02-06 02:41:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8215 states, 7263 states have (on average 1.6018174308137134) internal successors, (11634), 7287 states have internal predecessors, (11634), 907 states have call successors, (907), 44 states have call predecessors, (907), 44 states have return successors, (907), 883 states have call predecessors, (907), 907 states have call successors, (907) [2025-02-06 02:41:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8215 states to 8215 states and 13448 transitions. [2025-02-06 02:41:47,961 INFO L78 Accepts]: Start accepts. Automaton has 8215 states and 13448 transitions. Word has length 456 [2025-02-06 02:41:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:47,962 INFO L471 AbstractCegarLoop]: Abstraction has 8215 states and 13448 transitions. [2025-02-06 02:41:47,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:41:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 8215 states and 13448 transitions. [2025-02-06 02:41:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:41:47,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:47,972 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:47,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:41:47,973 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:47,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1191803262, now seen corresponding path program 1 times [2025-02-06 02:41:47,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:47,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065954841] [2025-02-06 02:41:47,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:48,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:51,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:51,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:51,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 6 proven. 192 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-02-06 02:41:51,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065954841] [2025-02-06 02:41:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065954841] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:51,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173036400] [2025-02-06 02:41:51,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:51,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:51,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:51,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:41:51,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:41:51,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:41:51,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:41:51,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:51,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:51,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:41:51,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4416 proven. 111 refuted. 0 times theorem prover too weak. 4317 trivial. 0 not checked. [2025-02-06 02:41:52,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:41:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 87 proven. 111 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-02-06 02:41:52,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173036400] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:41:52,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:41:52,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 02:41:52,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638129809] [2025-02-06 02:41:52,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:41:52,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:41:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:52,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:41:52,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:41:52,992 INFO L87 Difference]: Start difference. First operand 8215 states and 13448 transitions. Second operand has 8 states, 8 states have (on average 23.5) internal successors, (188), 8 states have internal predecessors, (188), 3 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (170), 3 states have call predecessors, (170), 3 states have call successors, (170) [2025-02-06 02:41:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:53,655 INFO L93 Difference]: Finished difference Result 12973 states and 21131 transitions. [2025-02-06 02:41:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:41:53,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.5) internal successors, (188), 8 states have internal predecessors, (188), 3 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (170), 3 states have call predecessors, (170), 3 states have call successors, (170) Word has length 456 [2025-02-06 02:41:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:53,670 INFO L225 Difference]: With dead ends: 12973 [2025-02-06 02:41:53,670 INFO L226 Difference]: Without dead ends: 4905 [2025-02-06 02:41:53,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 925 GetRequests, 909 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:41:53,678 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 437 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:53,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 699 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2025-02-06 02:41:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4000. [2025-02-06 02:41:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4000 states, 3137 states have (on average 1.4947401976410584) internal successors, (4689), 3146 states have internal predecessors, (4689), 809 states have call successors, (809), 53 states have call predecessors, (809), 53 states have return successors, (809), 800 states have call predecessors, (809), 809 states have call successors, (809) [2025-02-06 02:41:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4000 states to 4000 states and 6307 transitions. [2025-02-06 02:41:53,983 INFO L78 Accepts]: Start accepts. Automaton has 4000 states and 6307 transitions. Word has length 456 [2025-02-06 02:41:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:53,984 INFO L471 AbstractCegarLoop]: Abstraction has 4000 states and 6307 transitions. [2025-02-06 02:41:53,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.5) internal successors, (188), 8 states have internal predecessors, (188), 3 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (170), 3 states have call predecessors, (170), 3 states have call successors, (170) [2025-02-06 02:41:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4000 states and 6307 transitions. [2025-02-06 02:41:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-02-06 02:41:53,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:53,988 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:54,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:41:54,193 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-02-06 02:41:54,193 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:54,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash 797935774, now seen corresponding path program 1 times [2025-02-06 02:41:54,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:54,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111524309] [2025-02-06 02:41:54,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:54,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:54,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-02-06 02:41:54,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-02-06 02:41:54,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:54,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:41:56,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:56,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111524309] [2025-02-06 02:41:56,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111524309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:56,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:56,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:41:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302484532] [2025-02-06 02:41:56,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:56,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:41:56,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:56,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:41:56,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:41:56,153 INFO L87 Difference]: Start difference. First operand 4000 states and 6307 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 3 states have call successors, (67) [2025-02-06 02:41:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:57,784 INFO L93 Difference]: Finished difference Result 11081 states and 17464 transitions. [2025-02-06 02:41:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:41:57,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 3 states have call successors, (67) Word has length 458 [2025-02-06 02:41:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:57,803 INFO L225 Difference]: With dead ends: 11081 [2025-02-06 02:41:57,804 INFO L226 Difference]: Without dead ends: 7207 [2025-02-06 02:41:57,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:41:57,812 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 2078 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:57,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 1970 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 02:41:57,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7207 states. [2025-02-06 02:41:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7207 to 4881. [2025-02-06 02:41:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4881 states, 4015 states have (on average 1.5235367372353674) internal successors, (6117), 4023 states have internal predecessors, (6117), 811 states have call successors, (811), 54 states have call predecessors, (811), 54 states have return successors, (811), 803 states have call predecessors, (811), 811 states have call successors, (811) [2025-02-06 02:41:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 7739 transitions. [2025-02-06 02:41:58,083 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 7739 transitions. Word has length 458 [2025-02-06 02:41:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:58,084 INFO L471 AbstractCegarLoop]: Abstraction has 4881 states and 7739 transitions. [2025-02-06 02:41:58,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 3 states have call successors, (67) [2025-02-06 02:41:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 7739 transitions. [2025-02-06 02:41:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-02-06 02:41:58,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:58,090 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:41:58,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:41:58,090 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:58,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1664987999, now seen corresponding path program 1 times [2025-02-06 02:41:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:58,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996964188] [2025-02-06 02:41:58,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:58,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:58,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-02-06 02:41:58,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-02-06 02:41:58,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:58,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:41:59,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:59,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996964188] [2025-02-06 02:41:59,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996964188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:59,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:59,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:41:59,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124405868] [2025-02-06 02:41:59,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:59,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:41:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:59,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:41:59,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:59,199 INFO L87 Difference]: Start difference. First operand 4881 states and 7739 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-06 02:41:59,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:59,930 INFO L93 Difference]: Finished difference Result 12895 states and 20397 transitions. [2025-02-06 02:41:59,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:41:59,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 458 [2025-02-06 02:41:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:59,955 INFO L225 Difference]: With dead ends: 12895 [2025-02-06 02:41:59,955 INFO L226 Difference]: Without dead ends: 8669 [2025-02-06 02:41:59,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:41:59,964 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 428 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:59,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 908 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:41:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8669 states. [2025-02-06 02:42:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8669 to 7979. [2025-02-06 02:42:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7979 states, 6985 states have (on average 1.541159627773801) internal successors, (10765), 7009 states have internal predecessors, (10765), 907 states have call successors, (907), 86 states have call predecessors, (907), 86 states have return successors, (907), 883 states have call predecessors, (907), 907 states have call successors, (907) [2025-02-06 02:42:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 12579 transitions. [2025-02-06 02:42:00,408 INFO L78 Accepts]: Start accepts. Automaton has 7979 states and 12579 transitions. Word has length 458 [2025-02-06 02:42:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:00,410 INFO L471 AbstractCegarLoop]: Abstraction has 7979 states and 12579 transitions. [2025-02-06 02:42:00,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-06 02:42:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7979 states and 12579 transitions. [2025-02-06 02:42:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-02-06 02:42:00,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:00,416 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:42:00,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:42:00,417 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:00,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:00,417 INFO L85 PathProgramCache]: Analyzing trace with hash 820516128, now seen corresponding path program 1 times [2025-02-06 02:42:00,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:00,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235295708] [2025-02-06 02:42:00,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:00,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:00,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-02-06 02:42:02,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-02-06 02:42:02,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:02,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 18 proven. 180 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-02-06 02:42:02,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:02,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235295708] [2025-02-06 02:42:02,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235295708] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:42:02,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284574635] [2025-02-06 02:42:02,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:02,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:02,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:02,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:42:02,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:42:02,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-02-06 02:42:02,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-02-06 02:42:02,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:02,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:02,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 02:42:02,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:42:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4482 proven. 102 refuted. 0 times theorem prover too weak. 4260 trivial. 0 not checked. [2025-02-06 02:42:03,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:42:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 96 proven. 102 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-02-06 02:42:03,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284574635] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:42:03,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:42:03,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-02-06 02:42:03,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681612009] [2025-02-06 02:42:03,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:42:03,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:42:03,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:03,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:42:03,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:42:03,523 INFO L87 Difference]: Start difference. First operand 7979 states and 12579 transitions. Second operand has 13 states, 13 states have (on average 18.923076923076923) internal successors, (246), 13 states have internal predecessors, (246), 4 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 4 states have call predecessors, (163), 4 states have call successors, (163) [2025-02-06 02:42:04,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:04,605 INFO L93 Difference]: Finished difference Result 16739 states and 26266 transitions. [2025-02-06 02:42:04,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 02:42:04,605 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.923076923076923) internal successors, (246), 13 states have internal predecessors, (246), 4 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 4 states have call predecessors, (163), 4 states have call successors, (163) Word has length 458 [2025-02-06 02:42:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:04,630 INFO L225 Difference]: With dead ends: 16739 [2025-02-06 02:42:04,630 INFO L226 Difference]: Without dead ends: 8896 [2025-02-06 02:42:04,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 910 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=543, Unknown=0, NotChecked=0, Total=756 [2025-02-06 02:42:04,641 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 1117 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:04,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1368 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:42:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8896 states. [2025-02-06 02:42:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8896 to 8780. [2025-02-06 02:42:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8780 states, 7367 states have (on average 1.5158137640830731) internal successors, (11167), 7391 states have internal predecessors, (11167), 1275 states have call successors, (1275), 137 states have call predecessors, (1275), 137 states have return successors, (1275), 1251 states have call predecessors, (1275), 1275 states have call successors, (1275) [2025-02-06 02:42:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 13717 transitions. [2025-02-06 02:42:05,090 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 13717 transitions. Word has length 458 [2025-02-06 02:42:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:05,090 INFO L471 AbstractCegarLoop]: Abstraction has 8780 states and 13717 transitions. [2025-02-06 02:42:05,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.923076923076923) internal successors, (246), 13 states have internal predecessors, (246), 4 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 4 states have call predecessors, (163), 4 states have call successors, (163) [2025-02-06 02:42:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 13717 transitions. [2025-02-06 02:42:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-06 02:42:05,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:05,096 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:42:05,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 02:42:05,301 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-02-06 02:42:05,301 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:05,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:05,303 INFO L85 PathProgramCache]: Analyzing trace with hash -832157109, now seen corresponding path program 1 times [2025-02-06 02:42:05,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:05,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049003356] [2025-02-06 02:42:05,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:05,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:05,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-06 02:42:08,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-06 02:42:08,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:08,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:42:13,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:13,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049003356] [2025-02-06 02:42:13,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049003356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:13,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:13,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 02:42:13,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893354427] [2025-02-06 02:42:13,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:13,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 02:42:13,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:13,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 02:42:13,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:42:13,743 INFO L87 Difference]: Start difference. First operand 8780 states and 13717 transitions. Second operand has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 15 states have internal predecessors, (127), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:42:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:18,108 INFO L93 Difference]: Finished difference Result 50549 states and 79974 transitions. [2025-02-06 02:42:18,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 02:42:18,109 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 15 states have internal predecessors, (127), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 459 [2025-02-06 02:42:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:18,177 INFO L225 Difference]: With dead ends: 50549 [2025-02-06 02:42:18,178 INFO L226 Difference]: Without dead ends: 43187 [2025-02-06 02:42:18,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-02-06 02:42:18,200 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 2634 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2634 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:18,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2634 Valid, 2981 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-06 02:42:18,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43187 states. [2025-02-06 02:42:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43187 to 13088. [2025-02-06 02:42:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13088 states, 11675 states have (on average 1.5498929336188436) internal successors, (18095), 11699 states have internal predecessors, (18095), 1275 states have call successors, (1275), 137 states have call predecessors, (1275), 137 states have return successors, (1275), 1251 states have call predecessors, (1275), 1275 states have call successors, (1275) [2025-02-06 02:42:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13088 states to 13088 states and 20645 transitions. [2025-02-06 02:42:18,858 INFO L78 Accepts]: Start accepts. Automaton has 13088 states and 20645 transitions. Word has length 459 [2025-02-06 02:42:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:18,859 INFO L471 AbstractCegarLoop]: Abstraction has 13088 states and 20645 transitions. [2025-02-06 02:42:18,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 15 states have internal predecessors, (127), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-02-06 02:42:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 13088 states and 20645 transitions. [2025-02-06 02:42:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-06 02:42:18,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:18,867 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:42:18,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:42:18,867 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:18,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1794941547, now seen corresponding path program 1 times [2025-02-06 02:42:18,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:18,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267961993] [2025-02-06 02:42:18,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:18,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:18,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-06 02:42:20,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-06 02:42:20,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:20,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 195 proven. 3 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-02-06 02:42:20,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:20,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267961993] [2025-02-06 02:42:20,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267961993] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:42:20,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724184709] [2025-02-06 02:42:20,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:20,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:20,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:20,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:42:20,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 02:42:20,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-06 02:42:20,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-06 02:42:20,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:20,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:20,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:42:20,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:42:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 456 proven. 3 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-02-06 02:42:20,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:42:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 195 proven. 3 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-02-06 02:42:21,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724184709] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:42:21,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:42:21,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 02:42:21,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856517146] [2025-02-06 02:42:21,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:42:21,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:42:21,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:21,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:42:21,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:42:21,081 INFO L87 Difference]: Start difference. First operand 13088 states and 20645 transitions. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 2 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-06 02:42:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:21,782 INFO L93 Difference]: Finished difference Result 20848 states and 32587 transitions. [2025-02-06 02:42:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:42:21,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 2 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) Word has length 459 [2025-02-06 02:42:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:21,814 INFO L225 Difference]: With dead ends: 20848 [2025-02-06 02:42:21,814 INFO L226 Difference]: Without dead ends: 9420 [2025-02-06 02:42:21,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 915 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:42:21,830 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 484 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:21,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 775 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:42:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9420 states. [2025-02-06 02:42:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9420 to 9314. [2025-02-06 02:42:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9314 states, 7892 states have (on average 1.5093765838824125) internal successors, (11912), 7916 states have internal predecessors, (11912), 1275 states have call successors, (1275), 146 states have call predecessors, (1275), 146 states have return successors, (1275), 1251 states have call predecessors, (1275), 1275 states have call successors, (1275) [2025-02-06 02:42:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9314 states to 9314 states and 14462 transitions. [2025-02-06 02:42:22,352 INFO L78 Accepts]: Start accepts. Automaton has 9314 states and 14462 transitions. Word has length 459 [2025-02-06 02:42:22,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:22,353 INFO L471 AbstractCegarLoop]: Abstraction has 9314 states and 14462 transitions. [2025-02-06 02:42:22,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 2 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-06 02:42:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9314 states and 14462 transitions. [2025-02-06 02:42:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-06 02:42:22,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:22,361 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:42:22,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 02:42:22,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 02:42:22,562 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:22,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:22,563 INFO L85 PathProgramCache]: Analyzing trace with hash 279536655, now seen corresponding path program 1 times [2025-02-06 02:42:22,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:22,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970726930] [2025-02-06 02:42:22,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:22,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:22,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-06 02:42:24,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-06 02:42:24,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:24,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-02-06 02:42:25,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:25,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970726930] [2025-02-06 02:42:25,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970726930] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:42:25,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337883903] [2025-02-06 02:42:25,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:25,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:25,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:25,317 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:42:25,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:42:25,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-06 02:42:25,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-06 02:42:25,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:25,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:25,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 02:42:25,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:42:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 1118 proven. 378 refuted. 0 times theorem prover too weak. 7348 trivial. 0 not checked. [2025-02-06 02:42:27,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:42:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 12 proven. 381 refuted. 0 times theorem prover too weak. 8451 trivial. 0 not checked. [2025-02-06 02:42:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337883903] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:42:28,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:42:28,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 20 [2025-02-06 02:42:28,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191123405] [2025-02-06 02:42:28,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:42:28,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 02:42:28,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:28,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 02:42:28,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-02-06 02:42:28,549 INFO L87 Difference]: Start difference. First operand 9314 states and 14462 transitions. Second operand has 20 states, 20 states have (on average 17.5) internal successors, (350), 20 states have internal predecessors, (350), 5 states have call successors, (199), 3 states have call predecessors, (199), 7 states have return successors, (200), 4 states have call predecessors, (200), 5 states have call successors, (200) [2025-02-06 02:42:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:32,447 INFO L93 Difference]: Finished difference Result 34190 states and 50892 transitions. [2025-02-06 02:42:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-02-06 02:42:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 17.5) internal successors, (350), 20 states have internal predecessors, (350), 5 states have call successors, (199), 3 states have call predecessors, (199), 7 states have return successors, (200), 4 states have call predecessors, (200), 5 states have call successors, (200) Word has length 460 [2025-02-06 02:42:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:32,518 INFO L225 Difference]: With dead ends: 34190 [2025-02-06 02:42:32,518 INFO L226 Difference]: Without dead ends: 26124 [2025-02-06 02:42:32,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 987 GetRequests, 917 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1141, Invalid=3971, Unknown=0, NotChecked=0, Total=5112 [2025-02-06 02:42:32,539 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 1666 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 2742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:32,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1667 Valid, 2220 Invalid, 2742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 02:42:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26124 states. [2025-02-06 02:42:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26124 to 14089. [2025-02-06 02:42:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14089 states, 12056 states have (on average 1.4607664233576643) internal successors, (17611), 12144 states have internal predecessors, (17611), 1595 states have call successors, (1595), 437 states have call predecessors, (1595), 437 states have return successors, (1595), 1507 states have call predecessors, (1595), 1595 states have call successors, (1595) [2025-02-06 02:42:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14089 states to 14089 states and 20801 transitions. [2025-02-06 02:42:33,596 INFO L78 Accepts]: Start accepts. Automaton has 14089 states and 20801 transitions. Word has length 460 [2025-02-06 02:42:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:33,597 INFO L471 AbstractCegarLoop]: Abstraction has 14089 states and 20801 transitions. [2025-02-06 02:42:33,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 17.5) internal successors, (350), 20 states have internal predecessors, (350), 5 states have call successors, (199), 3 states have call predecessors, (199), 7 states have return successors, (200), 4 states have call predecessors, (200), 5 states have call successors, (200) [2025-02-06 02:42:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 14089 states and 20801 transitions. [2025-02-06 02:42:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-06 02:42:33,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:33,607 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:42:33,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 02:42:33,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 02:42:33,808 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:33,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:33,808 INFO L85 PathProgramCache]: Analyzing trace with hash 950332942, now seen corresponding path program 1 times [2025-02-06 02:42:33,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:33,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926352610] [2025-02-06 02:42:33,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:33,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:33,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-06 02:42:35,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-06 02:42:35,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:35,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-02-06 02:42:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926352610] [2025-02-06 02:42:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926352610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:37,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:37,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 02:42:37,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807408865] [2025-02-06 02:42:37,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:37,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:42:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:37,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:42:37,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:42:37,376 INFO L87 Difference]: Start difference. First operand 14089 states and 20801 transitions. Second operand has 12 states, 12 states have (on average 10.666666666666666) internal successors, (128), 12 states have internal predecessors, (128), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)