./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-3.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-100_file-3.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 5d9520d6fd6d91e8f5e35de1857db72eb6a950fd8496ea43481a006fc8832028 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:10:14,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:10:14,220 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:10:14,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:10:14,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:10:14,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:10:14,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:10:14,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:10:14,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:10:14,255 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:10:14,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:10:14,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:10:14,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:10:14,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:10:14,256 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:10:14,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:10:14,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:10:14,256 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:10:14,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:10:14,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:10:14,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:10:14,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:10:14,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:10:14,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:10:14,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:10:14,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:10:14,259 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:10:14,259 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:10:14,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:10:14,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:10:14,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:10:14,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:10:14,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:10:14,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:10:14,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:10:14,260 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:10:14,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:10:14,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:10:14,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:10:14,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:10:14,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:10:14,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:10:14,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:10:14,260 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 -> 5d9520d6fd6d91e8f5e35de1857db72eb6a950fd8496ea43481a006fc8832028 [2025-02-05 21:10:14,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:10:14,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:10:14,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:10:14,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:10:14,572 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:10:14,574 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-100_file-3.i [2025-02-05 21:10:15,969 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a6fc4bfa/4981e57c00b4466380bfa0428a8fb6c0/FLAG725b4c660 [2025-02-05 21:10:16,323 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:10:16,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-3.i [2025-02-05 21:10:16,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a6fc4bfa/4981e57c00b4466380bfa0428a8fb6c0/FLAG725b4c660 [2025-02-05 21:10:16,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a6fc4bfa/4981e57c00b4466380bfa0428a8fb6c0 [2025-02-05 21:10:16,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:10:16,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:10:16,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:10:16,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:10:16,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:10:16,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:10:16" (1/1) ... [2025-02-05 21:10:16,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b5fcf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16, skipping insertion in model container [2025-02-05 21:10:16,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:10:16" (1/1) ... [2025-02-05 21:10:16,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:10:16,557 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-100_file-3.i[915,928] [2025-02-05 21:10:16,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:10:16,688 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:10:16,696 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-100_file-3.i[915,928] [2025-02-05 21:10:16,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:10:16,746 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:10:16,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16 WrapperNode [2025-02-05 21:10:16,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:10:16,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:10:16,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:10:16,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:10:16,756 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:10:16" (1/1) ... [2025-02-05 21:10:16,775 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:10:16" (1/1) ... [2025-02-05 21:10:16,842 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 348 [2025-02-05 21:10:16,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:10:16,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:10:16,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:10:16,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:10:16,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16" (1/1) ... [2025-02-05 21:10:16,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16" (1/1) ... [2025-02-05 21:10:16,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16" (1/1) ... [2025-02-05 21:10:16,896 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:10:16,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16" (1/1) ... [2025-02-05 21:10:16,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16" (1/1) ... [2025-02-05 21:10:16,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16" (1/1) ... [2025-02-05 21:10:16,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16" (1/1) ... [2025-02-05 21:10:16,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16" (1/1) ... [2025-02-05 21:10:16,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16" (1/1) ... [2025-02-05 21:10:16,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:10:16,938 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:10:16,938 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:10:16,938 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:10:16,939 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16" (1/1) ... [2025-02-05 21:10:16,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:10:16,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:10:16,976 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:10:16,981 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:10:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:10:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:10:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:10:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:10:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:10:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:10:17,104 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:10:17,106 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:10:17,720 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc property_#t~bitwise36#1;havoc property_#t~short37#1; [2025-02-05 21:10:17,782 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 21:10:17,782 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:10:17,809 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:10:17,809 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:10:17,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:10:17 BoogieIcfgContainer [2025-02-05 21:10:17,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:10:17,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:10:17,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:10:17,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:10:17,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:10:16" (1/3) ... [2025-02-05 21:10:17,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29754882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:10:17, skipping insertion in model container [2025-02-05 21:10:17,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:16" (2/3) ... [2025-02-05 21:10:17,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29754882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:10:17, skipping insertion in model container [2025-02-05 21:10:17,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:10:17" (3/3) ... [2025-02-05 21:10:17,823 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-3.i [2025-02-05 21:10:17,836 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:10:17,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-3.i that has 2 procedures, 154 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:10:17,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:10:17,913 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;@47ed6aa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:10:17,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:10:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 98 states have internal predecessors, (144), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 21:10:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-05 21:10:17,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:17,941 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:17,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:17,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2077673467, now seen corresponding path program 1 times [2025-02-05 21:10:17,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:17,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313893516] [2025-02-05 21:10:17,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:18,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-05 21:10:18,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-05 21:10:18,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:18,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2025-02-05 21:10:18,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313893516] [2025-02-05 21:10:18,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313893516] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:10:18,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762060434] [2025-02-05 21:10:18,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:18,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:10:18,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:10:18,456 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:10:18,457 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:10:18,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-05 21:10:18,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-05 21:10:18,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:18,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:18,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:10:18,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:10:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2025-02-05 21:10:18,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:10:18,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762060434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:18,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:10:18,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:10:18,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141485574] [2025-02-05 21:10:18,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:18,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:10:18,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:18,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:10:18,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:10:18,813 INFO L87 Difference]: Start difference. First operand has 154 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 98 states have internal predecessors, (144), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 21:10:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:18,877 INFO L93 Difference]: Finished difference Result 302 states and 553 transitions. [2025-02-05 21:10:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:10:18,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) Word has length 335 [2025-02-05 21:10:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:18,889 INFO L225 Difference]: With dead ends: 302 [2025-02-05 21:10:18,890 INFO L226 Difference]: Without dead ends: 151 [2025-02-05 21:10:18,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 336 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:10:18,897 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:18,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:10:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-05 21:10:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-02-05 21:10:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 95 states have internal predecessors, (137), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 21:10:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 245 transitions. [2025-02-05 21:10:18,961 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 245 transitions. Word has length 335 [2025-02-05 21:10:18,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:18,964 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 245 transitions. [2025-02-05 21:10:18,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 21:10:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2025-02-05 21:10:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-05 21:10:18,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:18,975 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:18,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:10:19,176 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:10:19,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:19,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1359045339, now seen corresponding path program 1 times [2025-02-05 21:10:19,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:19,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833704440] [2025-02-05 21:10:19,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:19,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-05 21:10:19,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-05 21:10:19,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:19,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-05 21:10:19,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:19,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833704440] [2025-02-05 21:10:19,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833704440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:19,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:10:19,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:10:19,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323472615] [2025-02-05 21:10:19,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:19,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:10:19,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:19,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:10:19,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:10:19,934 INFO L87 Difference]: Start difference. First operand 151 states and 245 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:20,042 INFO L93 Difference]: Finished difference Result 447 states and 729 transitions. [2025-02-05 21:10:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:10:20,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 335 [2025-02-05 21:10:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:20,047 INFO L225 Difference]: With dead ends: 447 [2025-02-05 21:10:20,048 INFO L226 Difference]: Without dead ends: 299 [2025-02-05 21:10:20,052 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:10:20,052 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 130 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:20,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 477 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:10:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-05 21:10:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2025-02-05 21:10:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 186 states have (on average 1.4301075268817205) internal successors, (266), 186 states have internal predecessors, (266), 108 states have call successors, (108), 2 states have call predecessors, (108), 2 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 21:10:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 482 transitions. [2025-02-05 21:10:20,133 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 482 transitions. Word has length 335 [2025-02-05 21:10:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:20,135 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 482 transitions. [2025-02-05 21:10:20,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 482 transitions. [2025-02-05 21:10:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-02-05 21:10:20,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:20,142 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:20,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:10:20,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:20,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:20,144 INFO L85 PathProgramCache]: Analyzing trace with hash -332302032, now seen corresponding path program 1 times [2025-02-05 21:10:20,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:20,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047571244] [2025-02-05 21:10:20,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:20,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:20,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 21:10:20,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 21:10:20,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:20,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-05 21:10:20,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:20,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047571244] [2025-02-05 21:10:20,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047571244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:20,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:10:20,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:10:20,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498417113] [2025-02-05 21:10:20,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:20,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:10:20,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:20,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:10:20,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:10:20,361 INFO L87 Difference]: Start difference. First operand 297 states and 482 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:20,446 INFO L93 Difference]: Finished difference Result 655 states and 1056 transitions. [2025-02-05 21:10:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:10:20,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 336 [2025-02-05 21:10:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:20,453 INFO L225 Difference]: With dead ends: 655 [2025-02-05 21:10:20,453 INFO L226 Difference]: Without dead ends: 361 [2025-02-05 21:10:20,454 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:10:20,455 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 43 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:20,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 494 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:10:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-05 21:10:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 315. [2025-02-05 21:10:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 204 states have (on average 1.4313725490196079) internal successors, (292), 204 states have internal predecessors, (292), 108 states have call successors, (108), 2 states have call predecessors, (108), 2 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 21:10:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 508 transitions. [2025-02-05 21:10:20,523 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 508 transitions. Word has length 336 [2025-02-05 21:10:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:20,525 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 508 transitions. [2025-02-05 21:10:20,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 508 transitions. [2025-02-05 21:10:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-02-05 21:10:20,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:20,530 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:20,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:10:20,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:20,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:20,531 INFO L85 PathProgramCache]: Analyzing trace with hash -478066639, now seen corresponding path program 1 times [2025-02-05 21:10:20,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:20,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829927510] [2025-02-05 21:10:20,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:20,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:20,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 21:10:20,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 21:10:20,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:20,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-05 21:10:20,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:20,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829927510] [2025-02-05 21:10:20,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829927510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:20,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:10:20,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:10:20,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263536065] [2025-02-05 21:10:20,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:20,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:10:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:20,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:10:20,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:10:20,799 INFO L87 Difference]: Start difference. First operand 315 states and 508 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:20,926 INFO L93 Difference]: Finished difference Result 931 states and 1508 transitions. [2025-02-05 21:10:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:10:20,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 336 [2025-02-05 21:10:20,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:20,935 INFO L225 Difference]: With dead ends: 931 [2025-02-05 21:10:20,935 INFO L226 Difference]: Without dead ends: 619 [2025-02-05 21:10:20,938 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:10:20,939 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 229 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:20,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 675 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:10:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-02-05 21:10:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2025-02-05 21:10:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 396 states have (on average 1.4242424242424243) internal successors, (564), 396 states have internal predecessors, (564), 216 states have call successors, (216), 4 states have call predecessors, (216), 4 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-02-05 21:10:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 996 transitions. [2025-02-05 21:10:21,039 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 996 transitions. Word has length 336 [2025-02-05 21:10:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:21,042 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 996 transitions. [2025-02-05 21:10:21,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 996 transitions. [2025-02-05 21:10:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-02-05 21:10:21,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:21,048 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:21,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:10:21,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:21,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:21,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2003856417, now seen corresponding path program 1 times [2025-02-05 21:10:21,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:21,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582941268] [2025-02-05 21:10:21,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:21,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:21,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-05 21:10:21,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-05 21:10:21,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:21,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-05 21:10:21,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:21,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582941268] [2025-02-05 21:10:21,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582941268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:21,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:10:21,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:10:21,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980228101] [2025-02-05 21:10:21,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:21,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:10:21,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:21,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:10:21,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:10:21,747 INFO L87 Difference]: Start difference. First operand 617 states and 996 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 21:10:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:22,912 INFO L93 Difference]: Finished difference Result 1855 states and 2999 transitions. [2025-02-05 21:10:22,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:10:22,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 337 [2025-02-05 21:10:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:22,929 INFO L225 Difference]: With dead ends: 1855 [2025-02-05 21:10:22,930 INFO L226 Difference]: Without dead ends: 1547 [2025-02-05 21:10:22,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:10:22,933 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 542 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:22,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1018 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:10:22,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-02-05 21:10:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1535. [2025-02-05 21:10:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 984 states have (on average 1.4308943089430894) internal successors, (1408), 984 states have internal predecessors, (1408), 540 states have call successors, (540), 10 states have call predecessors, (540), 10 states have return successors, (540), 540 states have call predecessors, (540), 540 states have call successors, (540) [2025-02-05 21:10:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2488 transitions. [2025-02-05 21:10:23,262 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2488 transitions. Word has length 337 [2025-02-05 21:10:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:23,265 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2488 transitions. [2025-02-05 21:10:23,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 21:10:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2488 transitions. [2025-02-05 21:10:23,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-02-05 21:10:23,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:23,272 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:23,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:10:23,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:23,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:23,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1543375935, now seen corresponding path program 1 times [2025-02-05 21:10:23,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:23,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724210849] [2025-02-05 21:10:23,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:23,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:23,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-05 21:10:23,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-05 21:10:23,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:23,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-05 21:10:23,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:23,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724210849] [2025-02-05 21:10:23,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724210849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:23,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:10:23,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:10:23,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394013594] [2025-02-05 21:10:23,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:23,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:10:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:23,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:10:23,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:10:23,783 INFO L87 Difference]: Start difference. First operand 1535 states and 2488 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:24,868 INFO L93 Difference]: Finished difference Result 7005 states and 11133 transitions. [2025-02-05 21:10:24,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:10:24,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 337 [2025-02-05 21:10:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:24,910 INFO L225 Difference]: With dead ends: 7005 [2025-02-05 21:10:24,910 INFO L226 Difference]: Without dead ends: 5473 [2025-02-05 21:10:24,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:10:24,954 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 722 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:24,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1150 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:10:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2025-02-05 21:10:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 4415. [2025-02-05 21:10:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4415 states, 3074 states have (on average 1.4476252439817827) internal successors, (4450), 3104 states have internal predecessors, (4450), 1290 states have call successors, (1290), 50 states have call predecessors, (1290), 50 states have return successors, (1290), 1260 states have call predecessors, (1290), 1290 states have call successors, (1290) [2025-02-05 21:10:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4415 states to 4415 states and 7030 transitions. [2025-02-05 21:10:25,455 INFO L78 Accepts]: Start accepts. Automaton has 4415 states and 7030 transitions. Word has length 337 [2025-02-05 21:10:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:25,456 INFO L471 AbstractCegarLoop]: Abstraction has 4415 states and 7030 transitions. [2025-02-05 21:10:25,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 4415 states and 7030 transitions. [2025-02-05 21:10:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-02-05 21:10:25,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:25,463 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:25,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:10:25,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:25,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1506826880, now seen corresponding path program 1 times [2025-02-05 21:10:25,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:25,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840710813] [2025-02-05 21:10:25,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:25,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:25,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-05 21:10:25,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-05 21:10:25,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:25,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 90 proven. 69 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-05 21:10:25,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840710813] [2025-02-05 21:10:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840710813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:10:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000021197] [2025-02-05 21:10:25,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:25,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:10:25,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:10:25,894 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:10:25,897 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:10:25,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-05 21:10:26,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-05 21:10:26,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:26,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:26,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 21:10:26,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:10:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-05 21:10:26,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:10:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000021197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:26,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:10:26,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-02-05 21:10:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017266635] [2025-02-05 21:10:26,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:26,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:10:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:26,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:10:26,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:10:26,190 INFO L87 Difference]: Start difference. First operand 4415 states and 7030 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:26,527 INFO L93 Difference]: Finished difference Result 8907 states and 14197 transitions. [2025-02-05 21:10:26,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:10:26,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 337 [2025-02-05 21:10:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:26,569 INFO L225 Difference]: With dead ends: 8907 [2025-02-05 21:10:26,570 INFO L226 Difference]: Without dead ends: 4495 [2025-02-05 21:10:26,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:10:26,590 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 2 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:26,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 474 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:10:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2025-02-05 21:10:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 4455. [2025-02-05 21:10:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4455 states, 3114 states have (on average 1.4482980089916506) internal successors, (4510), 3144 states have internal predecessors, (4510), 1290 states have call successors, (1290), 50 states have call predecessors, (1290), 50 states have return successors, (1290), 1260 states have call predecessors, (1290), 1290 states have call successors, (1290) [2025-02-05 21:10:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 7090 transitions. [2025-02-05 21:10:27,019 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 7090 transitions. Word has length 337 [2025-02-05 21:10:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:27,021 INFO L471 AbstractCegarLoop]: Abstraction has 4455 states and 7090 transitions. [2025-02-05 21:10:27,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 7090 transitions. [2025-02-05 21:10:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-02-05 21:10:27,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:27,027 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:27,037 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:10:27,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:10:27,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:27,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash 465440888, now seen corresponding path program 1 times [2025-02-05 21:10:27,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:27,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002621178] [2025-02-05 21:10:27,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:27,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:27,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-05 21:10:27,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-05 21:10:27,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:27,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 90 proven. 69 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-05 21:10:27,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:27,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002621178] [2025-02-05 21:10:27,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002621178] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:10:27,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861705695] [2025-02-05 21:10:27,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:27,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:10:27,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:10:27,613 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:10:27,616 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:10:27,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-05 21:10:27,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-05 21:10:27,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:27,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:27,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 21:10:27,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:10:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 3008 proven. 66 refuted. 0 times theorem prover too weak. 2650 trivial. 0 not checked. [2025-02-05 21:10:28,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:10:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 246 proven. 69 refuted. 0 times theorem prover too weak. 5409 trivial. 0 not checked. [2025-02-05 21:10:28,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861705695] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:10:28,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:10:28,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-02-05 21:10:28,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830168706] [2025-02-05 21:10:28,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:10:28,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:10:28,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:28,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:10:28,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:10:28,841 INFO L87 Difference]: Start difference. First operand 4455 states and 7090 transitions. Second operand has 15 states, 15 states have (on average 9.466666666666667) internal successors, (142), 15 states have internal predecessors, (142), 6 states have call successors, (98), 3 states have call predecessors, (98), 7 states have return successors, (100), 6 states have call predecessors, (100), 6 states have call successors, (100) [2025-02-05 21:10:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:29,895 INFO L93 Difference]: Finished difference Result 8157 states and 12833 transitions. [2025-02-05 21:10:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 21:10:29,896 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.466666666666667) internal successors, (142), 15 states have internal predecessors, (142), 6 states have call successors, (98), 3 states have call predecessors, (98), 7 states have return successors, (100), 6 states have call predecessors, (100), 6 states have call successors, (100) Word has length 338 [2025-02-05 21:10:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:29,928 INFO L225 Difference]: With dead ends: 8157 [2025-02-05 21:10:29,929 INFO L226 Difference]: Without dead ends: 3685 [2025-02-05 21:10:29,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=505, Unknown=0, NotChecked=0, Total=756 [2025-02-05 21:10:29,949 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 329 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:29,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 628 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:10:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2025-02-05 21:10:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3585. [2025-02-05 21:10:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 2524 states have (on average 1.4128367670364501) internal successors, (3566), 2544 states have internal predecessors, (3566), 990 states have call successors, (990), 70 states have call predecessors, (990), 70 states have return successors, (990), 970 states have call predecessors, (990), 990 states have call successors, (990) [2025-02-05 21:10:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 5546 transitions. [2025-02-05 21:10:30,288 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 5546 transitions. Word has length 338 [2025-02-05 21:10:30,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:30,289 INFO L471 AbstractCegarLoop]: Abstraction has 3585 states and 5546 transitions. [2025-02-05 21:10:30,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.466666666666667) internal successors, (142), 15 states have internal predecessors, (142), 6 states have call successors, (98), 3 states have call predecessors, (98), 7 states have return successors, (100), 6 states have call predecessors, (100), 6 states have call successors, (100) [2025-02-05 21:10:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 5546 transitions. [2025-02-05 21:10:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-02-05 21:10:30,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:30,295 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:30,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 21:10:30,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:10:30,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:30,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1649785273, now seen corresponding path program 1 times [2025-02-05 21:10:30,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:30,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042167508] [2025-02-05 21:10:30,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:30,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:30,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-05 21:10:30,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-05 21:10:30,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:30,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 114 proven. 45 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-05 21:10:31,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:31,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042167508] [2025-02-05 21:10:31,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042167508] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:10:31,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331711052] [2025-02-05 21:10:31,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:31,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:10:31,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:10:31,053 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:10:31,055 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:10:31,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-05 21:10:31,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-05 21:10:31,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:31,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:31,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 21:10:31,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:10:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2409 proven. 45 refuted. 0 times theorem prover too weak. 3270 trivial. 0 not checked. [2025-02-05 21:10:31,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:10:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 114 proven. 45 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-05 21:10:32,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331711052] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:10:32,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:10:32,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-05 21:10:32,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728744430] [2025-02-05 21:10:32,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:10:32,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 21:10:32,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:32,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 21:10:32,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-02-05 21:10:32,142 INFO L87 Difference]: Start difference. First operand 3585 states and 5546 transitions. Second operand has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 3 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) [2025-02-05 21:10:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:36,516 INFO L93 Difference]: Finished difference Result 20171 states and 30674 transitions. [2025-02-05 21:10:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-05 21:10:36,517 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 3 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) Word has length 338 [2025-02-05 21:10:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:36,613 INFO L225 Difference]: With dead ends: 20171 [2025-02-05 21:10:36,613 INFO L226 Difference]: Without dead ends: 16589 [2025-02-05 21:10:36,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1130, Invalid=2776, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 21:10:36,640 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 1511 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 2015 SdHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:36,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 2015 Invalid, 2629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 21:10:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16589 states. [2025-02-05 21:10:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16589 to 7115. [2025-02-05 21:10:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7115 states, 5324 states have (on average 1.4316303531179564) internal successors, (7622), 5384 states have internal predecessors, (7622), 1650 states have call successors, (1650), 140 states have call predecessors, (1650), 140 states have return successors, (1650), 1590 states have call predecessors, (1650), 1650 states have call successors, (1650) [2025-02-05 21:10:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7115 states to 7115 states and 10922 transitions. [2025-02-05 21:10:37,556 INFO L78 Accepts]: Start accepts. Automaton has 7115 states and 10922 transitions. Word has length 338 [2025-02-05 21:10:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:37,557 INFO L471 AbstractCegarLoop]: Abstraction has 7115 states and 10922 transitions. [2025-02-05 21:10:37,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 3 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) [2025-02-05 21:10:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7115 states and 10922 transitions. [2025-02-05 21:10:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-02-05 21:10:37,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:37,566 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:37,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 21:10:37,771 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,SelfDestructingSolverStorable8 [2025-02-05 21:10:37,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:37,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1482970342, now seen corresponding path program 1 times [2025-02-05 21:10:37,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:37,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879981709] [2025-02-05 21:10:37,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:37,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:37,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-05 21:10:37,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-05 21:10:37,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:37,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 75 proven. 237 refuted. 0 times theorem prover too weak. 5412 trivial. 0 not checked. [2025-02-05 21:10:39,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:39,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879981709] [2025-02-05 21:10:39,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879981709] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:10:39,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650042906] [2025-02-05 21:10:39,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:39,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:10:39,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:10:39,704 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:10:39,706 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:10:39,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-05 21:10:39,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-05 21:10:39,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:39,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:39,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 21:10:39,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:10:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2409 proven. 45 refuted. 0 times theorem prover too weak. 3270 trivial. 0 not checked. [2025-02-05 21:10:40,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:10:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 114 proven. 45 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-05 21:10:41,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650042906] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:10:41,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:10:41,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 17 [2025-02-05 21:10:41,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114898540] [2025-02-05 21:10:41,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:10:41,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 21:10:41,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:41,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 21:10:41,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:10:41,015 INFO L87 Difference]: Start difference. First operand 7115 states and 10922 transitions. Second operand has 17 states, 17 states have (on average 8.823529411764707) internal successors, (150), 17 states have internal predecessors, (150), 5 states have call successors, (110), 2 states have call predecessors, (110), 4 states have return successors, (112), 5 states have call predecessors, (112), 5 states have call successors, (112) [2025-02-05 21:10:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:50,599 INFO L93 Difference]: Finished difference Result 35063 states and 50917 transitions. [2025-02-05 21:10:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2025-02-05 21:10:50,600 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.823529411764707) internal successors, (150), 17 states have internal predecessors, (150), 5 states have call successors, (110), 2 states have call predecessors, (110), 4 states have return successors, (112), 5 states have call predecessors, (112), 5 states have call successors, (112) Word has length 338 [2025-02-05 21:10:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:50,803 INFO L225 Difference]: With dead ends: 35063 [2025-02-05 21:10:50,803 INFO L226 Difference]: Without dead ends: 27951 [2025-02-05 21:10:50,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9278 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4889, Invalid=17761, Unknown=0, NotChecked=0, Total=22650 [2025-02-05 21:10:50,843 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1966 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 3002 mSolverCounterSat, 702 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1970 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 3704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 702 IncrementalHoareTripleChecker+Valid, 3002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:50,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1970 Valid, 2680 Invalid, 3704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [702 Valid, 3002 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 21:10:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27951 states. [2025-02-05 21:10:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27951 to 8205. [2025-02-05 21:10:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8205 states, 6494 states have (on average 1.4493378503233754) internal successors, (9412), 6554 states have internal predecessors, (9412), 1470 states have call successors, (1470), 240 states have call predecessors, (1470), 240 states have return successors, (1470), 1410 states have call predecessors, (1470), 1470 states have call successors, (1470) [2025-02-05 21:10:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8205 states to 8205 states and 12352 transitions. [2025-02-05 21:10:52,139 INFO L78 Accepts]: Start accepts. Automaton has 8205 states and 12352 transitions. Word has length 338 [2025-02-05 21:10:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:52,140 INFO L471 AbstractCegarLoop]: Abstraction has 8205 states and 12352 transitions. [2025-02-05 21:10:52,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.823529411764707) internal successors, (150), 17 states have internal predecessors, (150), 5 states have call successors, (110), 2 states have call predecessors, (110), 4 states have return successors, (112), 5 states have call predecessors, (112), 5 states have call successors, (112) [2025-02-05 21:10:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 8205 states and 12352 transitions. [2025-02-05 21:10:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-02-05 21:10:52,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:52,149 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:52,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 21:10:52,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 21:10:52,350 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:52,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:52,351 INFO L85 PathProgramCache]: Analyzing trace with hash 433608571, now seen corresponding path program 1 times [2025-02-05 21:10:52,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:52,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792301768] [2025-02-05 21:10:52,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:52,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:52,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-05 21:10:52,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-05 21:10:52,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:52,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-05 21:10:52,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:52,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792301768] [2025-02-05 21:10:52,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792301768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:52,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:10:52,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:10:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205132740] [2025-02-05 21:10:52,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:52,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:10:52,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:52,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:10:52,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:10:52,569 INFO L87 Difference]: Start difference. First operand 8205 states and 12352 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:53,729 INFO L93 Difference]: Finished difference Result 19529 states and 29402 transitions. [2025-02-05 21:10:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:10:53,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 338 [2025-02-05 21:10:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:53,776 INFO L225 Difference]: With dead ends: 19529 [2025-02-05 21:10:53,776 INFO L226 Difference]: Without dead ends: 11327 [2025-02-05 21:10:53,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:10:53,800 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 128 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:53,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 483 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:10:53,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11327 states. [2025-02-05 21:10:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11327 to 11325. [2025-02-05 21:10:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11325 states, 8930 states have (on average 1.4423292273236281) internal successors, (12880), 9014 states have internal predecessors, (12880), 2058 states have call successors, (2058), 336 states have call predecessors, (2058), 336 states have return successors, (2058), 1974 states have call predecessors, (2058), 2058 states have call successors, (2058) [2025-02-05 21:10:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11325 states to 11325 states and 16996 transitions. [2025-02-05 21:10:55,302 INFO L78 Accepts]: Start accepts. Automaton has 11325 states and 16996 transitions. Word has length 338 [2025-02-05 21:10:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:55,303 INFO L471 AbstractCegarLoop]: Abstraction has 11325 states and 16996 transitions. [2025-02-05 21:10:55,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 11325 states and 16996 transitions. [2025-02-05 21:10:55,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 21:10:55,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:55,309 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:55,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:10:55,309 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:55,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:55,309 INFO L85 PathProgramCache]: Analyzing trace with hash -402691016, now seen corresponding path program 1 times [2025-02-05 21:10:55,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:55,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871435301] [2025-02-05 21:10:55,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:55,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:55,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 21:10:55,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 21:10:55,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:55,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-05 21:10:55,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:55,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871435301] [2025-02-05 21:10:55,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871435301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:55,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:10:55,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:10:55,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230521130] [2025-02-05 21:10:55,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:55,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:10:55,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:55,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:10:55,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:10:55,556 INFO L87 Difference]: Start difference. First operand 11325 states and 16996 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:56,966 INFO L93 Difference]: Finished difference Result 15521 states and 23342 transitions. [2025-02-05 21:10:56,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:10:56,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 339 [2025-02-05 21:10:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:57,026 INFO L225 Difference]: With dead ends: 15521 [2025-02-05 21:10:57,027 INFO L226 Difference]: Without dead ends: 11407 [2025-02-05 21:10:57,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:10:57,045 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 137 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:57,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1034 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:10:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11407 states. [2025-02-05 21:10:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11407 to 9779. [2025-02-05 21:10:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9779 states, 7726 states have (on average 1.44084908102511) internal successors, (11132), 7798 states have internal predecessors, (11132), 1764 states have call successors, (1764), 288 states have call predecessors, (1764), 288 states have return successors, (1764), 1692 states have call predecessors, (1764), 1764 states have call successors, (1764) [2025-02-05 21:10:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9779 states to 9779 states and 14660 transitions. [2025-02-05 21:10:58,173 INFO L78 Accepts]: Start accepts. Automaton has 9779 states and 14660 transitions. Word has length 339 [2025-02-05 21:10:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:58,173 INFO L471 AbstractCegarLoop]: Abstraction has 9779 states and 14660 transitions. [2025-02-05 21:10:58,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:10:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 9779 states and 14660 transitions. [2025-02-05 21:10:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 21:10:58,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:58,180 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:58,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:10:58,180 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:58,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1581858513, now seen corresponding path program 1 times [2025-02-05 21:10:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:58,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66274585] [2025-02-05 21:10:58,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:58,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:58,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 21:10:58,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 21:10:58,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:58,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-05 21:10:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:58,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66274585] [2025-02-05 21:10:58,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66274585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:58,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:10:58,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:10:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643735523] [2025-02-05 21:10:58,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:58,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:10:58,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:58,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:10:58,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:10:58,506 INFO L87 Difference]: Start difference. First operand 9779 states and 14660 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 21:11:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:11:00,511 INFO L93 Difference]: Finished difference Result 18578 states and 27887 transitions. [2025-02-05 21:11:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:11:00,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 339 [2025-02-05 21:11:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:11:00,580 INFO L225 Difference]: With dead ends: 18578 [2025-02-05 21:11:00,580 INFO L226 Difference]: Without dead ends: 16129 [2025-02-05 21:11:00,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:11:00,599 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 523 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:11:00,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 836 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:11:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16129 states. [2025-02-05 21:11:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16129 to 14593. [2025-02-05 21:11:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14593 states, 11514 states have (on average 1.4414625673093626) internal successors, (16597), 11622 states have internal predecessors, (16597), 2646 states have call successors, (2646), 432 states have call predecessors, (2646), 432 states have return successors, (2646), 2538 states have call predecessors, (2646), 2646 states have call successors, (2646) [2025-02-05 21:11:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14593 states to 14593 states and 21889 transitions. [2025-02-05 21:11:02,728 INFO L78 Accepts]: Start accepts. Automaton has 14593 states and 21889 transitions. Word has length 339 [2025-02-05 21:11:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:11:02,729 INFO L471 AbstractCegarLoop]: Abstraction has 14593 states and 21889 transitions. [2025-02-05 21:11:02,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 21:11:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 14593 states and 21889 transitions. [2025-02-05 21:11:02,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 21:11:02,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:11:02,734 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:02,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:11:02,735 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:11:02,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:11:02,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1852411786, now seen corresponding path program 1 times [2025-02-05 21:11:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:11:02,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343877215] [2025-02-05 21:11:02,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:11:02,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:11:02,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 21:11:02,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 21:11:02,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:11:02,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:11:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-05 21:11:03,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:11:03,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343877215] [2025-02-05 21:11:03,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343877215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:11:03,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:11:03,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:11:03,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107342636] [2025-02-05 21:11:03,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:11:03,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:11:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:11:03,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:11:03,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:11:03,010 INFO L87 Difference]: Start difference. First operand 14593 states and 21889 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:11:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:11:04,839 INFO L93 Difference]: Finished difference Result 23740 states and 35646 transitions. [2025-02-05 21:11:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:11:04,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 339 [2025-02-05 21:11:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:11:04,898 INFO L225 Difference]: With dead ends: 23740 [2025-02-05 21:11:04,898 INFO L226 Difference]: Without dead ends: 16399 [2025-02-05 21:11:04,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:11:04,919 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 334 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:11:04,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 918 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:11:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16399 states. [2025-02-05 21:11:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16399 to 15185. [2025-02-05 21:11:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15185 states, 12106 states have (on average 1.4456467867173302) internal successors, (17501), 12214 states have internal predecessors, (17501), 2646 states have call successors, (2646), 432 states have call predecessors, (2646), 432 states have return successors, (2646), 2538 states have call predecessors, (2646), 2646 states have call successors, (2646) [2025-02-05 21:11:06,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15185 states to 15185 states and 22793 transitions. [2025-02-05 21:11:06,448 INFO L78 Accepts]: Start accepts. Automaton has 15185 states and 22793 transitions. Word has length 339 [2025-02-05 21:11:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:11:06,448 INFO L471 AbstractCegarLoop]: Abstraction has 15185 states and 22793 transitions. [2025-02-05 21:11:06,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-05 21:11:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 15185 states and 22793 transitions. [2025-02-05 21:11:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 21:11:06,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:11:06,452 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:06,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:11:06,452 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:11:06,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:11:06,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1354454041, now seen corresponding path program 1 times [2025-02-05 21:11:06,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:11:06,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091868344] [2025-02-05 21:11:06,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:11:06,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:11:06,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 21:11:06,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 21:11:06,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:11:06,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:11:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 57 proven. 255 refuted. 0 times theorem prover too weak. 5412 trivial. 0 not checked. [2025-02-05 21:11:07,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:11:07,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091868344] [2025-02-05 21:11:07,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091868344] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:11:07,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492922628] [2025-02-05 21:11:07,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:11:07,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:11:07,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:11:07,850 INFO L229 MonitoredProcess]: Starting monitored process 7 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:11:07,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 21:11:07,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 21:11:08,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 21:11:08,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:11:08,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:11:08,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 21:11:08,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:11:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2182 proven. 489 refuted. 0 times theorem prover too weak. 3053 trivial. 0 not checked. [2025-02-05 21:11:10,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:11:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 111 proven. 507 refuted. 0 times theorem prover too weak. 5106 trivial. 0 not checked. [2025-02-05 21:11:11,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492922628] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:11:11,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:11:11,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35 [2025-02-05 21:11:11,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563646584] [2025-02-05 21:11:11,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:11:11,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 21:11:11,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:11:11,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 21:11:11,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=873, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 21:11:11,941 INFO L87 Difference]: Start difference. First operand 15185 states and 22793 transitions. Second operand has 35 states, 34 states have (on average 6.264705882352941) internal successors, (213), 33 states have internal predecessors, (213), 13 states have call successors, (149), 6 states have call predecessors, (149), 13 states have return successors, (150), 12 states have call predecessors, (150), 13 states have call successors, (150) [2025-02-05 21:11:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:11:14,899 INFO L93 Difference]: Finished difference Result 26761 states and 39117 transitions. [2025-02-05 21:11:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 21:11:14,900 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 6.264705882352941) internal successors, (213), 33 states have internal predecessors, (213), 13 states have call successors, (149), 6 states have call predecessors, (149), 13 states have return successors, (150), 12 states have call predecessors, (150), 13 states have call successors, (150) Word has length 339 [2025-02-05 21:11:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:11:14,942 INFO L225 Difference]: With dead ends: 26761 [2025-02-05 21:11:14,942 INFO L226 Difference]: Without dead ends: 15245 [2025-02-05 21:11:14,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 657 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1114, Invalid=2546, Unknown=0, NotChecked=0, Total=3660 [2025-02-05 21:11:14,966 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 628 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:11:14,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 744 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:11:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15245 states. [2025-02-05 21:11:16,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15245 to 12311. [2025-02-05 21:11:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12311 states, 9706 states have (on average 1.4011951370286422) internal successors, (13600), 9790 states have internal predecessors, (13600), 2058 states have call successors, (2058), 546 states have call predecessors, (2058), 546 states have return successors, (2058), 1974 states have call predecessors, (2058), 2058 states have call successors, (2058) [2025-02-05 21:11:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12311 states to 12311 states and 17716 transitions. [2025-02-05 21:11:16,800 INFO L78 Accepts]: Start accepts. Automaton has 12311 states and 17716 transitions. Word has length 339 [2025-02-05 21:11:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:11:16,800 INFO L471 AbstractCegarLoop]: Abstraction has 12311 states and 17716 transitions. [2025-02-05 21:11:16,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 6.264705882352941) internal successors, (213), 33 states have internal predecessors, (213), 13 states have call successors, (149), 6 states have call predecessors, (149), 13 states have return successors, (150), 12 states have call predecessors, (150), 13 states have call successors, (150) [2025-02-05 21:11:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 12311 states and 17716 transitions. [2025-02-05 21:11:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 21:11:16,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:11:16,804 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:16,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 21:11:17,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 21:11:17,004 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:11:17,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:11:17,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1094491091, now seen corresponding path program 1 times [2025-02-05 21:11:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:11:17,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870540383] [2025-02-05 21:11:17,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:11:17,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:11:17,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 21:11:17,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 21:11:17,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:11:17,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:11:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-05 21:11:17,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:11:17,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870540383] [2025-02-05 21:11:17,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870540383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:11:17,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:11:17,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:11:17,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089045000] [2025-02-05 21:11:17,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:11:17,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:11:17,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:11:17,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:11:17,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:11:17,396 INFO L87 Difference]: Start difference. First operand 12311 states and 17716 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 21:11:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:11:19,737 INFO L93 Difference]: Finished difference Result 24713 states and 35540 transitions. [2025-02-05 21:11:19,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:11:19,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 339 [2025-02-05 21:11:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:11:19,802 INFO L225 Difference]: With dead ends: 24713 [2025-02-05 21:11:19,802 INFO L226 Difference]: Without dead ends: 12405 [2025-02-05 21:11:19,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:11:19,836 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 667 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:11:19,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 991 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:11:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12405 states. [2025-02-05 21:11:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12405 to 12335. [2025-02-05 21:11:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12335 states, 9730 states have (on average 1.3987667009249742) internal successors, (13610), 9814 states have internal predecessors, (13610), 2058 states have call successors, (2058), 546 states have call predecessors, (2058), 546 states have return successors, (2058), 1974 states have call predecessors, (2058), 2058 states have call successors, (2058) [2025-02-05 21:11:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12335 states to 12335 states and 17726 transitions. [2025-02-05 21:11:21,569 INFO L78 Accepts]: Start accepts. Automaton has 12335 states and 17726 transitions. Word has length 339 [2025-02-05 21:11:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:11:21,569 INFO L471 AbstractCegarLoop]: Abstraction has 12335 states and 17726 transitions. [2025-02-05 21:11:21,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 21:11:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 12335 states and 17726 transitions. [2025-02-05 21:11:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-05 21:11:21,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:11:21,573 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:21,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 21:11:21,573 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:11:21,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:11:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1136679715, now seen corresponding path program 1 times [2025-02-05 21:11:21,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:11:21,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893986398] [2025-02-05 21:11:21,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:11:21,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:11:21,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-05 21:11:21,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-05 21:11:21,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:11:21,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat