./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.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 f1d9b1e41dffeaea131d798bbdfd7596d256be5a23994dc1bad36ef03f5ad100 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:43:30,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:43:30,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:43:30,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:43:30,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:43:30,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:43:30,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:43:30,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:43:30,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:43:30,552 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:43:30,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:43:30,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:43:30,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:43:30,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:43:30,553 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:43:30,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:43:30,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:43:30,554 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:43:30,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:43:30,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:43:30,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:43:30,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:43:30,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:43:30,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:43:30,554 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:43:30,555 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:43:30,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:43:30,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:43:30,555 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 -> f1d9b1e41dffeaea131d798bbdfd7596d256be5a23994dc1bad36ef03f5ad100 [2025-02-06 02:43:30,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:43:30,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:43:30,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:43:30,777 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:43:30,777 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:43:30,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i [2025-02-06 02:43:32,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca9e41c15/f833700c806741eba7f383dc5b669fdd/FLAG630e09480 [2025-02-06 02:43:32,312 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:43:32,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i [2025-02-06 02:43:32,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca9e41c15/f833700c806741eba7f383dc5b669fdd/FLAG630e09480 [2025-02-06 02:43:32,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca9e41c15/f833700c806741eba7f383dc5b669fdd [2025-02-06 02:43:32,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:43:32,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:43:32,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:43:32,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:43:32,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:43:32,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:43:32" (1/1) ... [2025-02-06 02:43:32,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132fd6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:32, skipping insertion in model container [2025-02-06 02:43:32,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:43:32" (1/1) ... [2025-02-06 02:43:32,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:43:32,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i[916,929] [2025-02-06 02:43:32,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:43:32,899 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:43:32,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i[916,929] [2025-02-06 02:43:32,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:43:33,000 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:43:33,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33 WrapperNode [2025-02-06 02:43:33,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:43:33,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:43:33,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:43:33,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:43:33,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (1/1) ... [2025-02-06 02:43:33,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (1/1) ... [2025-02-06 02:43:33,095 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 633 [2025-02-06 02:43:33,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:43:33,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:43:33,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:43:33,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:43:33,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (1/1) ... [2025-02-06 02:43:33,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (1/1) ... [2025-02-06 02:43:33,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (1/1) ... [2025-02-06 02:43:33,157 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:43:33,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (1/1) ... [2025-02-06 02:43:33,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (1/1) ... [2025-02-06 02:43:33,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (1/1) ... [2025-02-06 02:43:33,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (1/1) ... [2025-02-06 02:43:33,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (1/1) ... [2025-02-06 02:43:33,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (1/1) ... [2025-02-06 02:43:33,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:43:33,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:43:33,255 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:43:33,256 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:43:33,256 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (1/1) ... [2025-02-06 02:43:33,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:43:33,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:43:33,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:43:33,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:43:33,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:43:33,306 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:43:33,307 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:43:33,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:43:33,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:43:33,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:43:33,423 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:43:33,424 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:43:34,270 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L634: havoc property_#t~ite42#1;havoc property_#t~bitwise41#1;havoc property_#t~short43#1;havoc property_#t~bitwise44#1;havoc property_#t~short45#1;havoc property_#t~bitwise46#1;havoc property_#t~short47#1; [2025-02-06 02:43:34,380 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2025-02-06 02:43:34,380 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:43:34,396 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:43:34,396 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:43:34,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:43:34 BoogieIcfgContainer [2025-02-06 02:43:34,396 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:43:34,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:43:34,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:43:34,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:43:34,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:43:32" (1/3) ... [2025-02-06 02:43:34,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba3c712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:43:34, skipping insertion in model container [2025-02-06 02:43:34,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:33" (2/3) ... [2025-02-06 02:43:34,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba3c712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:43:34, skipping insertion in model container [2025-02-06 02:43:34,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:43:34" (3/3) ... [2025-02-06 02:43:34,402 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-72.i [2025-02-06 02:43:34,412 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:43:34,414 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-72.i that has 2 procedures, 257 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:43:34,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:43:34,473 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;@40414482, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:43:34,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:43:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 192 states have internal predecessors, (299), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 02:43:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-06 02:43:34,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:34,493 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:34,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:34,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash -559834430, now seen corresponding path program 1 times [2025-02-06 02:43:34,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:34,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450511994] [2025-02-06 02:43:34,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:34,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:34,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-06 02:43:34,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-06 02:43:34,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:34,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2025-02-06 02:43:35,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:35,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450511994] [2025-02-06 02:43:35,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450511994] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:43:35,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606430732] [2025-02-06 02:43:35,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:35,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:43:35,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:43:35,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:43:35,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:43:35,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-06 02:43:35,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-06 02:43:35,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:35,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:35,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:43:35,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:43:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2025-02-06 02:43:35,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:43:35,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606430732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:35,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:43:35,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:43:35,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244568622] [2025-02-06 02:43:35,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:35,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:43:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:35,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:43:35,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:43:35,482 INFO L87 Difference]: Start difference. First operand has 257 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 192 states have internal predecessors, (299), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) [2025-02-06 02:43:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:35,546 INFO L93 Difference]: Finished difference Result 508 states and 908 transitions. [2025-02-06 02:43:35,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:43:35,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) Word has length 442 [2025-02-06 02:43:35,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:35,557 INFO L225 Difference]: With dead ends: 508 [2025-02-06 02:43:35,559 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 02:43:35,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:43:35,567 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:35,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 414 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:43:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 02:43:35,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-02-06 02:43:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 189 states have (on average 1.5555555555555556) internal successors, (294), 189 states have internal predecessors, (294), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 02:43:35,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 420 transitions. [2025-02-06 02:43:35,626 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 420 transitions. Word has length 442 [2025-02-06 02:43:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:35,627 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 420 transitions. [2025-02-06 02:43:35,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) [2025-02-06 02:43:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 420 transitions. [2025-02-06 02:43:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-06 02:43:35,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:35,638 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:35,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:43:35,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:43:35,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:35,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:35,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1122245047, now seen corresponding path program 1 times [2025-02-06 02:43:35,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:35,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569794949] [2025-02-06 02:43:35,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:35,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:35,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-06 02:43:35,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-06 02:43:35,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:35,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569794949] [2025-02-06 02:43:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569794949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:36,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:36,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:43:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002157222] [2025-02-06 02:43:36,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:36,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:43:36,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:36,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:43:36,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:36,297 INFO L87 Difference]: Start difference. First operand 254 states and 420 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:36,424 INFO L93 Difference]: Finished difference Result 677 states and 1121 transitions. [2025-02-06 02:43:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:43:36,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 442 [2025-02-06 02:43:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:36,432 INFO L225 Difference]: With dead ends: 677 [2025-02-06 02:43:36,432 INFO L226 Difference]: Without dead ends: 426 [2025-02-06 02:43:36,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:36,434 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 282 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:36,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 795 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-02-06 02:43:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 423. [2025-02-06 02:43:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 327 states have (on average 1.5749235474006116) internal successors, (515), 328 states have internal predecessors, (515), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-06 02:43:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 701 transitions. [2025-02-06 02:43:36,487 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 701 transitions. Word has length 442 [2025-02-06 02:43:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:36,489 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 701 transitions. [2025-02-06 02:43:36,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 701 transitions. [2025-02-06 02:43:36,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-06 02:43:36,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:36,494 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:36,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:43:36,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:36,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:36,495 INFO L85 PathProgramCache]: Analyzing trace with hash -913546744, now seen corresponding path program 1 times [2025-02-06 02:43:36,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:36,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451074803] [2025-02-06 02:43:36,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:36,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:36,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-06 02:43:36,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-06 02:43:36,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:36,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:36,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451074803] [2025-02-06 02:43:36,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451074803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:36,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:36,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:43:36,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177438690] [2025-02-06 02:43:36,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:36,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:43:36,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:36,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:43:36,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:36,969 INFO L87 Difference]: Start difference. First operand 423 states and 701 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:37,073 INFO L93 Difference]: Finished difference Result 1257 states and 2085 transitions. [2025-02-06 02:43:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:43:37,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 442 [2025-02-06 02:43:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:37,083 INFO L225 Difference]: With dead ends: 1257 [2025-02-06 02:43:37,084 INFO L226 Difference]: Without dead ends: 837 [2025-02-06 02:43:37,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:37,087 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 400 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:37,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 836 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-02-06 02:43:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 465. [2025-02-06 02:43:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 369 states have (on average 1.5799457994579946) internal successors, (583), 370 states have internal predecessors, (583), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-06 02:43:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 769 transitions. [2025-02-06 02:43:37,158 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 769 transitions. Word has length 442 [2025-02-06 02:43:37,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:37,159 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 769 transitions. [2025-02-06 02:43:37,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 769 transitions. [2025-02-06 02:43:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-06 02:43:37,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:37,164 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:37,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:43:37,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:37,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1010808202, now seen corresponding path program 1 times [2025-02-06 02:43:37,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:37,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930034158] [2025-02-06 02:43:37,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:37,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:37,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-06 02:43:37,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-06 02:43:37,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:37,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:37,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:37,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930034158] [2025-02-06 02:43:37,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930034158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:37,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:37,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266636503] [2025-02-06 02:43:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:37,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:37,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:37,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:37,763 INFO L87 Difference]: Start difference. First operand 465 states and 769 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:38,117 INFO L93 Difference]: Finished difference Result 1342 states and 2224 transitions. [2025-02-06 02:43:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:38,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 442 [2025-02-06 02:43:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:38,125 INFO L225 Difference]: With dead ends: 1342 [2025-02-06 02:43:38,126 INFO L226 Difference]: Without dead ends: 880 [2025-02-06 02:43:38,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:38,130 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 454 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:38,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1223 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:43:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-02-06 02:43:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 576. [2025-02-06 02:43:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 416 states have internal predecessors, (631), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-06 02:43:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 943 transitions. [2025-02-06 02:43:38,194 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 943 transitions. Word has length 442 [2025-02-06 02:43:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:38,195 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 943 transitions. [2025-02-06 02:43:38,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 943 transitions. [2025-02-06 02:43:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-06 02:43:38,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:38,199 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:38,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:43:38,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:38,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash -802445610, now seen corresponding path program 1 times [2025-02-06 02:43:38,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:38,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334002495] [2025-02-06 02:43:38,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:38,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:38,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-06 02:43:38,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-06 02:43:38,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:38,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:38,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:38,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334002495] [2025-02-06 02:43:38,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334002495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:38,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:38,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:38,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950334869] [2025-02-06 02:43:38,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:38,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:38,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:38,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:38,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:38,915 INFO L87 Difference]: Start difference. First operand 576 states and 943 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:39,195 INFO L93 Difference]: Finished difference Result 1342 states and 2223 transitions. [2025-02-06 02:43:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:39,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-02-06 02:43:39,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:39,204 INFO L225 Difference]: With dead ends: 1342 [2025-02-06 02:43:39,204 INFO L226 Difference]: Without dead ends: 880 [2025-02-06 02:43:39,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:39,209 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 306 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:39,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1214 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:43:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-02-06 02:43:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 590. [2025-02-06 02:43:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 429 states have (on average 1.5221445221445222) internal successors, (653), 430 states have internal predecessors, (653), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-06 02:43:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 965 transitions. [2025-02-06 02:43:39,266 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 965 transitions. Word has length 443 [2025-02-06 02:43:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:39,267 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 965 transitions. [2025-02-06 02:43:39,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 965 transitions. [2025-02-06 02:43:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-06 02:43:39,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:39,270 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:39,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:43:39,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:39,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:39,274 INFO L85 PathProgramCache]: Analyzing trace with hash -358834187, now seen corresponding path program 1 times [2025-02-06 02:43:39,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:39,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157184560] [2025-02-06 02:43:39,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:39,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:39,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-06 02:43:39,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-06 02:43:39,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:39,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:40,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:40,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157184560] [2025-02-06 02:43:40,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157184560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:40,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:40,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:40,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389941919] [2025-02-06 02:43:40,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:40,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:40,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:40,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:40,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:40,097 INFO L87 Difference]: Start difference. First operand 590 states and 965 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:40,466 INFO L93 Difference]: Finished difference Result 1158 states and 1890 transitions. [2025-02-06 02:43:40,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:40,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-02-06 02:43:40,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:40,470 INFO L225 Difference]: With dead ends: 1158 [2025-02-06 02:43:40,471 INFO L226 Difference]: Without dead ends: 696 [2025-02-06 02:43:40,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:40,472 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 403 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:40,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1122 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:43:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-02-06 02:43:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 591. [2025-02-06 02:43:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 430 states have (on average 1.5209302325581395) internal successors, (654), 431 states have internal predecessors, (654), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-06 02:43:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 966 transitions. [2025-02-06 02:43:40,508 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 966 transitions. Word has length 443 [2025-02-06 02:43:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:40,509 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 966 transitions. [2025-02-06 02:43:40,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 966 transitions. [2025-02-06 02:43:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-06 02:43:40,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:40,512 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:40,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:43:40,512 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:40,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:40,513 INFO L85 PathProgramCache]: Analyzing trace with hash -327814380, now seen corresponding path program 1 times [2025-02-06 02:43:40,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:40,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861849983] [2025-02-06 02:43:40,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:40,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:40,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-06 02:43:40,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-06 02:43:40,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:40,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:41,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:41,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861849983] [2025-02-06 02:43:41,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861849983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:41,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:41,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:43:41,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855035501] [2025-02-06 02:43:41,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:41,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:43:41,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:41,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:43:41,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:41,192 INFO L87 Difference]: Start difference. First operand 591 states and 966 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:41,277 INFO L93 Difference]: Finished difference Result 1054 states and 1733 transitions. [2025-02-06 02:43:41,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:43:41,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-02-06 02:43:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:41,282 INFO L225 Difference]: With dead ends: 1054 [2025-02-06 02:43:41,282 INFO L226 Difference]: Without dead ends: 591 [2025-02-06 02:43:41,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:41,284 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 0 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:41,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 798 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-02-06 02:43:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-02-06 02:43:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 430 states have (on average 1.5162790697674418) internal successors, (652), 431 states have internal predecessors, (652), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-06 02:43:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 964 transitions. [2025-02-06 02:43:41,316 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 964 transitions. Word has length 443 [2025-02-06 02:43:41,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:41,316 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 964 transitions. [2025-02-06 02:43:41,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 964 transitions. [2025-02-06 02:43:41,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-06 02:43:41,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:41,319 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:41,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:43:41,319 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:41,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1643125077, now seen corresponding path program 1 times [2025-02-06 02:43:41,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:41,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631227241] [2025-02-06 02:43:41,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:41,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:41,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-06 02:43:41,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-06 02:43:41,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:41,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:42,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:42,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631227241] [2025-02-06 02:43:42,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631227241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:42,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:42,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:43:42,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342254240] [2025-02-06 02:43:42,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:42,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:43:42,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:42,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:43:42,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:42,395 INFO L87 Difference]: Start difference. First operand 591 states and 964 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2025-02-06 02:43:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:43,046 INFO L93 Difference]: Finished difference Result 1980 states and 3259 transitions. [2025-02-06 02:43:43,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:43,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 443 [2025-02-06 02:43:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:43,055 INFO L225 Difference]: With dead ends: 1980 [2025-02-06 02:43:43,055 INFO L226 Difference]: Without dead ends: 1517 [2025-02-06 02:43:43,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:43:43,058 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 1367 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:43,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 1064 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:43:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-02-06 02:43:43,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1128. [2025-02-06 02:43:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 872 states have (on average 1.5642201834862386) internal successors, (1364), 874 states have internal predecessors, (1364), 249 states have call successors, (249), 6 states have call predecessors, (249), 6 states have return successors, (249), 247 states have call predecessors, (249), 249 states have call successors, (249) [2025-02-06 02:43:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1862 transitions. [2025-02-06 02:43:43,148 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1862 transitions. Word has length 443 [2025-02-06 02:43:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:43,149 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1862 transitions. [2025-02-06 02:43:43,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2025-02-06 02:43:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1862 transitions. [2025-02-06 02:43:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-06 02:43:43,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:43,152 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:43,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:43:43,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:43,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:43,153 INFO L85 PathProgramCache]: Analyzing trace with hash -540551850, now seen corresponding path program 1 times [2025-02-06 02:43:43,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:43,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085334040] [2025-02-06 02:43:43,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:43,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:43,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-06 02:43:43,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-06 02:43:43,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:43,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085334040] [2025-02-06 02:43:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085334040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:44,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:44,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:44,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841065454] [2025-02-06 02:43:44,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:44,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:44,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:44,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:44,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:44,093 INFO L87 Difference]: Start difference. First operand 1128 states and 1862 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:44,365 INFO L93 Difference]: Finished difference Result 2138 states and 3532 transitions. [2025-02-06 02:43:44,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:44,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-02-06 02:43:44,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:44,372 INFO L225 Difference]: With dead ends: 2138 [2025-02-06 02:43:44,372 INFO L226 Difference]: Without dead ends: 1138 [2025-02-06 02:43:44,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:44,375 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 499 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:44,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1054 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:43:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-02-06 02:43:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 894. [2025-02-06 02:43:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 698 states have (on average 1.5802292263610316) internal successors, (1103), 698 states have internal predecessors, (1103), 189 states have call successors, (189), 6 states have call predecessors, (189), 6 states have return successors, (189), 189 states have call predecessors, (189), 189 states have call successors, (189) [2025-02-06 02:43:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1481 transitions. [2025-02-06 02:43:44,437 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1481 transitions. Word has length 443 [2025-02-06 02:43:44,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:44,439 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1481 transitions. [2025-02-06 02:43:44,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1481 transitions. [2025-02-06 02:43:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-06 02:43:44,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:44,442 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:44,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:43:44,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:44,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:44,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1579735349, now seen corresponding path program 1 times [2025-02-06 02:43:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:44,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135040268] [2025-02-06 02:43:44,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:44,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:44,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-06 02:43:44,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-06 02:43:44,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:44,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:45,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135040268] [2025-02-06 02:43:45,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135040268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:45,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:45,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:45,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216603338] [2025-02-06 02:43:45,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:45,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:45,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:45,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:45,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:45,163 INFO L87 Difference]: Start difference. First operand 894 states and 1481 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:45,326 INFO L93 Difference]: Finished difference Result 1946 states and 3223 transitions. [2025-02-06 02:43:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:43:45,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-02-06 02:43:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:45,332 INFO L225 Difference]: With dead ends: 1946 [2025-02-06 02:43:45,332 INFO L226 Difference]: Without dead ends: 1180 [2025-02-06 02:43:45,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:45,334 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 155 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:45,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1390 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-02-06 02:43:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1176. [2025-02-06 02:43:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 966 states have (on average 1.5859213250517599) internal successors, (1532), 968 states have internal predecessors, (1532), 201 states have call successors, (201), 8 states have call predecessors, (201), 8 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) [2025-02-06 02:43:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1934 transitions. [2025-02-06 02:43:45,408 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1934 transitions. Word has length 443 [2025-02-06 02:43:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:45,411 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1934 transitions. [2025-02-06 02:43:45,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1934 transitions. [2025-02-06 02:43:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-06 02:43:45,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:45,415 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:45,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:43:45,415 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:45,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:45,416 INFO L85 PathProgramCache]: Analyzing trace with hash 231137169, now seen corresponding path program 1 times [2025-02-06 02:43:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:45,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518469199] [2025-02-06 02:43:45,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:45,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-06 02:43:45,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-06 02:43:45,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:45,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:46,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:46,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518469199] [2025-02-06 02:43:46,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518469199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:46,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:46,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:46,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507181802] [2025-02-06 02:43:46,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:46,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:46,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:46,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:46,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:46,042 INFO L87 Difference]: Start difference. First operand 1176 states and 1934 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:46,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:46,267 INFO L93 Difference]: Finished difference Result 2754 states and 4511 transitions. [2025-02-06 02:43:46,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:46,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-02-06 02:43:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:46,277 INFO L225 Difference]: With dead ends: 2754 [2025-02-06 02:43:46,277 INFO L226 Difference]: Without dead ends: 1706 [2025-02-06 02:43:46,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:46,281 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 421 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:46,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1060 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:46,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-02-06 02:43:46,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1176. [2025-02-06 02:43:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 966 states have (on average 1.5817805383022774) internal successors, (1528), 968 states have internal predecessors, (1528), 201 states have call successors, (201), 8 states have call predecessors, (201), 8 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) [2025-02-06 02:43:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1930 transitions. [2025-02-06 02:43:46,366 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1930 transitions. Word has length 443 [2025-02-06 02:43:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:46,366 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1930 transitions. [2025-02-06 02:43:46,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1930 transitions. [2025-02-06 02:43:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-06 02:43:46,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:46,371 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:46,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:43:46,372 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:46,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:46,373 INFO L85 PathProgramCache]: Analyzing trace with hash -347368205, now seen corresponding path program 1 times [2025-02-06 02:43:46,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:46,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023457617] [2025-02-06 02:43:46,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:46,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:46,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-06 02:43:46,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-06 02:43:46,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:46,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:46,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:46,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023457617] [2025-02-06 02:43:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023457617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:46,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:46,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:46,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213945300] [2025-02-06 02:43:46,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:46,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:46,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:47,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:47,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:47,000 INFO L87 Difference]: Start difference. First operand 1176 states and 1930 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:47,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:47,377 INFO L93 Difference]: Finished difference Result 4084 states and 6664 transitions. [2025-02-06 02:43:47,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:43:47,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-02-06 02:43:47,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:47,391 INFO L225 Difference]: With dead ends: 4084 [2025-02-06 02:43:47,392 INFO L226 Difference]: Without dead ends: 3036 [2025-02-06 02:43:47,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:47,395 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 1007 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:47,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 2194 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:43:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2025-02-06 02:43:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 1246. [2025-02-06 02:43:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1036 states have (on average 1.5888030888030888) internal successors, (1646), 1038 states have internal predecessors, (1646), 201 states have call successors, (201), 8 states have call predecessors, (201), 8 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) [2025-02-06 02:43:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 2048 transitions. [2025-02-06 02:43:47,541 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 2048 transitions. Word has length 443 [2025-02-06 02:43:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:47,541 INFO L471 AbstractCegarLoop]: Abstraction has 1246 states and 2048 transitions. [2025-02-06 02:43:47,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 2048 transitions. [2025-02-06 02:43:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-06 02:43:47,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:47,546 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:47,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:43:47,547 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:47,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:47,547 INFO L85 PathProgramCache]: Analyzing trace with hash 855369461, now seen corresponding path program 1 times [2025-02-06 02:43:47,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:47,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194795753] [2025-02-06 02:43:47,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:47,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:47,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-06 02:43:47,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-06 02:43:47,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:47,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:48,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:48,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194795753] [2025-02-06 02:43:48,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194795753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:48,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:48,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:48,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859149944] [2025-02-06 02:43:48,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:48,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:48,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:48,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:48,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:48,325 INFO L87 Difference]: Start difference. First operand 1246 states and 2048 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:48,602 INFO L93 Difference]: Finished difference Result 3761 states and 6221 transitions. [2025-02-06 02:43:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:48,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-02-06 02:43:48,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:48,614 INFO L225 Difference]: With dead ends: 3761 [2025-02-06 02:43:48,615 INFO L226 Difference]: Without dead ends: 2643 [2025-02-06 02:43:48,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:48,619 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 366 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:48,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1299 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:43:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2025-02-06 02:43:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2271. [2025-02-06 02:43:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2271 states, 2061 states have (on average 1.6438622028141678) internal successors, (3388), 2063 states have internal predecessors, (3388), 201 states have call successors, (201), 8 states have call predecessors, (201), 8 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) [2025-02-06 02:43:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 3790 transitions. [2025-02-06 02:43:48,712 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 3790 transitions. Word has length 443 [2025-02-06 02:43:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:48,712 INFO L471 AbstractCegarLoop]: Abstraction has 2271 states and 3790 transitions. [2025-02-06 02:43:48,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 3790 transitions. [2025-02-06 02:43:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-06 02:43:48,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:48,717 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:48,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:43:48,717 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:48,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1725333635, now seen corresponding path program 1 times [2025-02-06 02:43:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:48,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478435577] [2025-02-06 02:43:48,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:48,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-06 02:43:49,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-06 02:43:49,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:49,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:49,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:49,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478435577] [2025-02-06 02:43:49,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478435577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:49,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:49,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:43:49,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596203720] [2025-02-06 02:43:49,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:49,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:43:49,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:49,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:43:49,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:49,419 INFO L87 Difference]: Start difference. First operand 2271 states and 3790 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:49,959 INFO L93 Difference]: Finished difference Result 6277 states and 10524 transitions. [2025-02-06 02:43:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:49,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 444 [2025-02-06 02:43:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:49,976 INFO L225 Difference]: With dead ends: 6277 [2025-02-06 02:43:49,976 INFO L226 Difference]: Without dead ends: 4134 [2025-02-06 02:43:49,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:43:49,982 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 475 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:49,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1541 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:43:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2025-02-06 02:43:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 4132. [2025-02-06 02:43:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4132 states, 3790 states have (on average 1.6538258575197888) internal successors, (6268), 3792 states have internal predecessors, (6268), 327 states have call successors, (327), 14 states have call predecessors, (327), 14 states have return successors, (327), 325 states have call predecessors, (327), 327 states have call successors, (327) [2025-02-06 02:43:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 6922 transitions. [2025-02-06 02:43:50,136 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 6922 transitions. Word has length 444 [2025-02-06 02:43:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:50,137 INFO L471 AbstractCegarLoop]: Abstraction has 4132 states and 6922 transitions. [2025-02-06 02:43:50,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 6922 transitions. [2025-02-06 02:43:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-06 02:43:50,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:50,142 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:50,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:43:50,142 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:50,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1647251649, now seen corresponding path program 1 times [2025-02-06 02:43:50,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:50,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998986071] [2025-02-06 02:43:50,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:50,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:50,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-06 02:43:51,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-06 02:43:51,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:51,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3 proven. 183 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-02-06 02:43:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:52,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998986071] [2025-02-06 02:43:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998986071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:43:52,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916197927] [2025-02-06 02:43:52,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:52,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:43:52,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:43:52,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:43:52,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:43:52,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-06 02:43:52,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-06 02:43:52,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:52,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:52,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 02:43:52,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:43:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 4289 proven. 216 refuted. 0 times theorem prover too weak. 3307 trivial. 0 not checked. [2025-02-06 02:43:53,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:43:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 150 proven. 219 refuted. 0 times theorem prover too weak. 7443 trivial. 0 not checked. [2025-02-06 02:43:54,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916197927] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:43:54,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:43:54,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 20 [2025-02-06 02:43:54,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060125200] [2025-02-06 02:43:54,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:43:54,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 02:43:54,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:54,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 02:43:54,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-02-06 02:43:54,533 INFO L87 Difference]: Start difference. First operand 4132 states and 6922 transitions. Second operand has 20 states, 20 states have (on average 17.7) internal successors, (354), 20 states have internal predecessors, (354), 6 states have call successors, (163), 3 states have call predecessors, (163), 7 states have return successors, (165), 6 states have call predecessors, (165), 6 states have call successors, (165) [2025-02-06 02:43:56,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:56,381 INFO L93 Difference]: Finished difference Result 10642 states and 17553 transitions. [2025-02-06 02:43:56,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 02:43:56,386 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 17.7) internal successors, (354), 20 states have internal predecessors, (354), 6 states have call successors, (163), 3 states have call predecessors, (163), 7 states have return successors, (165), 6 states have call predecessors, (165), 6 states have call successors, (165) Word has length 444 [2025-02-06 02:43:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:56,415 INFO L225 Difference]: With dead ends: 10642 [2025-02-06 02:43:56,415 INFO L226 Difference]: Without dead ends: 6638 [2025-02-06 02:43:56,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 932 GetRequests, 882 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=651, Invalid=2001, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 02:43:56,425 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 1124 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:56,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 1791 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 02:43:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2025-02-06 02:43:56,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6490. [2025-02-06 02:43:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6490 states, 6011 states have (on average 1.5989020129762104) internal successors, (9611), 6019 states have internal predecessors, (9611), 427 states have call successors, (427), 51 states have call predecessors, (427), 51 states have return successors, (427), 419 states have call predecessors, (427), 427 states have call successors, (427) [2025-02-06 02:43:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 10465 transitions. [2025-02-06 02:43:56,790 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 10465 transitions. Word has length 444 [2025-02-06 02:43:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:56,790 INFO L471 AbstractCegarLoop]: Abstraction has 6490 states and 10465 transitions. [2025-02-06 02:43:56,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 17.7) internal successors, (354), 20 states have internal predecessors, (354), 6 states have call successors, (163), 3 states have call predecessors, (163), 7 states have return successors, (165), 6 states have call predecessors, (165), 6 states have call successors, (165) [2025-02-06 02:43:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 10465 transitions. [2025-02-06 02:43:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-06 02:43:56,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:56,805 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:56,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:43:57,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 02:43:57,006 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:57,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash -368444295, now seen corresponding path program 1 times [2025-02-06 02:43:57,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:57,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227705726] [2025-02-06 02:43:57,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:57,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:57,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-06 02:43:57,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-06 02:43:57,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:57,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:43:58,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227705726] [2025-02-06 02:43:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227705726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:58,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:58,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:43:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769938724] [2025-02-06 02:43:58,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:43:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:58,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:43:58,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:58,239 INFO L87 Difference]: Start difference. First operand 6490 states and 10465 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:58,825 INFO L93 Difference]: Finished difference Result 14122 states and 22674 transitions. [2025-02-06 02:43:58,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:43:58,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 445 [2025-02-06 02:43:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:58,846 INFO L225 Difference]: With dead ends: 14122 [2025-02-06 02:43:58,846 INFO L226 Difference]: Without dead ends: 7780 [2025-02-06 02:43:58,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:43:58,858 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 674 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:58,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1357 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:43:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7780 states. [2025-02-06 02:43:59,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7780 to 6490. [2025-02-06 02:43:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6490 states, 6011 states have (on average 1.5989020129762104) internal successors, (9611), 6019 states have internal predecessors, (9611), 427 states have call successors, (427), 51 states have call predecessors, (427), 51 states have return successors, (427), 419 states have call predecessors, (427), 427 states have call successors, (427) [2025-02-06 02:43:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 10465 transitions. [2025-02-06 02:43:59,137 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 10465 transitions. Word has length 445 [2025-02-06 02:43:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:59,137 INFO L471 AbstractCegarLoop]: Abstraction has 6490 states and 10465 transitions. [2025-02-06 02:43:59,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:43:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 10465 transitions. [2025-02-06 02:43:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-06 02:43:59,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:59,142 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:59,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:43:59,142 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:59,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:59,143 INFO L85 PathProgramCache]: Analyzing trace with hash -608984424, now seen corresponding path program 1 times [2025-02-06 02:43:59,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:59,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18755701] [2025-02-06 02:43:59,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:59,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:59,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-06 02:43:59,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-06 02:43:59,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:59,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:44:00,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:00,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18755701] [2025-02-06 02:44:00,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18755701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:44:00,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:44:00,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:44:00,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064926105] [2025-02-06 02:44:00,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:44:00,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:44:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:00,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:44:00,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:44:00,496 INFO L87 Difference]: Start difference. First operand 6490 states and 10465 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:44:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:01,001 INFO L93 Difference]: Finished difference Result 24848 states and 40368 transitions. [2025-02-06 02:44:01,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:44:01,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 445 [2025-02-06 02:44:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:01,065 INFO L225 Difference]: With dead ends: 24848 [2025-02-06 02:44:01,066 INFO L226 Difference]: Without dead ends: 18506 [2025-02-06 02:44:01,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:44:01,075 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 819 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:01,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 2190 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:44:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18506 states. [2025-02-06 02:44:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18506 to 6581. [2025-02-06 02:44:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6581 states, 6102 states have (on average 1.5994755817764668) internal successors, (9760), 6110 states have internal predecessors, (9760), 427 states have call successors, (427), 51 states have call predecessors, (427), 51 states have return successors, (427), 419 states have call predecessors, (427), 427 states have call successors, (427) [2025-02-06 02:44:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 10614 transitions. [2025-02-06 02:44:01,339 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 10614 transitions. Word has length 445 [2025-02-06 02:44:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:01,340 INFO L471 AbstractCegarLoop]: Abstraction has 6581 states and 10614 transitions. [2025-02-06 02:44:01,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:44:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 10614 transitions. [2025-02-06 02:44:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-06 02:44:01,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:01,344 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:01,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:44:01,345 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:01,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:01,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2141911997, now seen corresponding path program 1 times [2025-02-06 02:44:01,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:01,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244431408] [2025-02-06 02:44:01,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:01,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:01,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-06 02:44:03,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-06 02:44:03,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:03,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 9 proven. 177 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-02-06 02:44:03,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:03,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244431408] [2025-02-06 02:44:03,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244431408] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:44:03,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63492680] [2025-02-06 02:44:03,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:03,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:44:03,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:44:03,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:44:03,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:44:03,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-06 02:44:03,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-06 02:44:03,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:03,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:03,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:44:03,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:44:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3962 proven. 96 refuted. 0 times theorem prover too weak. 3754 trivial. 0 not checked. [2025-02-06 02:44:04,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:44:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 90 proven. 96 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-02-06 02:44:04,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63492680] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:44:04,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:44:04,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 02:44:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554851342] [2025-02-06 02:44:04,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:44:04,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:44:04,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:04,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:44:04,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:44:04,530 INFO L87 Difference]: Start difference. First operand 6581 states and 10614 transitions. Second operand has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 3 states have call successors, (154), 2 states have call predecessors, (154), 4 states have return successors, (156), 3 states have call predecessors, (156), 3 states have call successors, (156) [2025-02-06 02:44:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:05,064 INFO L93 Difference]: Finished difference Result 11371 states and 18119 transitions. [2025-02-06 02:44:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:44:05,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 3 states have call successors, (154), 2 states have call predecessors, (154), 4 states have return successors, (156), 3 states have call predecessors, (156), 3 states have call successors, (156) Word has length 445 [2025-02-06 02:44:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:05,079 INFO L225 Difference]: With dead ends: 11371 [2025-02-06 02:44:05,079 INFO L226 Difference]: Without dead ends: 4949 [2025-02-06 02:44:05,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 887 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:44:05,088 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 456 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:05,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 800 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:44:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2025-02-06 02:44:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4853. [2025-02-06 02:44:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 4356 states have (on average 1.5495867768595042) internal successors, (6750), 4364 states have internal predecessors, (6750), 427 states have call successors, (427), 69 states have call predecessors, (427), 69 states have return successors, (427), 419 states have call predecessors, (427), 427 states have call successors, (427) [2025-02-06 02:44:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 7604 transitions. [2025-02-06 02:44:05,292 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 7604 transitions. Word has length 445 [2025-02-06 02:44:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:05,293 INFO L471 AbstractCegarLoop]: Abstraction has 4853 states and 7604 transitions. [2025-02-06 02:44:05,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 3 states have call successors, (154), 2 states have call predecessors, (154), 4 states have return successors, (156), 3 states have call predecessors, (156), 3 states have call successors, (156) [2025-02-06 02:44:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 7604 transitions. [2025-02-06 02:44:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-06 02:44:05,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:05,297 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:05,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 02:44:05,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:44:05,499 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:05,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash -255456199, now seen corresponding path program 1 times [2025-02-06 02:44:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:05,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026930589] [2025-02-06 02:44:05,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:05,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-06 02:44:05,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-06 02:44:05,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:05,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:44:05,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:05,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026930589] [2025-02-06 02:44:05,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026930589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:44:05,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:44:05,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:44:05,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153637496] [2025-02-06 02:44:05,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:44:05,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:44:05,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:05,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:44:05,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:44:05,822 INFO L87 Difference]: Start difference. First operand 4853 states and 7604 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:44:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:06,350 INFO L93 Difference]: Finished difference Result 13607 states and 21241 transitions. [2025-02-06 02:44:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:44:06,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 445 [2025-02-06 02:44:06,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:06,372 INFO L225 Difference]: With dead ends: 13607 [2025-02-06 02:44:06,372 INFO L226 Difference]: Without dead ends: 8910 [2025-02-06 02:44:06,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:44:06,382 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 528 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:06,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1158 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:44:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8910 states. [2025-02-06 02:44:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8910 to 8618. [2025-02-06 02:44:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8618 states, 7697 states have (on average 1.5402104716123164) internal successors, (11855), 7713 states have internal predecessors, (11855), 791 states have call successors, (791), 129 states have call predecessors, (791), 129 states have return successors, (791), 775 states have call predecessors, (791), 791 states have call successors, (791) [2025-02-06 02:44:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8618 states to 8618 states and 13437 transitions. [2025-02-06 02:44:06,763 INFO L78 Accepts]: Start accepts. Automaton has 8618 states and 13437 transitions. Word has length 445 [2025-02-06 02:44:06,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:06,764 INFO L471 AbstractCegarLoop]: Abstraction has 8618 states and 13437 transitions. [2025-02-06 02:44:06,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:44:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8618 states and 13437 transitions. [2025-02-06 02:44:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-02-06 02:44:06,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:06,767 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:06,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 02:44:06,767 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:06,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:06,769 INFO L85 PathProgramCache]: Analyzing trace with hash 444752251, now seen corresponding path program 1 times [2025-02-06 02:44:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:06,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252988776] [2025-02-06 02:44:06,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:06,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-02-06 02:44:06,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-02-06 02:44:06,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:06,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:44:07,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:07,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252988776] [2025-02-06 02:44:07,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252988776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:44:07,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:44:07,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:44:07,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532210746] [2025-02-06 02:44:07,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:44:07,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:44:07,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:07,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:44:07,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:44:07,159 INFO L87 Difference]: Start difference. First operand 8618 states and 13437 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:44:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:07,518 INFO L93 Difference]: Finished difference Result 14148 states and 21894 transitions. [2025-02-06 02:44:07,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:44:07,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 446 [2025-02-06 02:44:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:07,543 INFO L225 Difference]: With dead ends: 14148 [2025-02-06 02:44:07,543 INFO L226 Difference]: Without dead ends: 9180 [2025-02-06 02:44:07,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:44:07,552 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 228 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:07,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1016 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:44:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9180 states. [2025-02-06 02:44:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9180 to 7898. [2025-02-06 02:44:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7898 states, 6977 states have (on average 1.5294539200229325) internal successors, (10671), 6993 states have internal predecessors, (10671), 791 states have call successors, (791), 129 states have call predecessors, (791), 129 states have return successors, (791), 775 states have call predecessors, (791), 791 states have call successors, (791) [2025-02-06 02:44:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7898 states to 7898 states and 12253 transitions. [2025-02-06 02:44:07,904 INFO L78 Accepts]: Start accepts. Automaton has 7898 states and 12253 transitions. Word has length 446 [2025-02-06 02:44:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:07,906 INFO L471 AbstractCegarLoop]: Abstraction has 7898 states and 12253 transitions. [2025-02-06 02:44:07,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:44:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 7898 states and 12253 transitions. [2025-02-06 02:44:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-06 02:44:07,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:07,909 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:07,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 02:44:07,910 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:07,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:07,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1142456362, now seen corresponding path program 1 times [2025-02-06 02:44:07,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:07,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810901740] [2025-02-06 02:44:07,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:07,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-06 02:44:08,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-06 02:44:08,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:08,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:44:08,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:08,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810901740] [2025-02-06 02:44:08,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810901740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:44:08,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:44:08,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:44:08,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389950449] [2025-02-06 02:44:08,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:44:08,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:44:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:08,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:44:08,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:44:08,923 INFO L87 Difference]: Start difference. First operand 7898 states and 12253 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:44:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:09,286 INFO L93 Difference]: Finished difference Result 19140 states and 29948 transitions. [2025-02-06 02:44:09,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:44:09,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 447 [2025-02-06 02:44:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:09,312 INFO L225 Difference]: With dead ends: 19140 [2025-02-06 02:44:09,312 INFO L226 Difference]: Without dead ends: 11398 [2025-02-06 02:44:09,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:44:09,324 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 594 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:09,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1098 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:44:09,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11398 states. [2025-02-06 02:44:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11398 to 7898. [2025-02-06 02:44:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7898 states, 6977 states have (on average 1.520854235344704) internal successors, (10611), 6993 states have internal predecessors, (10611), 791 states have call successors, (791), 129 states have call predecessors, (791), 129 states have return successors, (791), 775 states have call predecessors, (791), 791 states have call successors, (791) [2025-02-06 02:44:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7898 states to 7898 states and 12193 transitions. [2025-02-06 02:44:09,676 INFO L78 Accepts]: Start accepts. Automaton has 7898 states and 12193 transitions. Word has length 447 [2025-02-06 02:44:09,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:09,676 INFO L471 AbstractCegarLoop]: Abstraction has 7898 states and 12193 transitions. [2025-02-06 02:44:09,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:44:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7898 states and 12193 transitions. [2025-02-06 02:44:09,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-06 02:44:09,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:09,680 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:09,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 02:44:09,680 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:09,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1883486949, now seen corresponding path program 1 times [2025-02-06 02:44:09,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:09,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774075329] [2025-02-06 02:44:09,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:09,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:09,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-06 02:44:15,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-06 02:44:15,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:15,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 21 proven. 165 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-02-06 02:44:15,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:15,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774075329] [2025-02-06 02:44:15,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774075329] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:44:15,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3540564] [2025-02-06 02:44:15,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:15,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:44:15,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:44:15,511 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:44:15,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 02:44:15,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-06 02:44:15,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-06 02:44:15,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:15,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:15,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:44:15,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:44:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 1616 proven. 165 refuted. 0 times theorem prover too weak. 6031 trivial. 0 not checked. [2025-02-06 02:44:16,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:44:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 21 proven. 165 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-02-06 02:44:16,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3540564] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:44:16,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:44:16,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 02:44:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457481457] [2025-02-06 02:44:16,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:44:16,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:44:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:16,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:44:16,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:44:16,678 INFO L87 Difference]: Start difference. First operand 7898 states and 12193 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 2 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (119), 2 states have call predecessors, (119), 2 states have call successors, (119) [2025-02-06 02:44:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:17,082 INFO L93 Difference]: Finished difference Result 11811 states and 18295 transitions. [2025-02-06 02:44:17,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:44:17,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 2 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (119), 2 states have call predecessors, (119), 2 states have call successors, (119) Word has length 447 [2025-02-06 02:44:17,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:17,097 INFO L225 Difference]: With dead ends: 11811 [2025-02-06 02:44:17,097 INFO L226 Difference]: Without dead ends: 3401 [2025-02-06 02:44:17,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 891 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:44:17,107 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 344 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:17,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 810 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:44:17,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2025-02-06 02:44:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 3080. [2025-02-06 02:44:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3080 states, 2614 states have (on average 1.464804896710023) internal successors, (3829), 2618 states have internal predecessors, (3829), 403 states have call successors, (403), 62 states have call predecessors, (403), 62 states have return successors, (403), 399 states have call predecessors, (403), 403 states have call successors, (403) [2025-02-06 02:44:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4635 transitions. [2025-02-06 02:44:17,262 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4635 transitions. Word has length 447 [2025-02-06 02:44:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:17,263 INFO L471 AbstractCegarLoop]: Abstraction has 3080 states and 4635 transitions. [2025-02-06 02:44:17,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 2 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (119), 2 states have call predecessors, (119), 2 states have call successors, (119) [2025-02-06 02:44:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4635 transitions. [2025-02-06 02:44:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-06 02:44:17,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:17,266 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:17,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 02:44:17,466 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,SelfDestructingSolverStorable21 [2025-02-06 02:44:17,467 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:17,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:17,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1420722819, now seen corresponding path program 1 times [2025-02-06 02:44:17,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:17,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654456239] [2025-02-06 02:44:17,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:17,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:17,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-06 02:44:17,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-06 02:44:17,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:17,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:44:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654456239] [2025-02-06 02:44:18,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654456239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:44:18,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:44:18,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:44:18,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384482943] [2025-02-06 02:44:18,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:44:18,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:44:18,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:18,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:44:18,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:44:18,090 INFO L87 Difference]: Start difference. First operand 3080 states and 4635 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:44:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:18,309 INFO L93 Difference]: Finished difference Result 7016 states and 10595 transitions. [2025-02-06 02:44:18,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:44:18,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 447 [2025-02-06 02:44:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:18,320 INFO L225 Difference]: With dead ends: 7016 [2025-02-06 02:44:18,320 INFO L226 Difference]: Without dead ends: 2957 [2025-02-06 02:44:18,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:44:18,326 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 225 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:18,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 962 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:44:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2025-02-06 02:44:18,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2957. [2025-02-06 02:44:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 2483 states have (on average 1.4349577124446233) internal successors, (3563), 2487 states have internal predecessors, (3563), 403 states have call successors, (403), 70 states have call predecessors, (403), 70 states have return successors, (403), 399 states have call predecessors, (403), 403 states have call successors, (403) [2025-02-06 02:44:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 4369 transitions. [2025-02-06 02:44:18,488 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 4369 transitions. Word has length 447 [2025-02-06 02:44:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:18,489 INFO L471 AbstractCegarLoop]: Abstraction has 2957 states and 4369 transitions. [2025-02-06 02:44:18,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:44:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 4369 transitions. [2025-02-06 02:44:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-06 02:44:18,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:18,492 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:18,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 02:44:18,492 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:18,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash -939392123, now seen corresponding path program 1 times [2025-02-06 02:44:18,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:18,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098309055] [2025-02-06 02:44:18,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:18,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-06 02:44:19,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-06 02:44:19,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:19,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-02-06 02:44:20,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:20,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098309055] [2025-02-06 02:44:20,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098309055] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:44:20,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471984092] [2025-02-06 02:44:20,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:20,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:44:20,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:44:20,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:44:20,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:44:20,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-06 02:44:20,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-06 02:44:20,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:20,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:20,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 02:44:20,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:44:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 5532 proven. 102 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-06 02:44:21,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:44:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-02-06 02:44:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471984092] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:44:21,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:44:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2025-02-06 02:44:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493203304] [2025-02-06 02:44:21,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:44:21,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 02:44:21,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:21,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 02:44:21,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-02-06 02:44:21,989 INFO L87 Difference]: Start difference. First operand 2957 states and 4369 transitions. Second operand has 23 states, 23 states have (on average 15.0) internal successors, (345), 23 states have internal predecessors, (345), 9 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 9 states have call predecessors, (145), 9 states have call successors, (145) [2025-02-06 02:44:23,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:23,254 INFO L93 Difference]: Finished difference Result 6886 states and 10063 transitions. [2025-02-06 02:44:23,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 02:44:23,255 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 15.0) internal successors, (345), 23 states have internal predecessors, (345), 9 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 9 states have call predecessors, (145), 9 states have call successors, (145) Word has length 447 [2025-02-06 02:44:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:23,268 INFO L225 Difference]: With dead ends: 6886 [2025-02-06 02:44:23,268 INFO L226 Difference]: Without dead ends: 4089 [2025-02-06 02:44:23,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 882 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=830, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 02:44:23,274 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1966 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 790 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1994 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 790 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:23,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1994 Valid, 1640 Invalid, 2131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [790 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:44:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2025-02-06 02:44:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 2605. [2025-02-06 02:44:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 2230 states have (on average 1.4556053811659193) internal successors, (3246), 2230 states have internal predecessors, (3246), 315 states have call successors, (315), 59 states have call predecessors, (315), 59 states have return successors, (315), 315 states have call predecessors, (315), 315 states have call successors, (315) [2025-02-06 02:44:23,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 3876 transitions. [2025-02-06 02:44:23,459 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 3876 transitions. Word has length 447 [2025-02-06 02:44:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:23,460 INFO L471 AbstractCegarLoop]: Abstraction has 2605 states and 3876 transitions. [2025-02-06 02:44:23,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 15.0) internal successors, (345), 23 states have internal predecessors, (345), 9 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 9 states have call predecessors, (145), 9 states have call successors, (145) [2025-02-06 02:44:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3876 transitions. [2025-02-06 02:44:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-06 02:44:23,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:23,463 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:23,473 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-06 02:44:23,663 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,SelfDestructingSolverStorable23 [2025-02-06 02:44:23,664 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:23,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:23,664 INFO L85 PathProgramCache]: Analyzing trace with hash -170222108, now seen corresponding path program 1 times [2025-02-06 02:44:23,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:23,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264778699] [2025-02-06 02:44:23,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:23,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:23,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-06 02:44:25,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-06 02:44:25,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:25,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 150 proven. 216 refuted. 0 times theorem prover too weak. 7446 trivial. 0 not checked. [2025-02-06 02:44:26,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264778699] [2025-02-06 02:44:26,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264778699] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:44:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356600664] [2025-02-06 02:44:26,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:26,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:44:26,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:44:26,354 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-06 02:44:26,355 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-06 02:44:26,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-06 02:44:26,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-06 02:44:26,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:26,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:26,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 02:44:26,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:44:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 5628 proven. 102 refuted. 0 times theorem prover too weak. 2082 trivial. 0 not checked. [2025-02-06 02:44:27,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:44:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-02-06 02:44:27,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356600664] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:44:27,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:44:27,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2025-02-06 02:44:27,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770165153] [2025-02-06 02:44:27,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:44:27,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 02:44:27,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:27,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 02:44:27,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-02-06 02:44:27,918 INFO L87 Difference]: Start difference. First operand 2605 states and 3876 transitions. Second operand has 24 states, 24 states have (on average 14.541666666666666) internal successors, (349), 24 states have internal predecessors, (349), 10 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 10 states have call predecessors, (145), 10 states have call successors, (145) [2025-02-06 02:44:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:29,344 INFO L93 Difference]: Finished difference Result 6122 states and 9014 transitions. [2025-02-06 02:44:29,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 02:44:29,344 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 14.541666666666666) internal successors, (349), 24 states have internal predecessors, (349), 10 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 10 states have call predecessors, (145), 10 states have call successors, (145) Word has length 447 [2025-02-06 02:44:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:29,354 INFO L225 Difference]: With dead ends: 6122 [2025-02-06 02:44:29,354 INFO L226 Difference]: Without dead ends: 3681 [2025-02-06 02:44:29,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 885 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=458, Invalid=1434, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 02:44:29,359 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 2043 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 829 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2046 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 2505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 829 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:29,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2046 Valid, 1903 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [829 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:44:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2025-02-06 02:44:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 2034. [2025-02-06 02:44:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1654 states have (on average 1.4165659008464329) internal successors, (2343), 1654 states have internal predecessors, (2343), 315 states have call successors, (315), 64 states have call predecessors, (315), 64 states have return successors, (315), 315 states have call predecessors, (315), 315 states have call successors, (315) [2025-02-06 02:44:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2973 transitions. [2025-02-06 02:44:29,495 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2973 transitions. Word has length 447 [2025-02-06 02:44:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:29,496 INFO L471 AbstractCegarLoop]: Abstraction has 2034 states and 2973 transitions. [2025-02-06 02:44:29,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.541666666666666) internal successors, (349), 24 states have internal predecessors, (349), 10 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 10 states have call predecessors, (145), 10 states have call successors, (145) [2025-02-06 02:44:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2973 transitions. [2025-02-06 02:44:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-02-06 02:44:29,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:29,498 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:29,510 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-06 02:44:29,698 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,SelfDestructingSolverStorable24 [2025-02-06 02:44:29,699 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:29,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1556160548, now seen corresponding path program 1 times [2025-02-06 02:44:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:29,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277308001] [2025-02-06 02:44:29,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:29,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:29,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-02-06 02:44:29,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-02-06 02:44:29,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:29,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-02-06 02:44:30,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:30,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277308001] [2025-02-06 02:44:30,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277308001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:44:30,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:44:30,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:44:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809924994] [2025-02-06 02:44:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:44:30,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:44:30,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:30,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:44:30,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:44:30,336 INFO L87 Difference]: Start difference. First operand 2034 states and 2973 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:44:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:30,561 INFO L93 Difference]: Finished difference Result 4563 states and 6725 transitions. [2025-02-06 02:44:30,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:44:30,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 448 [2025-02-06 02:44:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:30,570 INFO L225 Difference]: With dead ends: 4563 [2025-02-06 02:44:30,570 INFO L226 Difference]: Without dead ends: 2697 [2025-02-06 02:44:30,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:44:30,573 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 261 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:30,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1161 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:44:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2025-02-06 02:44:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2034. [2025-02-06 02:44:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1654 states have (on average 1.407496977025393) internal successors, (2328), 1654 states have internal predecessors, (2328), 315 states have call successors, (315), 64 states have call predecessors, (315), 64 states have return successors, (315), 315 states have call predecessors, (315), 315 states have call successors, (315) [2025-02-06 02:44:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2958 transitions. [2025-02-06 02:44:30,707 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2958 transitions. Word has length 448 [2025-02-06 02:44:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:30,707 INFO L471 AbstractCegarLoop]: Abstraction has 2034 states and 2958 transitions. [2025-02-06 02:44:30,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-02-06 02:44:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2958 transitions. [2025-02-06 02:44:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-02-06 02:44:30,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:30,709 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:30,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 02:44:30,710 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:30,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:30,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1994170051, now seen corresponding path program 1 times [2025-02-06 02:44:30,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:30,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144900395] [2025-02-06 02:44:30,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:30,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:30,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-02-06 02:44:32,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-02-06 02:44:32,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:32,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 261 proven. 279 refuted. 0 times theorem prover too weak. 7272 trivial. 0 not checked. [2025-02-06 02:44:37,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:37,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144900395] [2025-02-06 02:44:37,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144900395] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:44:37,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035553267] [2025-02-06 02:44:37,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:37,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:44:37,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:44:37,731 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:44:37,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 02:44:37,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-02-06 02:44:38,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-02-06 02:44:38,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:38,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:38,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 02:44:38,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:44:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 4860 proven. 180 refuted. 0 times theorem prover too weak. 2772 trivial. 0 not checked. [2025-02-06 02:44:38,732 INFO L312 TraceCheckSpWp]: Computing backward predicates...