./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-6.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_fillercode_fillercodesize_ps-cn-250_file-6.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 cec5185ce7c24944b55ad80283733eba2f5aa0d5d2e63517a5d5bc6bcf21ed8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:37:29,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:37:29,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:37:29,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:37:29,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:37:29,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:37:29,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:37:29,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:37:29,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:37:29,505 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:37:29,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:37:29,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:37:29,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:37:29,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:37:29,506 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:37:29,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:37:29,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:37:29,506 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:37:29,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:37:29,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:37:29,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:37:29,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:37:29,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:37:29,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:37:29,507 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:37:29,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:37:29,507 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:37:29,507 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:37:29,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:37:29,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:37:29,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:37:29,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:37:29,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:37:29,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:37:29,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:37:29,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:37:29,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:37:29,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:37:29,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:37:29,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:37:29,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:37:29,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:37:29,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:37:29,508 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 -> cec5185ce7c24944b55ad80283733eba2f5aa0d5d2e63517a5d5bc6bcf21ed8e [2025-02-05 21:37:29,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:37:29,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:37:29,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:37:29,841 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:37:29,841 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:37:29,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-6.i [2025-02-05 21:37:31,241 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec7f8be71/7926026753434b75af49c018c0047ace/FLAG011d5cf71 [2025-02-05 21:37:31,554 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:37:31,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-6.i [2025-02-05 21:37:31,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec7f8be71/7926026753434b75af49c018c0047ace/FLAG011d5cf71 [2025-02-05 21:37:31,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec7f8be71/7926026753434b75af49c018c0047ace [2025-02-05 21:37:31,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:37:31,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:37:31,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:37:31,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:37:31,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:37:31,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349dc507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31, skipping insertion in model container [2025-02-05 21:37:31,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:37:31,738 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_fillercode_fillercodesize_ps-cn-250_file-6.i[915,928] [2025-02-05 21:37:31,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:37:31,876 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:37:31,886 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_fillercode_fillercodesize_ps-cn-250_file-6.i[915,928] [2025-02-05 21:37:31,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:37:31,968 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:37:31,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31 WrapperNode [2025-02-05 21:37:31,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:37:31,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:37:31,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:37:31,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:37:31,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:32,052 INFO L138 Inliner]: procedures = 26, calls = 84, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519 [2025-02-05 21:37:32,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:37:32,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:37:32,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:37:32,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:37:32,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:32,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:32,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:32,115 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:37:32,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:32,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:32,143 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:32,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:32,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:32,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:32,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:37:32,175 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:37:32,175 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:37:32,175 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:37:32,177 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:32,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:37:32,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:37:32,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:37:32,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:37:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:37:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:37:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:37:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:37:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:37:32,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:37:32,354 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:37:32,356 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:37:33,218 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-05 21:37:33,219 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:37:33,252 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:37:33,252 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:37:33,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:37:33 BoogieIcfgContainer [2025-02-05 21:37:33,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:37:33,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:37:33,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:37:33,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:37:33,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:37:31" (1/3) ... [2025-02-05 21:37:33,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538c13d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:37:33, skipping insertion in model container [2025-02-05 21:37:33,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (2/3) ... [2025-02-05 21:37:33,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538c13d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:37:33, skipping insertion in model container [2025-02-05 21:37:33,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:37:33" (3/3) ... [2025-02-05 21:37:33,263 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-6.i [2025-02-05 21:37:33,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:37:33,280 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-6.i that has 2 procedures, 216 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:37:33,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:37:33,369 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;@d629da0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:37:33,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:37:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 143 states have internal predecessors, (216), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-05 21:37:33,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-02-05 21:37:33,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:33,402 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:33,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:33,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:33,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1010758029, now seen corresponding path program 1 times [2025-02-05 21:37:33,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:33,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632513204] [2025-02-05 21:37:33,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:33,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:33,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-02-05 21:37:33,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-02-05 21:37:33,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:33,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-02-05 21:37:34,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:34,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632513204] [2025-02-05 21:37:34,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632513204] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:37:34,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790263529] [2025-02-05 21:37:34,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:34,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:37:34,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:37:34,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:37:34,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:37:34,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-02-05 21:37:34,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-02-05 21:37:34,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:34,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:34,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:37:34,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:37:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-02-05 21:37:34,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:37:34,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790263529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:34,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:37:34,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:37:34,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607437759] [2025-02-05 21:37:34,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:34,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:37:34,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:34,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:37:34,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:37:34,520 INFO L87 Difference]: Start difference. First operand has 216 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 143 states have internal predecessors, (216), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-05 21:37:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:34,580 INFO L93 Difference]: Finished difference Result 426 states and 782 transitions. [2025-02-05 21:37:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:37:34,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) Word has length 448 [2025-02-05 21:37:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:34,595 INFO L225 Difference]: With dead ends: 426 [2025-02-05 21:37:34,595 INFO L226 Difference]: Without dead ends: 213 [2025-02-05 21:37:34,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 449 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-05 21:37:34,607 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:34,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:37:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-05 21:37:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-02-05 21:37:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 140 states have internal predecessors, (207), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-05 21:37:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 349 transitions. [2025-02-05 21:37:34,688 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 349 transitions. Word has length 448 [2025-02-05 21:37:34,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:34,690 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 349 transitions. [2025-02-05 21:37:34,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-05 21:37:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 349 transitions. [2025-02-05 21:37:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-02-05 21:37:34,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:34,706 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:34,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:37:34,907 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-05 21:37:34,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:34,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:34,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1108323517, now seen corresponding path program 1 times [2025-02-05 21:37:34,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:34,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36748813] [2025-02-05 21:37:34,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:34,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:34,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-02-05 21:37:35,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-02-05 21:37:35,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:35,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:37:35,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:35,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36748813] [2025-02-05 21:37:35,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36748813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:35,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:35,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:37:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550834712] [2025-02-05 21:37:35,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:35,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:37:35,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:35,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:37:35,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:35,454 INFO L87 Difference]: Start difference. First operand 213 states and 349 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:35,576 INFO L93 Difference]: Finished difference Result 529 states and 870 transitions. [2025-02-05 21:37:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:37:35,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 449 [2025-02-05 21:37:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:35,583 INFO L225 Difference]: With dead ends: 529 [2025-02-05 21:37:35,584 INFO L226 Difference]: Without dead ends: 319 [2025-02-05 21:37:35,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:35,585 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 165 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:35,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 742 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:37:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-05 21:37:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2025-02-05 21:37:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 229 states have (on average 1.519650655021834) internal successors, (348), 230 states have internal predecessors, (348), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:37:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 516 transitions. [2025-02-05 21:37:35,648 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 516 transitions. Word has length 449 [2025-02-05 21:37:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:35,652 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 516 transitions. [2025-02-05 21:37:35,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 516 transitions. [2025-02-05 21:37:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-02-05 21:37:35,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:35,663 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:35,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:37:35,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:35,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1215138870, now seen corresponding path program 1 times [2025-02-05 21:37:35,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:35,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521345058] [2025-02-05 21:37:35,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:35,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:35,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-02-05 21:37:35,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-02-05 21:37:35,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:35,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:37:36,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:36,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521345058] [2025-02-05 21:37:36,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521345058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:36,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:36,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:37:36,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017612989] [2025-02-05 21:37:36,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:36,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:37:36,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:36,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:37:36,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:36,042 INFO L87 Difference]: Start difference. First operand 316 states and 516 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:36,145 INFO L93 Difference]: Finished difference Result 826 states and 1344 transitions. [2025-02-05 21:37:36,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:37:36,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 451 [2025-02-05 21:37:36,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:36,158 INFO L225 Difference]: With dead ends: 826 [2025-02-05 21:37:36,158 INFO L226 Difference]: Without dead ends: 513 [2025-02-05 21:37:36,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:36,160 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 203 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:36,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 836 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:37:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-02-05 21:37:36,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2025-02-05 21:37:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 363 states have (on average 1.4820936639118458) internal successors, (538), 366 states have internal predecessors, (538), 142 states have call successors, (142), 4 states have call predecessors, (142), 4 states have return successors, (142), 139 states have call predecessors, (142), 142 states have call successors, (142) [2025-02-05 21:37:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 822 transitions. [2025-02-05 21:37:36,237 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 822 transitions. Word has length 451 [2025-02-05 21:37:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:36,242 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 822 transitions. [2025-02-05 21:37:36,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 822 transitions. [2025-02-05 21:37:36,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-02-05 21:37:36,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:36,251 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:36,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:37:36,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:36,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:36,253 INFO L85 PathProgramCache]: Analyzing trace with hash -91398695, now seen corresponding path program 1 times [2025-02-05 21:37:36,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:36,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333321406] [2025-02-05 21:37:36,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:36,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:36,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-02-05 21:37:36,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-02-05 21:37:36,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:36,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:37:36,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:36,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333321406] [2025-02-05 21:37:36,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333321406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:36,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:36,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:37:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131183121] [2025-02-05 21:37:36,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:36,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:37:36,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:36,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:37:36,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:37:36,883 INFO L87 Difference]: Start difference. First operand 510 states and 822 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:37,304 INFO L93 Difference]: Finished difference Result 1400 states and 2267 transitions. [2025-02-05 21:37:37,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:37:37,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 452 [2025-02-05 21:37:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:37,316 INFO L225 Difference]: With dead ends: 1400 [2025-02-05 21:37:37,316 INFO L226 Difference]: Without dead ends: 893 [2025-02-05 21:37:37,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:37,319 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 310 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:37,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1010 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:37:37,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-02-05 21:37:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 827. [2025-02-05 21:37:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 607 states have (on average 1.5107084019769357) internal successors, (917), 610 states have internal predecessors, (917), 213 states have call successors, (213), 6 states have call predecessors, (213), 6 states have return successors, (213), 210 states have call predecessors, (213), 213 states have call successors, (213) [2025-02-05 21:37:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1343 transitions. [2025-02-05 21:37:37,419 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1343 transitions. Word has length 452 [2025-02-05 21:37:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:37,420 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1343 transitions. [2025-02-05 21:37:37,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1343 transitions. [2025-02-05 21:37:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-02-05 21:37:37,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:37,428 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:37,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:37:37,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:37,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:37,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1338247185, now seen corresponding path program 1 times [2025-02-05 21:37:37,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:37,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115313919] [2025-02-05 21:37:37,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:37,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:37,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-02-05 21:37:37,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-02-05 21:37:37,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:37,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:37,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:37:37,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:37,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115313919] [2025-02-05 21:37:37,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115313919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:37,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:37,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:37:37,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789170260] [2025-02-05 21:37:37,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:37,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:37:37,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:37,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:37:37,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:37,914 INFO L87 Difference]: Start difference. First operand 827 states and 1343 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:38,035 INFO L93 Difference]: Finished difference Result 1985 states and 3219 transitions. [2025-02-05 21:37:38,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:37:38,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 453 [2025-02-05 21:37:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:38,071 INFO L225 Difference]: With dead ends: 1985 [2025-02-05 21:37:38,071 INFO L226 Difference]: Without dead ends: 1418 [2025-02-05 21:37:38,073 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-05 21:37:38,073 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 340 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:38,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 944 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:37:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-02-05 21:37:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 875. [2025-02-05 21:37:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 655 states have (on average 1.5038167938931297) internal successors, (985), 658 states have internal predecessors, (985), 213 states have call successors, (213), 6 states have call predecessors, (213), 6 states have return successors, (213), 210 states have call predecessors, (213), 213 states have call successors, (213) [2025-02-05 21:37:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1411 transitions. [2025-02-05 21:37:38,173 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1411 transitions. Word has length 453 [2025-02-05 21:37:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:38,176 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1411 transitions. [2025-02-05 21:37:38,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1411 transitions. [2025-02-05 21:37:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-02-05 21:37:38,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:38,187 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:38,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:37:38,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:38,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:38,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1271240432, now seen corresponding path program 1 times [2025-02-05 21:37:38,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:38,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616126248] [2025-02-05 21:37:38,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:38,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:38,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-02-05 21:37:38,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-02-05 21:37:38,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:38,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:37:40,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:40,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616126248] [2025-02-05 21:37:40,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616126248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:40,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:40,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:37:40,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750928575] [2025-02-05 21:37:40,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:40,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:37:40,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:40,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:37:40,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:40,266 INFO L87 Difference]: Start difference. First operand 875 states and 1411 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:40,854 INFO L93 Difference]: Finished difference Result 2148 states and 3469 transitions. [2025-02-05 21:37:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:37:40,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 453 [2025-02-05 21:37:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:40,869 INFO L225 Difference]: With dead ends: 2148 [2025-02-05 21:37:40,869 INFO L226 Difference]: Without dead ends: 1585 [2025-02-05 21:37:40,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:37:40,873 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 201 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:40,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1167 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:37:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-02-05 21:37:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1551. [2025-02-05 21:37:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1185 states have (on average 1.5029535864978902) internal successors, (1781), 1191 states have internal predecessors, (1781), 355 states have call successors, (355), 10 states have call predecessors, (355), 10 states have return successors, (355), 349 states have call predecessors, (355), 355 states have call successors, (355) [2025-02-05 21:37:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2491 transitions. [2025-02-05 21:37:41,012 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2491 transitions. Word has length 453 [2025-02-05 21:37:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:41,013 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2491 transitions. [2025-02-05 21:37:41,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2491 transitions. [2025-02-05 21:37:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-02-05 21:37:41,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:41,018 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:41,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:37:41,018 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:41,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:41,019 INFO L85 PathProgramCache]: Analyzing trace with hash 426768561, now seen corresponding path program 1 times [2025-02-05 21:37:41,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:41,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482271967] [2025-02-05 21:37:41,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:41,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:41,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-02-05 21:37:41,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-02-05 21:37:41,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:41,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:37:41,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:41,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482271967] [2025-02-05 21:37:41,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482271967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:41,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:41,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:37:41,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364473748] [2025-02-05 21:37:41,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:41,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:37:41,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:41,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:37:41,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:37:41,904 INFO L87 Difference]: Start difference. First operand 1551 states and 2491 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:42,657 INFO L93 Difference]: Finished difference Result 6227 states and 10029 transitions. [2025-02-05 21:37:42,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:37:42,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 453 [2025-02-05 21:37:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:42,692 INFO L225 Difference]: With dead ends: 6227 [2025-02-05 21:37:42,692 INFO L226 Difference]: Without dead ends: 4827 [2025-02-05 21:37:42,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:37:42,699 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 967 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:42,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1493 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:37:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2025-02-05 21:37:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 2676. [2025-02-05 21:37:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2676 states, 2190 states have (on average 1.5401826484018264) internal successors, (3373), 2204 states have internal predecessors, (3373), 467 states have call successors, (467), 18 states have call predecessors, (467), 18 states have return successors, (467), 453 states have call predecessors, (467), 467 states have call successors, (467) [2025-02-05 21:37:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 4307 transitions. [2025-02-05 21:37:42,921 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 4307 transitions. Word has length 453 [2025-02-05 21:37:42,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:42,922 INFO L471 AbstractCegarLoop]: Abstraction has 2676 states and 4307 transitions. [2025-02-05 21:37:42,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 4307 transitions. [2025-02-05 21:37:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-02-05 21:37:42,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:42,928 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:42,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:37:42,928 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:42,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1508891726, now seen corresponding path program 1 times [2025-02-05 21:37:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:42,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905195181] [2025-02-05 21:37:42,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:42,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:42,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-02-05 21:37:43,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-02-05 21:37:43,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:43,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 33 proven. 177 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-05 21:37:43,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905195181] [2025-02-05 21:37:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905195181] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:37:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505027905] [2025-02-05 21:37:43,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:43,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:37:43,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:37:43,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:37:43,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:37:43,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-02-05 21:37:44,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-02-05 21:37:44,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:44,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:44,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:37:44,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:37:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 3984 proven. 153 refuted. 0 times theorem prover too weak. 5803 trivial. 0 not checked. [2025-02-05 21:37:44,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:37:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 57 proven. 153 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-05 21:37:45,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505027905] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:37:45,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:37:45,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-05 21:37:45,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004067493] [2025-02-05 21:37:45,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:37:45,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:37:45,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:45,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:37:45,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:37:45,039 INFO L87 Difference]: Start difference. First operand 2676 states and 4307 transitions. Second operand has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 3 states have call successors, (181), 2 states have call predecessors, (181), 4 states have return successors, (183), 3 states have call predecessors, (183), 3 states have call successors, (183) [2025-02-05 21:37:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:47,187 INFO L93 Difference]: Finished difference Result 10964 states and 17170 transitions. [2025-02-05 21:37:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-05 21:37:47,188 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 3 states have call successors, (181), 2 states have call predecessors, (181), 4 states have return successors, (183), 3 states have call predecessors, (183), 3 states have call successors, (183) Word has length 453 [2025-02-05 21:37:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:47,239 INFO L225 Difference]: With dead ends: 10964 [2025-02-05 21:37:47,239 INFO L226 Difference]: Without dead ends: 8446 [2025-02-05 21:37:47,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 908 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=457, Invalid=1265, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 21:37:47,253 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 1666 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:47,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 1254 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 21:37:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8446 states. [2025-02-05 21:37:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8446 to 2724. [2025-02-05 21:37:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2127 states have (on average 1.461212976022567) internal successors, (3108), 2149 states have internal predecessors, (3108), 547 states have call successors, (547), 49 states have call predecessors, (547), 49 states have return successors, (547), 525 states have call predecessors, (547), 547 states have call successors, (547) [2025-02-05 21:37:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 4202 transitions. [2025-02-05 21:37:47,607 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 4202 transitions. Word has length 453 [2025-02-05 21:37:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:47,608 INFO L471 AbstractCegarLoop]: Abstraction has 2724 states and 4202 transitions. [2025-02-05 21:37:47,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 3 states have call successors, (181), 2 states have call predecessors, (181), 4 states have return successors, (183), 3 states have call predecessors, (183), 3 states have call successors, (183) [2025-02-05 21:37:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 4202 transitions. [2025-02-05 21:37:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-02-05 21:37:47,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:47,614 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:47,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 21:37:47,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:37:47,815 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:47,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1668365102, now seen corresponding path program 1 times [2025-02-05 21:37:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:47,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938604657] [2025-02-05 21:37:47,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:47,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:47,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 21:37:47,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 21:37:47,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:47,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 186 proven. 24 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-05 21:37:49,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938604657] [2025-02-05 21:37:49,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938604657] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:37:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715153162] [2025-02-05 21:37:49,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:49,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:37:49,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:37:49,221 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:37:49,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 21:37:49,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 21:37:49,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 21:37:49,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:49,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:49,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 21:37:49,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:37:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 2399 proven. 48 refuted. 0 times theorem prover too weak. 7493 trivial. 0 not checked. [2025-02-05 21:37:51,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:37:54,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715153162] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:37:54,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 21:37:54,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2025-02-05 21:37:54,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368590352] [2025-02-05 21:37:54,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 21:37:54,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:37:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:54,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:37:54,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:37:54,019 INFO L87 Difference]: Start difference. First operand 2724 states and 4202 transitions. Second operand has 15 states, 15 states have (on average 13.133333333333333) internal successors, (197), 14 states have internal predecessors, (197), 5 states have call successors, (142), 4 states have call predecessors, (142), 6 states have return successors, (142), 5 states have call predecessors, (142), 5 states have call successors, (142) [2025-02-05 21:37:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:55,930 INFO L93 Difference]: Finished difference Result 6514 states and 10023 transitions. [2025-02-05 21:37:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 21:37:55,931 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.133333333333333) internal successors, (197), 14 states have internal predecessors, (197), 5 states have call successors, (142), 4 states have call predecessors, (142), 6 states have return successors, (142), 5 states have call predecessors, (142), 5 states have call successors, (142) Word has length 454 [2025-02-05 21:37:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:55,962 INFO L225 Difference]: With dead ends: 6514 [2025-02-05 21:37:55,963 INFO L226 Difference]: Without dead ends: 4438 [2025-02-05 21:37:55,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2025-02-05 21:37:55,974 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 1258 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 552 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 552 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:55,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 2028 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [552 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:37:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4438 states. [2025-02-05 21:37:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4438 to 3926. [2025-02-05 21:37:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3926 states, 3005 states have (on average 1.4386023294509152) internal successors, (4323), 3038 states have internal predecessors, (4323), 837 states have call successors, (837), 83 states have call predecessors, (837), 83 states have return successors, (837), 804 states have call predecessors, (837), 837 states have call successors, (837) [2025-02-05 21:37:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 5997 transitions. [2025-02-05 21:37:56,431 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 5997 transitions. Word has length 454 [2025-02-05 21:37:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:56,432 INFO L471 AbstractCegarLoop]: Abstraction has 3926 states and 5997 transitions. [2025-02-05 21:37:56,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.133333333333333) internal successors, (197), 14 states have internal predecessors, (197), 5 states have call successors, (142), 4 states have call predecessors, (142), 6 states have return successors, (142), 5 states have call predecessors, (142), 5 states have call successors, (142) [2025-02-05 21:37:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 5997 transitions. [2025-02-05 21:37:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-02-05 21:37:56,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:56,438 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:56,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 21:37:56,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:37:56,639 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:56,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1257399711, now seen corresponding path program 1 times [2025-02-05 21:37:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:56,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271224026] [2025-02-05 21:37:56,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:56,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 21:37:56,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 21:37:56,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:56,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:37:56,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:56,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271224026] [2025-02-05 21:37:56,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271224026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:56,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:56,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:37:56,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984264080] [2025-02-05 21:37:56,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:56,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:37:56,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:56,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:37:56,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:56,769 INFO L87 Difference]: Start difference. First operand 3926 states and 5997 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:57,139 INFO L93 Difference]: Finished difference Result 7368 states and 11220 transitions. [2025-02-05 21:37:57,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:37:57,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 454 [2025-02-05 21:37:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:57,176 INFO L225 Difference]: With dead ends: 7368 [2025-02-05 21:37:57,176 INFO L226 Difference]: Without dead ends: 3955 [2025-02-05 21:37:57,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:57,186 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 208 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:57,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 714 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:37:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2025-02-05 21:37:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 2668. [2025-02-05 21:37:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2152 states have (on average 1.4646840148698885) internal successors, (3152), 2167 states have internal predecessors, (3152), 467 states have call successors, (467), 48 states have call predecessors, (467), 48 states have return successors, (467), 452 states have call predecessors, (467), 467 states have call successors, (467) [2025-02-05 21:37:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4086 transitions. [2025-02-05 21:37:57,427 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4086 transitions. Word has length 454 [2025-02-05 21:37:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:57,427 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4086 transitions. [2025-02-05 21:37:57,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:37:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4086 transitions. [2025-02-05 21:37:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-02-05 21:37:57,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:57,432 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:57,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:37:57,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:57,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:57,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1087267330, now seen corresponding path program 1 times [2025-02-05 21:37:57,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:57,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107122767] [2025-02-05 21:37:57,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:57,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:57,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 21:37:57,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 21:37:57,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:57,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-05 21:37:57,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:57,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107122767] [2025-02-05 21:37:57,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107122767] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:37:57,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828635120] [2025-02-05 21:37:57,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:57,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:37:57,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:37:57,816 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-05 21:37:57,818 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-05 21:37:57,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 21:37:58,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 21:37:58,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:58,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:58,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:37:58,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:37:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 5040 proven. 105 refuted. 0 times theorem prover too weak. 4795 trivial. 0 not checked. [2025-02-05 21:37:58,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:37:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-05 21:37:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828635120] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:37:59,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:37:59,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 21:37:59,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141314599] [2025-02-05 21:37:59,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:37:59,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:37:59,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:59,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:37:59,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:37:59,125 INFO L87 Difference]: Start difference. First operand 2668 states and 4086 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 3 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (142), 3 states have call predecessors, (142), 3 states have call successors, (142) [2025-02-05 21:37:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:59,778 INFO L93 Difference]: Finished difference Result 4944 states and 7544 transitions. [2025-02-05 21:37:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:37:59,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 3 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (142), 3 states have call predecessors, (142), 3 states have call successors, (142) Word has length 454 [2025-02-05 21:37:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:59,799 INFO L225 Difference]: With dead ends: 4944 [2025-02-05 21:37:59,799 INFO L226 Difference]: Without dead ends: 2678 [2025-02-05 21:37:59,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 905 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:37:59,806 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 525 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:59,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 625 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:37:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-02-05 21:38:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2654. [2025-02-05 21:38:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2654 states, 2134 states have (on average 1.4592314901593253) internal successors, (3114), 2149 states have internal predecessors, (3114), 467 states have call successors, (467), 52 states have call predecessors, (467), 52 states have return successors, (467), 452 states have call predecessors, (467), 467 states have call successors, (467) [2025-02-05 21:38:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 4048 transitions. [2025-02-05 21:38:00,084 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 4048 transitions. Word has length 454 [2025-02-05 21:38:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:00,084 INFO L471 AbstractCegarLoop]: Abstraction has 2654 states and 4048 transitions. [2025-02-05 21:38:00,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 3 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (142), 3 states have call predecessors, (142), 3 states have call successors, (142) [2025-02-05 21:38:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 4048 transitions. [2025-02-05 21:38:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-02-05 21:38:00,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:00,097 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:38:00,107 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-05 21:38:00,300 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,SelfDestructingSolverStorable10 [2025-02-05 21:38:00,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:00,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:00,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1022666305, now seen corresponding path program 1 times [2025-02-05 21:38:00,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:00,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817310923] [2025-02-05 21:38:00,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:00,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:00,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 21:38:00,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 21:38:00,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:00,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 375 proven. 39 refuted. 0 times theorem prover too weak. 9526 trivial. 0 not checked. [2025-02-05 21:38:02,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:02,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817310923] [2025-02-05 21:38:02,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817310923] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:38:02,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600342186] [2025-02-05 21:38:02,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:02,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:38:02,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:38:02,104 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-05 21:38:02,113 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-05 21:38:02,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 21:38:02,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 21:38:02,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:02,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:02,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 21:38:02,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:38:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 2471 proven. 63 refuted. 0 times theorem prover too weak. 7406 trivial. 0 not checked. [2025-02-05 21:38:04,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:38:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 576 proven. 45 refuted. 0 times theorem prover too weak. 9319 trivial. 0 not checked. [2025-02-05 21:38:14,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600342186] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:38:14,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:38:14,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 16] total 39 [2025-02-05 21:38:14,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865643366] [2025-02-05 21:38:14,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:38:14,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-05 21:38:14,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:14,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-05 21:38:14,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1033, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 21:38:14,176 INFO L87 Difference]: Start difference. First operand 2654 states and 4048 transitions. Second operand has 39 states, 37 states have (on average 8.108108108108109) internal successors, (300), 35 states have internal predecessors, (300), 15 states have call successors, (213), 7 states have call predecessors, (213), 13 states have return successors, (213), 15 states have call predecessors, (213), 15 states have call successors, (213)