./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-89.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_amount250_file-89.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 c364d5742786a109dce2eae30e32833d89e81ae3212872a34b0b87c86d2f2db6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:23:17,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:23:17,876 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:23:17,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:23:17,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:23:17,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:23:17,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:23:17,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:23:17,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:23:17,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:23:17,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:23:17,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:23:17,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:23:17,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:23:17,903 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:23:17,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:23:17,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:23:17,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:23:17,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:23:17,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:23:17,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:23:17,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:23:17,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:23:17,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:23:17,904 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:23:17,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:23:17,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:23:17,905 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:23:17,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:23:17,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:23:17,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:23:17,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:23:17,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:23:17,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:23:17,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:23:17,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:23:17,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:23:17,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:23:17,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:23:17,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:23:17,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:23:17,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:23:17,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:23:17,907 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 -> c364d5742786a109dce2eae30e32833d89e81ae3212872a34b0b87c86d2f2db6 [2025-02-06 02:23:18,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:23:18,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:23:18,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:23:18,169 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:23:18,169 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:23:18,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-89.i [2025-02-06 02:23:19,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32d7e3283/84cbbfc626a74ddd861becf2bb37d032/FLAG4fdc64701 [2025-02-06 02:23:19,739 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:23:19,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-89.i [2025-02-06 02:23:19,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32d7e3283/84cbbfc626a74ddd861becf2bb37d032/FLAG4fdc64701 [2025-02-06 02:23:19,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32d7e3283/84cbbfc626a74ddd861becf2bb37d032 [2025-02-06 02:23:19,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:23:19,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:23:19,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:23:19,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:23:19,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:23:19,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:23:19" (1/1) ... [2025-02-06 02:23:19,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e35d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:19, skipping insertion in model container [2025-02-06 02:23:19,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:23:19" (1/1) ... [2025-02-06 02:23:19,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:23:19,934 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_amount250_file-89.i[916,929] [2025-02-06 02:23:20,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:23:20,102 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:23:20,115 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_amount250_file-89.i[916,929] [2025-02-06 02:23:20,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:23:20,205 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:23:20,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20 WrapperNode [2025-02-06 02:23:20,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:23:20,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:23:20,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:23:20,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:23:20,213 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:23:20" (1/1) ... [2025-02-06 02:23:20,234 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:23:20" (1/1) ... [2025-02-06 02:23:20,284 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2025-02-06 02:23:20,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:23:20,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:23:20,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:23:20,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:23:20,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,342 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:23:20,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:23:20,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:23:20,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:23:20,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:23:20,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:23:20,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:23:20,434 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:23:20,436 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:23:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:23:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:23:20,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:23:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:23:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:23:20,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:23:20,570 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:23:20,572 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:23:21,391 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L364: havoc property_#t~bitwise35#1;havoc property_#t~short36#1;havoc property_#t~bitwise37#1;havoc property_#t~short38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~ite43#1;havoc property_#t~bitwise42#1;havoc property_#t~short44#1;havoc property_#t~bitwise45#1;havoc property_#t~short46#1; [2025-02-06 02:23:21,469 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-02-06 02:23:21,469 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:23:21,494 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:23:21,497 INFO L337 CfgBuilder]: Removed 4 assume(true) statements. [2025-02-06 02:23:21,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:23:21 BoogieIcfgContainer [2025-02-06 02:23:21,498 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:23:21,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:23:21,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:23:21,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:23:21,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:23:19" (1/3) ... [2025-02-06 02:23:21,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e42ad79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:23:21, skipping insertion in model container [2025-02-06 02:23:21,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (2/3) ... [2025-02-06 02:23:21,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e42ad79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:23:21, skipping insertion in model container [2025-02-06 02:23:21,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:23:21" (3/3) ... [2025-02-06 02:23:21,507 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-89.i [2025-02-06 02:23:21,523 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:23:21,524 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-89.i that has 2 procedures, 194 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:23:21,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:23:21,595 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;@47dbea6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:23:21,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:23:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 149 states have internal predecessors, (225), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-06 02:23:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-06 02:23:21,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:21,619 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:21,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:21,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:21,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2032917195, now seen corresponding path program 1 times [2025-02-06 02:23:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:21,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465502388] [2025-02-06 02:23:21,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:21,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 02:23:21,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 02:23:21,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:21,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-02-06 02:23:22,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:22,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465502388] [2025-02-06 02:23:22,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465502388] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:23:22,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253450722] [2025-02-06 02:23:22,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:22,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:23:22,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:23:22,131 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:23:22,133 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:23:22,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 02:23:22,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 02:23:22,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:22,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:22,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:23:22,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:23:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-02-06 02:23:22,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:23:22,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253450722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:22,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:23:22,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:23:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067058403] [2025-02-06 02:23:22,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:22,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:23:22,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:22,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:23:22,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:23:22,527 INFO L87 Difference]: Start difference. First operand has 194 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 149 states have internal predecessors, (225), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-02-06 02:23:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:22,584 INFO L93 Difference]: Finished difference Result 382 states and 660 transitions. [2025-02-06 02:23:22,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:23:22,587 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 298 [2025-02-06 02:23:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:22,595 INFO L225 Difference]: With dead ends: 382 [2025-02-06 02:23:22,595 INFO L226 Difference]: Without dead ends: 191 [2025-02-06 02:23:22,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 299 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:23:22,601 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:22,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:23:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-06 02:23:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-02-06 02:23:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 146 states have (on average 1.5068493150684932) internal successors, (220), 146 states have internal predecessors, (220), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-06 02:23:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 306 transitions. [2025-02-06 02:23:22,659 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 306 transitions. Word has length 298 [2025-02-06 02:23:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:22,659 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 306 transitions. [2025-02-06 02:23:22,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-02-06 02:23:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 306 transitions. [2025-02-06 02:23:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-06 02:23:22,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:22,669 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:22,679 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:23:22,874 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:23:22,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:22,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash 380920658, now seen corresponding path program 1 times [2025-02-06 02:23:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:22,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754099004] [2025-02-06 02:23:22,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:22,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:22,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 02:23:22,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 02:23:22,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:22,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:23,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:23,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754099004] [2025-02-06 02:23:23,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754099004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:23,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:23,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:23:23,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302341093] [2025-02-06 02:23:23,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:23,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:23:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:23,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:23:23,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:23:23,264 INFO L87 Difference]: Start difference. First operand 191 states and 306 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:23,392 INFO L93 Difference]: Finished difference Result 476 states and 760 transitions. [2025-02-06 02:23:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:23:23,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 298 [2025-02-06 02:23:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:23,400 INFO L225 Difference]: With dead ends: 476 [2025-02-06 02:23:23,400 INFO L226 Difference]: Without dead ends: 288 [2025-02-06 02:23:23,401 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:23:23,402 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 149 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:23,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 556 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:23:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-06 02:23:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 285. [2025-02-06 02:23:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.51931330472103) internal successors, (354), 234 states have internal predecessors, (354), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 02:23:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 452 transitions. [2025-02-06 02:23:23,433 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 452 transitions. Word has length 298 [2025-02-06 02:23:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:23,434 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 452 transitions. [2025-02-06 02:23:23,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 452 transitions. [2025-02-06 02:23:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-06 02:23:23,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:23,441 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:23,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:23:23,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:23,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:23,442 INFO L85 PathProgramCache]: Analyzing trace with hash -518214036, now seen corresponding path program 1 times [2025-02-06 02:23:23,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:23,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477899967] [2025-02-06 02:23:23,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:23,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:23,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 02:23:23,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 02:23:23,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:23,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:23,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:23,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477899967] [2025-02-06 02:23:23,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477899967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:23,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:23,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:23:23,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947031618] [2025-02-06 02:23:23,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:23,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:23:23,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:23,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:23:23,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:23:23,746 INFO L87 Difference]: Start difference. First operand 285 states and 452 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:23,862 INFO L93 Difference]: Finished difference Result 773 states and 1222 transitions. [2025-02-06 02:23:23,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:23:23,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 298 [2025-02-06 02:23:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:23,869 INFO L225 Difference]: With dead ends: 773 [2025-02-06 02:23:23,869 INFO L226 Difference]: Without dead ends: 491 [2025-02-06 02:23:23,870 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:23:23,870 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 157 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:23,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 553 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:23:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-02-06 02:23:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2025-02-06 02:23:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 425 states have (on average 1.5294117647058822) internal successors, (650), 428 states have internal predecessors, (650), 57 states have call successors, (57), 4 states have call predecessors, (57), 4 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 02:23:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 764 transitions. [2025-02-06 02:23:23,913 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 764 transitions. Word has length 298 [2025-02-06 02:23:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:23,914 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 764 transitions. [2025-02-06 02:23:23,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 764 transitions. [2025-02-06 02:23:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-06 02:23:23,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:23,919 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:23,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:23:23,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:23,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:23,920 INFO L85 PathProgramCache]: Analyzing trace with hash -541762925, now seen corresponding path program 1 times [2025-02-06 02:23:23,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:23,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887147262] [2025-02-06 02:23:23,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:23,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:23,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 02:23:24,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 02:23:24,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:24,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:24,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887147262] [2025-02-06 02:23:24,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887147262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:24,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:24,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:23:24,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658824814] [2025-02-06 02:23:24,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:24,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:23:24,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:24,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:23:24,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:23:24,321 INFO L87 Difference]: Start difference. First operand 487 states and 764 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:24,476 INFO L93 Difference]: Finished difference Result 1351 states and 2116 transitions. [2025-02-06 02:23:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:23:24,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 298 [2025-02-06 02:23:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:24,485 INFO L225 Difference]: With dead ends: 1351 [2025-02-06 02:23:24,487 INFO L226 Difference]: Without dead ends: 867 [2025-02-06 02:23:24,489 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:23:24,490 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 230 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:24,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 738 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:23:24,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-02-06 02:23:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 685. [2025-02-06 02:23:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 623 states have (on average 1.5553772070626004) internal successors, (969), 626 states have internal predecessors, (969), 57 states have call successors, (57), 4 states have call predecessors, (57), 4 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 02:23:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1083 transitions. [2025-02-06 02:23:24,549 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1083 transitions. Word has length 298 [2025-02-06 02:23:24,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:24,550 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1083 transitions. [2025-02-06 02:23:24,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1083 transitions. [2025-02-06 02:23:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:23:24,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:24,557 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:24,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:23:24,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:24,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1271409796, now seen corresponding path program 1 times [2025-02-06 02:23:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:24,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209171685] [2025-02-06 02:23:24,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:24,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:24,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:23:24,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:23:24,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:24,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:24,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:24,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209171685] [2025-02-06 02:23:24,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209171685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:24,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:24,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:23:24,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740269983] [2025-02-06 02:23:24,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:24,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:23:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:25,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:23:25,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:23:25,001 INFO L87 Difference]: Start difference. First operand 685 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:25,150 INFO L93 Difference]: Finished difference Result 1909 states and 3014 transitions. [2025-02-06 02:23:25,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:23:25,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-02-06 02:23:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:25,159 INFO L225 Difference]: With dead ends: 1909 [2025-02-06 02:23:25,159 INFO L226 Difference]: Without dead ends: 1227 [2025-02-06 02:23:25,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:23:25,162 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 131 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:25,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 556 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:23:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-02-06 02:23:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1221. [2025-02-06 02:23:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1147 states have (on average 1.5510026155187446) internal successors, (1779), 1154 states have internal predecessors, (1779), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 02:23:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1909 transitions. [2025-02-06 02:23:25,224 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1909 transitions. Word has length 299 [2025-02-06 02:23:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:25,225 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1909 transitions. [2025-02-06 02:23:25,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1909 transitions. [2025-02-06 02:23:25,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:23:25,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:25,232 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:25,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:23:25,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:25,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1260093669, now seen corresponding path program 1 times [2025-02-06 02:23:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:25,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888717171] [2025-02-06 02:23:25,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:25,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:23:25,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:23:25,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:25,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:27,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:27,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888717171] [2025-02-06 02:23:27,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888717171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:27,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:27,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:23:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176973552] [2025-02-06 02:23:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:27,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:23:27,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:27,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:23:27,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:23:27,748 INFO L87 Difference]: Start difference. First operand 1221 states and 1909 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:28,752 INFO L93 Difference]: Finished difference Result 3482 states and 5440 transitions. [2025-02-06 02:23:28,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:23:28,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-02-06 02:23:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:28,765 INFO L225 Difference]: With dead ends: 3482 [2025-02-06 02:23:28,766 INFO L226 Difference]: Without dead ends: 2264 [2025-02-06 02:23:28,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:23:28,770 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 669 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:28,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1043 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:23:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2025-02-06 02:23:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1539. [2025-02-06 02:23:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1465 states have (on average 1.569283276450512) internal successors, (2299), 1472 states have internal predecessors, (2299), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 02:23:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2429 transitions. [2025-02-06 02:23:28,840 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2429 transitions. Word has length 299 [2025-02-06 02:23:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:28,842 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2429 transitions. [2025-02-06 02:23:28,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2429 transitions. [2025-02-06 02:23:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-02-06 02:23:28,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:28,849 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:28,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:23:28,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:28,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1154854719, now seen corresponding path program 1 times [2025-02-06 02:23:28,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:28,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238136814] [2025-02-06 02:23:28,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:28,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:28,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-02-06 02:23:29,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-02-06 02:23:29,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:29,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:29,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:29,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238136814] [2025-02-06 02:23:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238136814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:29,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:29,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:23:29,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390990934] [2025-02-06 02:23:29,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:29,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:23:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:29,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:23:29,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:23:29,524 INFO L87 Difference]: Start difference. First operand 1539 states and 2429 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:30,009 INFO L93 Difference]: Finished difference Result 5973 states and 9446 transitions. [2025-02-06 02:23:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:23:30,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 300 [2025-02-06 02:23:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:30,033 INFO L225 Difference]: With dead ends: 5973 [2025-02-06 02:23:30,034 INFO L226 Difference]: Without dead ends: 4437 [2025-02-06 02:23:30,039 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:23:30,040 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 545 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:30,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 810 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:23:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4437 states. [2025-02-06 02:23:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4437 to 3069. [2025-02-06 02:23:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 2922 states have (on average 1.568788501026694) internal successors, (4584), 2936 states have internal predecessors, (4584), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 116 states have call predecessors, (130), 130 states have call successors, (130) [2025-02-06 02:23:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 4844 transitions. [2025-02-06 02:23:30,236 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 4844 transitions. Word has length 300 [2025-02-06 02:23:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:30,237 INFO L471 AbstractCegarLoop]: Abstraction has 3069 states and 4844 transitions. [2025-02-06 02:23:30,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 4844 transitions. [2025-02-06 02:23:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-02-06 02:23:30,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:30,248 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:30,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:23:30,248 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:30,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash 816084738, now seen corresponding path program 1 times [2025-02-06 02:23:30,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:30,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195912067] [2025-02-06 02:23:30,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:30,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:30,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-02-06 02:23:30,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-02-06 02:23:30,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:30,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:30,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:30,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195912067] [2025-02-06 02:23:30,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195912067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:30,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:30,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:23:30,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535241936] [2025-02-06 02:23:30,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:30,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:23:30,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:30,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:23:30,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:23:30,831 INFO L87 Difference]: Start difference. First operand 3069 states and 4844 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:31,010 INFO L93 Difference]: Finished difference Result 6165 states and 9726 transitions. [2025-02-06 02:23:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:23:31,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 300 [2025-02-06 02:23:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:31,025 INFO L225 Difference]: With dead ends: 6165 [2025-02-06 02:23:31,025 INFO L226 Difference]: Without dead ends: 3099 [2025-02-06 02:23:31,030 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:23:31,031 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 157 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:31,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 834 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:23:31,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2025-02-06 02:23:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3081. [2025-02-06 02:23:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 2934 states have (on average 1.5664621676891615) internal successors, (4596), 2948 states have internal predecessors, (4596), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 116 states have call predecessors, (130), 130 states have call successors, (130) [2025-02-06 02:23:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4856 transitions. [2025-02-06 02:23:31,150 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4856 transitions. Word has length 300 [2025-02-06 02:23:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:31,151 INFO L471 AbstractCegarLoop]: Abstraction has 3081 states and 4856 transitions. [2025-02-06 02:23:31,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4856 transitions. [2025-02-06 02:23:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-06 02:23:31,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:31,160 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:31,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:23:31,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:31,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:31,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1598164672, now seen corresponding path program 1 times [2025-02-06 02:23:31,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:31,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38345464] [2025-02-06 02:23:31,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:31,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:31,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-06 02:23:31,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-06 02:23:31,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:31,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:31,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38345464] [2025-02-06 02:23:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38345464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:31,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:31,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:23:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216089114] [2025-02-06 02:23:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:31,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:23:31,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:31,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:23:31,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:23:31,668 INFO L87 Difference]: Start difference. First operand 3081 states and 4856 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:31,932 INFO L93 Difference]: Finished difference Result 6193 states and 9759 transitions. [2025-02-06 02:23:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:23:31,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 301 [2025-02-06 02:23:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:31,948 INFO L225 Difference]: With dead ends: 6193 [2025-02-06 02:23:31,948 INFO L226 Difference]: Without dead ends: 3115 [2025-02-06 02:23:31,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:23:31,954 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 137 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:31,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 869 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:23:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2025-02-06 02:23:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3097. [2025-02-06 02:23:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3097 states, 2950 states have (on average 1.5633898305084746) internal successors, (4612), 2964 states have internal predecessors, (4612), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 116 states have call predecessors, (130), 130 states have call successors, (130) [2025-02-06 02:23:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 3097 states and 4872 transitions. [2025-02-06 02:23:32,071 INFO L78 Accepts]: Start accepts. Automaton has 3097 states and 4872 transitions. Word has length 301 [2025-02-06 02:23:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:32,071 INFO L471 AbstractCegarLoop]: Abstraction has 3097 states and 4872 transitions. [2025-02-06 02:23:32,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3097 states and 4872 transitions. [2025-02-06 02:23:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-06 02:23:32,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:32,081 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:32,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:23:32,082 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:32,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1038046481, now seen corresponding path program 1 times [2025-02-06 02:23:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:32,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873552021] [2025-02-06 02:23:32,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:32,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-06 02:23:32,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-06 02:23:32,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:32,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:34,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873552021] [2025-02-06 02:23:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873552021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:34,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:34,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:23:34,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195859126] [2025-02-06 02:23:34,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:34,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:23:34,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:34,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:23:34,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:23:34,497 INFO L87 Difference]: Start difference. First operand 3097 states and 4872 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:35,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:35,834 INFO L93 Difference]: Finished difference Result 15727 states and 24199 transitions. [2025-02-06 02:23:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 02:23:35,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 301 [2025-02-06 02:23:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:35,900 INFO L225 Difference]: With dead ends: 15727 [2025-02-06 02:23:35,900 INFO L226 Difference]: Without dead ends: 12633 [2025-02-06 02:23:35,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2025-02-06 02:23:35,915 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 1765 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:35,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 1903 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:23:35,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12633 states. [2025-02-06 02:23:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12633 to 7025. [2025-02-06 02:23:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7025 states, 6732 states have (on average 1.566250742721331) internal successors, (10544), 6760 states have internal predecessors, (10544), 260 states have call successors, (260), 32 states have call predecessors, (260), 32 states have return successors, (260), 232 states have call predecessors, (260), 260 states have call successors, (260) [2025-02-06 02:23:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 11064 transitions. [2025-02-06 02:23:36,254 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 11064 transitions. Word has length 301 [2025-02-06 02:23:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:36,255 INFO L471 AbstractCegarLoop]: Abstraction has 7025 states and 11064 transitions. [2025-02-06 02:23:36,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 11064 transitions. [2025-02-06 02:23:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-06 02:23:36,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:36,269 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:36,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:23:36,270 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:36,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:36,270 INFO L85 PathProgramCache]: Analyzing trace with hash -687246544, now seen corresponding path program 1 times [2025-02-06 02:23:36,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:36,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654818920] [2025-02-06 02:23:36,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:36,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:36,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-06 02:23:36,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-06 02:23:36,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:36,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:37,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654818920] [2025-02-06 02:23:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654818920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:37,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:37,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:23:37,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96792094] [2025-02-06 02:23:37,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:37,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:23:37,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:37,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:23:37,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:23:37,887 INFO L87 Difference]: Start difference. First operand 7025 states and 11064 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:38,889 INFO L93 Difference]: Finished difference Result 23851 states and 37411 transitions. [2025-02-06 02:23:38,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:23:38,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 301 [2025-02-06 02:23:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:38,946 INFO L225 Difference]: With dead ends: 23851 [2025-02-06 02:23:38,946 INFO L226 Difference]: Without dead ends: 16829 [2025-02-06 02:23:38,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:23:38,964 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 450 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:38,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1039 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:23:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16829 states. [2025-02-06 02:23:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16829 to 9865. [2025-02-06 02:23:39,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9865 states, 9572 states have (on average 1.6067697450898455) internal successors, (15380), 9600 states have internal predecessors, (15380), 260 states have call successors, (260), 32 states have call predecessors, (260), 32 states have return successors, (260), 232 states have call predecessors, (260), 260 states have call successors, (260) [2025-02-06 02:23:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9865 states to 9865 states and 15900 transitions. [2025-02-06 02:23:39,366 INFO L78 Accepts]: Start accepts. Automaton has 9865 states and 15900 transitions. Word has length 301 [2025-02-06 02:23:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:39,369 INFO L471 AbstractCegarLoop]: Abstraction has 9865 states and 15900 transitions. [2025-02-06 02:23:39,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 9865 states and 15900 transitions. [2025-02-06 02:23:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:23:39,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:39,387 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:39,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:23:39,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:39,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash -452615126, now seen corresponding path program 1 times [2025-02-06 02:23:39,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:39,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989643341] [2025-02-06 02:23:39,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:39,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:39,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:23:39,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:23:39,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:39,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:39,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:39,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989643341] [2025-02-06 02:23:39,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989643341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:39,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:23:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498026171] [2025-02-06 02:23:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:39,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:23:39,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:39,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:23:39,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:23:39,856 INFO L87 Difference]: Start difference. First operand 9865 states and 15900 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:40,374 INFO L93 Difference]: Finished difference Result 22501 states and 36001 transitions. [2025-02-06 02:23:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:23:40,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-02-06 02:23:40,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:40,414 INFO L225 Difference]: With dead ends: 22501 [2025-02-06 02:23:40,414 INFO L226 Difference]: Without dead ends: 12639 [2025-02-06 02:23:40,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:23:40,434 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 411 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:40,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 990 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:23:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12639 states. [2025-02-06 02:23:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12639 to 11985. [2025-02-06 02:23:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11985 states, 11692 states have (on average 1.593226137529935) internal successors, (18628), 11720 states have internal predecessors, (18628), 260 states have call successors, (260), 32 states have call predecessors, (260), 32 states have return successors, (260), 232 states have call predecessors, (260), 260 states have call successors, (260) [2025-02-06 02:23:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11985 states to 11985 states and 19148 transitions. [2025-02-06 02:23:40,933 INFO L78 Accepts]: Start accepts. Automaton has 11985 states and 19148 transitions. Word has length 302 [2025-02-06 02:23:40,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:40,934 INFO L471 AbstractCegarLoop]: Abstraction has 11985 states and 19148 transitions. [2025-02-06 02:23:40,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand 11985 states and 19148 transitions. [2025-02-06 02:23:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:23:40,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:40,957 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:40,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:23:40,958 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:40,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1908529283, now seen corresponding path program 1 times [2025-02-06 02:23:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:40,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673730642] [2025-02-06 02:23:40,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:40,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:23:41,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:23:41,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:41,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:43,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:43,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673730642] [2025-02-06 02:23:43,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673730642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:43,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:43,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:23:43,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132711078] [2025-02-06 02:23:43,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:43,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:23:43,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:43,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:23:43,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:23:43,426 INFO L87 Difference]: Start difference. First operand 11985 states and 19148 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:44,629 INFO L93 Difference]: Finished difference Result 32319 states and 51331 transitions. [2025-02-06 02:23:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:23:44,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-02-06 02:23:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:44,687 INFO L225 Difference]: With dead ends: 32319 [2025-02-06 02:23:44,687 INFO L226 Difference]: Without dead ends: 20337 [2025-02-06 02:23:44,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:23:44,716 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 382 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:44,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1365 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:23:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20337 states. [2025-02-06 02:23:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20337 to 11985. [2025-02-06 02:23:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11985 states, 11692 states have (on average 1.593226137529935) internal successors, (18628), 11720 states have internal predecessors, (18628), 260 states have call successors, (260), 32 states have call predecessors, (260), 32 states have return successors, (260), 232 states have call predecessors, (260), 260 states have call successors, (260) [2025-02-06 02:23:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11985 states to 11985 states and 19148 transitions. [2025-02-06 02:23:45,085 INFO L78 Accepts]: Start accepts. Automaton has 11985 states and 19148 transitions. Word has length 302 [2025-02-06 02:23:45,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:45,086 INFO L471 AbstractCegarLoop]: Abstraction has 11985 states and 19148 transitions. [2025-02-06 02:23:45,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 11985 states and 19148 transitions. [2025-02-06 02:23:45,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:23:45,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:45,105 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:45,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:23:45,105 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:45,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:45,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1459832644, now seen corresponding path program 1 times [2025-02-06 02:23:45,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:45,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426484820] [2025-02-06 02:23:45,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:45,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:45,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:23:45,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:23:45,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:45,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:45,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:45,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426484820] [2025-02-06 02:23:45,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426484820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:45,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:45,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:23:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732148677] [2025-02-06 02:23:45,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:45,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:23:45,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:45,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:23:45,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:23:45,552 INFO L87 Difference]: Start difference. First operand 11985 states and 19148 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:46,015 INFO L93 Difference]: Finished difference Result 28811 states and 45419 transitions. [2025-02-06 02:23:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:23:46,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-02-06 02:23:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:46,058 INFO L225 Difference]: With dead ends: 28811 [2025-02-06 02:23:46,058 INFO L226 Difference]: Without dead ends: 16789 [2025-02-06 02:23:46,082 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:23:46,083 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 291 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:46,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 915 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:23:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16789 states. [2025-02-06 02:23:46,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16789 to 13765. [2025-02-06 02:23:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13765 states, 13472 states have (on average 1.5620546318289785) internal successors, (21044), 13500 states have internal predecessors, (21044), 260 states have call successors, (260), 32 states have call predecessors, (260), 32 states have return successors, (260), 232 states have call predecessors, (260), 260 states have call successors, (260) [2025-02-06 02:23:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13765 states to 13765 states and 21564 transitions. [2025-02-06 02:23:46,422 INFO L78 Accepts]: Start accepts. Automaton has 13765 states and 21564 transitions. Word has length 302 [2025-02-06 02:23:46,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:46,422 INFO L471 AbstractCegarLoop]: Abstraction has 13765 states and 21564 transitions. [2025-02-06 02:23:46,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 13765 states and 21564 transitions. [2025-02-06 02:23:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:23:46,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:46,443 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:46,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:23:46,444 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:46,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash -775401118, now seen corresponding path program 1 times [2025-02-06 02:23:46,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:46,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283386279] [2025-02-06 02:23:46,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:46,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:23:46,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:23:46,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:46,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:47,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:47,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283386279] [2025-02-06 02:23:47,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283386279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:47,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:47,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:23:47,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755937322] [2025-02-06 02:23:47,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:47,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:23:47,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:47,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:23:47,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:23:47,258 INFO L87 Difference]: Start difference. First operand 13765 states and 21564 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:47,917 INFO L93 Difference]: Finished difference Result 38201 states and 59842 transitions. [2025-02-06 02:23:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:23:47,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-02-06 02:23:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:47,977 INFO L225 Difference]: With dead ends: 38201 [2025-02-06 02:23:47,977 INFO L226 Difference]: Without dead ends: 24439 [2025-02-06 02:23:47,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:23:48,000 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 195 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:48,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1210 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:23:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24439 states. [2025-02-06 02:23:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24439 to 12749. [2025-02-06 02:23:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12749 states, 12456 states have (on average 1.5706486833654463) internal successors, (19564), 12484 states have internal predecessors, (19564), 260 states have call successors, (260), 32 states have call predecessors, (260), 32 states have return successors, (260), 232 states have call predecessors, (260), 260 states have call successors, (260) [2025-02-06 02:23:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12749 states to 12749 states and 20084 transitions. [2025-02-06 02:23:48,511 INFO L78 Accepts]: Start accepts. Automaton has 12749 states and 20084 transitions. Word has length 302 [2025-02-06 02:23:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:48,512 INFO L471 AbstractCegarLoop]: Abstraction has 12749 states and 20084 transitions. [2025-02-06 02:23:48,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 12749 states and 20084 transitions. [2025-02-06 02:23:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:23:48,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:48,534 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:48,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:23:48,534 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1756088248, now seen corresponding path program 1 times [2025-02-06 02:23:48,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:48,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704805290] [2025-02-06 02:23:48,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:48,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:48,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:23:48,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:23:48,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:48,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:48,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:48,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704805290] [2025-02-06 02:23:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704805290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:48,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:48,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:23:48,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948428143] [2025-02-06 02:23:48,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:48,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:23:48,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:48,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:23:48,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:23:48,676 INFO L87 Difference]: Start difference. First operand 12749 states and 20084 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:49,055 INFO L93 Difference]: Finished difference Result 27005 states and 42278 transitions. [2025-02-06 02:23:49,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:23:49,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-02-06 02:23:49,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:49,098 INFO L225 Difference]: With dead ends: 27005 [2025-02-06 02:23:49,099 INFO L226 Difference]: Without dead ends: 14259 [2025-02-06 02:23:49,118 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:23:49,120 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 177 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:49,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 676 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:23:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14259 states. [2025-02-06 02:23:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14259 to 11733. [2025-02-06 02:23:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11733 states, 11508 states have (on average 1.583594021550226) internal successors, (18224), 11520 states have internal predecessors, (18224), 204 states have call successors, (204), 20 states have call predecessors, (204), 20 states have return successors, (204), 192 states have call predecessors, (204), 204 states have call successors, (204) [2025-02-06 02:23:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11733 states to 11733 states and 18632 transitions. [2025-02-06 02:23:49,387 INFO L78 Accepts]: Start accepts. Automaton has 11733 states and 18632 transitions. Word has length 302 [2025-02-06 02:23:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:49,388 INFO L471 AbstractCegarLoop]: Abstraction has 11733 states and 18632 transitions. [2025-02-06 02:23:49,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 11733 states and 18632 transitions. [2025-02-06 02:23:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:23:49,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:49,400 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:49,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:23:49,400 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:49,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1641152038, now seen corresponding path program 1 times [2025-02-06 02:23:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:49,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933761994] [2025-02-06 02:23:49,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:49,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:49,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:23:49,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:23:49,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:49,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:50,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:50,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933761994] [2025-02-06 02:23:50,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933761994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:50,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:50,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:23:50,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038009938] [2025-02-06 02:23:50,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:50,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:23:50,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:50,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:23:50,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:23:50,759 INFO L87 Difference]: Start difference. First operand 11733 states and 18632 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:52,067 INFO L93 Difference]: Finished difference Result 31859 states and 50277 transitions. [2025-02-06 02:23:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:23:52,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-02-06 02:23:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:52,111 INFO L225 Difference]: With dead ends: 31859 [2025-02-06 02:23:52,111 INFO L226 Difference]: Without dead ends: 20129 [2025-02-06 02:23:52,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:23:52,134 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 555 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:52,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1720 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:23:52,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20129 states. [2025-02-06 02:23:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20129 to 12061. [2025-02-06 02:23:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12061 states, 11836 states have (on average 1.5839810746873944) internal successors, (18748), 11848 states have internal predecessors, (18748), 204 states have call successors, (204), 20 states have call predecessors, (204), 20 states have return successors, (204), 192 states have call predecessors, (204), 204 states have call successors, (204) [2025-02-06 02:23:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12061 states to 12061 states and 19156 transitions. [2025-02-06 02:23:52,409 INFO L78 Accepts]: Start accepts. Automaton has 12061 states and 19156 transitions. Word has length 302 [2025-02-06 02:23:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:52,410 INFO L471 AbstractCegarLoop]: Abstraction has 12061 states and 19156 transitions. [2025-02-06 02:23:52,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 12061 states and 19156 transitions. [2025-02-06 02:23:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:23:52,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:52,423 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:52,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:23:52,423 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:52,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:52,424 INFO L85 PathProgramCache]: Analyzing trace with hash 731394327, now seen corresponding path program 1 times [2025-02-06 02:23:52,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:52,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263034821] [2025-02-06 02:23:52,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:52,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:52,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:23:52,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:23:52,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:52,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:53,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:53,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263034821] [2025-02-06 02:23:53,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263034821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:53,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:53,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:23:53,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339985745] [2025-02-06 02:23:53,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:53,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:23:53,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:53,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:23:53,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:23:53,769 INFO L87 Difference]: Start difference. First operand 12061 states and 19156 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:56,282 INFO L93 Difference]: Finished difference Result 57437 states and 90065 transitions. [2025-02-06 02:23:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 02:23:56,283 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-02-06 02:23:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:56,359 INFO L225 Difference]: With dead ends: 57437 [2025-02-06 02:23:56,359 INFO L226 Difference]: Without dead ends: 45379 [2025-02-06 02:23:56,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:23:56,395 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 897 mSDsluCounter, 3115 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 3855 SdHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:56,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 3855 Invalid, 2423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 02:23:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45379 states. [2025-02-06 02:23:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45379 to 26681. [2025-02-06 02:23:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26681 states, 26232 states have (on average 1.5739554742299482) internal successors, (41288), 26256 states have internal predecessors, (41288), 408 states have call successors, (408), 40 states have call predecessors, (408), 40 states have return successors, (408), 384 states have call predecessors, (408), 408 states have call successors, (408) [2025-02-06 02:23:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26681 states to 26681 states and 42104 transitions. [2025-02-06 02:23:57,199 INFO L78 Accepts]: Start accepts. Automaton has 26681 states and 42104 transitions. Word has length 302 [2025-02-06 02:23:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:57,200 INFO L471 AbstractCegarLoop]: Abstraction has 26681 states and 42104 transitions. [2025-02-06 02:23:57,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 26681 states and 42104 transitions. [2025-02-06 02:23:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:23:57,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:57,218 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:57,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 02:23:57,218 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:57,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:57,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1104737502, now seen corresponding path program 1 times [2025-02-06 02:23:57,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:57,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874559481] [2025-02-06 02:23:57,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:57,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:57,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:23:57,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:23:57,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:57,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:57,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874559481] [2025-02-06 02:23:57,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874559481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:57,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:57,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:23:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226557804] [2025-02-06 02:23:57,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:57,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:23:57,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:57,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:23:57,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:23:57,331 INFO L87 Difference]: Start difference. First operand 26681 states and 42104 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:57,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:57,621 INFO L93 Difference]: Finished difference Result 55039 states and 86645 transitions. [2025-02-06 02:23:57,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:23:57,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-02-06 02:23:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:57,672 INFO L225 Difference]: With dead ends: 55039 [2025-02-06 02:23:57,672 INFO L226 Difference]: Without dead ends: 28361 [2025-02-06 02:23:57,711 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:23:57,712 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 121 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:57,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 582 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:23:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28361 states. [2025-02-06 02:23:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28361 to 26681. [2025-02-06 02:23:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26681 states, 26232 states have (on average 1.5736505032021957) internal successors, (41280), 26256 states have internal predecessors, (41280), 408 states have call successors, (408), 40 states have call predecessors, (408), 40 states have return successors, (408), 384 states have call predecessors, (408), 408 states have call successors, (408) [2025-02-06 02:23:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26681 states to 26681 states and 42096 transitions. [2025-02-06 02:23:58,234 INFO L78 Accepts]: Start accepts. Automaton has 26681 states and 42096 transitions. Word has length 302 [2025-02-06 02:23:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:58,235 INFO L471 AbstractCegarLoop]: Abstraction has 26681 states and 42096 transitions. [2025-02-06 02:23:58,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 26681 states and 42096 transitions. [2025-02-06 02:23:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:23:58,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:58,256 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:58,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 02:23:58,257 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:58,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1084400127, now seen corresponding path program 1 times [2025-02-06 02:23:58,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:58,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266919234] [2025-02-06 02:23:58,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:58,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:23:58,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:23:58,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:58,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:23:58,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:58,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266919234] [2025-02-06 02:23:58,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266919234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:58,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:58,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:23:58,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330244950] [2025-02-06 02:23:58,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:58,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:23:58,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:58,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:23:58,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:23:58,635 INFO L87 Difference]: Start difference. First operand 26681 states and 42096 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:58,998 INFO L93 Difference]: Finished difference Result 53301 states and 84022 transitions. [2025-02-06 02:23:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:23:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-02-06 02:23:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:59,048 INFO L225 Difference]: With dead ends: 53301 [2025-02-06 02:23:59,048 INFO L226 Difference]: Without dead ends: 26623 [2025-02-06 02:23:59,083 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:23:59,084 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 156 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:59,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 681 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:23:59,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26623 states. [2025-02-06 02:23:59,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26623 to 24521. [2025-02-06 02:23:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24521 states, 24128 states have (on average 1.5633289124668435) internal successors, (37720), 24136 states have internal predecessors, (37720), 360 states have call successors, (360), 32 states have call predecessors, (360), 32 states have return successors, (360), 352 states have call predecessors, (360), 360 states have call successors, (360) [2025-02-06 02:23:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24521 states to 24521 states and 38440 transitions. [2025-02-06 02:23:59,680 INFO L78 Accepts]: Start accepts. Automaton has 24521 states and 38440 transitions. Word has length 302 [2025-02-06 02:23:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:59,681 INFO L471 AbstractCegarLoop]: Abstraction has 24521 states and 38440 transitions. [2025-02-06 02:23:59,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:23:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 24521 states and 38440 transitions. [2025-02-06 02:23:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:23:59,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:59,702 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:59,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 02:23:59,702 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:59,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:59,703 INFO L85 PathProgramCache]: Analyzing trace with hash 678628476, now seen corresponding path program 1 times [2025-02-06 02:23:59,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:59,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795394297] [2025-02-06 02:23:59,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:59,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:59,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:23:59,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:23:59,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:59,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:24:01,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:01,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795394297] [2025-02-06 02:24:01,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795394297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:01,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:01,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:24:01,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509449721] [2025-02-06 02:24:01,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:01,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:24:01,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:01,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:24:01,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:24:01,385 INFO L87 Difference]: Start difference. First operand 24521 states and 38440 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:24:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:04,589 INFO L93 Difference]: Finished difference Result 69625 states and 108438 transitions. [2025-02-06 02:24:04,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 02:24:04,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-02-06 02:24:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:04,671 INFO L225 Difference]: With dead ends: 69625 [2025-02-06 02:24:04,671 INFO L226 Difference]: Without dead ends: 45107 [2025-02-06 02:24:04,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:24:04,708 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 457 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 3812 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:04,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 3812 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 02:24:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45107 states. [2025-02-06 02:24:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45107 to 24961. [2025-02-06 02:24:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24961 states, 24568 states have (on average 1.5654509931618366) internal successors, (38460), 24576 states have internal predecessors, (38460), 360 states have call successors, (360), 32 states have call predecessors, (360), 32 states have return successors, (360), 352 states have call predecessors, (360), 360 states have call successors, (360) [2025-02-06 02:24:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24961 states to 24961 states and 39180 transitions. [2025-02-06 02:24:05,477 INFO L78 Accepts]: Start accepts. Automaton has 24961 states and 39180 transitions. Word has length 302 [2025-02-06 02:24:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:05,478 INFO L471 AbstractCegarLoop]: Abstraction has 24961 states and 39180 transitions. [2025-02-06 02:24:05,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:24:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 24961 states and 39180 transitions. [2025-02-06 02:24:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:24:05,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:05,502 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:05,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 02:24:05,502 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:05,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:05,503 INFO L85 PathProgramCache]: Analyzing trace with hash -228460167, now seen corresponding path program 1 times [2025-02-06 02:24:05,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:05,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091557784] [2025-02-06 02:24:05,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:05,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:05,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:05,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:05,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:05,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 6 proven. 120 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:24:06,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:06,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091557784] [2025-02-06 02:24:06,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091557784] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:06,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177273628] [2025-02-06 02:24:06,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:06,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:06,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:24:06,125 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:24:06,127 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:24:06,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:06,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:06,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:06,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:06,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:24:06,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:24:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 658 proven. 114 refuted. 0 times theorem prover too weak. 2840 trivial. 0 not checked. [2025-02-06 02:24:06,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:24:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 12 proven. 114 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:24:06,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177273628] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:24:06,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:24:06,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 02:24:06,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182337801] [2025-02-06 02:24:06,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:24:06,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:24:06,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:06,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:24:06,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:24:06,995 INFO L87 Difference]: Start difference. First operand 24961 states and 39180 transitions. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 3 states have call successors, (121), 2 states have call predecessors, (121), 4 states have return successors, (123), 3 states have call predecessors, (123), 3 states have call successors, (123) [2025-02-06 02:24:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:07,495 INFO L93 Difference]: Finished difference Result 33147 states and 52228 transitions. [2025-02-06 02:24:07,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 02:24:07,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 3 states have call successors, (121), 2 states have call predecessors, (121), 4 states have return successors, (123), 3 states have call predecessors, (123), 3 states have call successors, (123) Word has length 303 [2025-02-06 02:24:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:07,512 INFO L225 Difference]: With dead ends: 33147 [2025-02-06 02:24:07,512 INFO L226 Difference]: Without dead ends: 8189 [2025-02-06 02:24:07,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 603 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:24:07,540 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 355 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:07,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 572 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:24:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8189 states. [2025-02-06 02:24:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8189 to 8172. [2025-02-06 02:24:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8172 states, 7756 states have (on average 1.5546673543063434) internal successors, (12058), 7765 states have internal predecessors, (12058), 364 states have call successors, (364), 51 states have call predecessors, (364), 51 states have return successors, (364), 355 states have call predecessors, (364), 364 states have call successors, (364) [2025-02-06 02:24:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8172 states to 8172 states and 12786 transitions. [2025-02-06 02:24:07,927 INFO L78 Accepts]: Start accepts. Automaton has 8172 states and 12786 transitions. Word has length 303 [2025-02-06 02:24:07,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:07,927 INFO L471 AbstractCegarLoop]: Abstraction has 8172 states and 12786 transitions. [2025-02-06 02:24:07,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 3 states have call successors, (121), 2 states have call predecessors, (121), 4 states have return successors, (123), 3 states have call predecessors, (123), 3 states have call successors, (123) [2025-02-06 02:24:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 8172 states and 12786 transitions. [2025-02-06 02:24:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:24:07,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:07,932 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:07,940 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:24:08,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:08,133 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:08,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash -224455241, now seen corresponding path program 1 times [2025-02-06 02:24:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768447848] [2025-02-06 02:24:08,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:08,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:08,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:08,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:08,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:24:08,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:08,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768447848] [2025-02-06 02:24:08,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768447848] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:08,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977260407] [2025-02-06 02:24:08,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:08,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:08,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:24:08,532 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:24:08,535 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:24:08,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:08,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:08,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:08,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:08,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:24:08,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:24:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 918 proven. 108 refuted. 0 times theorem prover too weak. 2586 trivial. 0 not checked. [2025-02-06 02:24:09,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:24:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:24:09,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977260407] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:24:09,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:24:09,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 02:24:09,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938107631] [2025-02-06 02:24:09,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:24:09,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:24:09,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:09,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:24:09,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:24:09,355 INFO L87 Difference]: Start difference. First operand 8172 states and 12786 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-06 02:24:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:09,781 INFO L93 Difference]: Finished difference Result 13760 states and 21363 transitions. [2025-02-06 02:24:09,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:24:09,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 303 [2025-02-06 02:24:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:09,792 INFO L225 Difference]: With dead ends: 13760 [2025-02-06 02:24:09,792 INFO L226 Difference]: Without dead ends: 5610 [2025-02-06 02:24:09,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 603 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:24:09,802 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 166 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:09,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 615 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:24:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2025-02-06 02:24:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 5404. [2025-02-06 02:24:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5404 states, 4980 states have (on average 1.5180722891566265) internal successors, (7560), 4989 states have internal predecessors, (7560), 364 states have call successors, (364), 59 states have call predecessors, (364), 59 states have return successors, (364), 355 states have call predecessors, (364), 364 states have call successors, (364) [2025-02-06 02:24:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 8288 transitions. [2025-02-06 02:24:10,082 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 8288 transitions. Word has length 303 [2025-02-06 02:24:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:10,082 INFO L471 AbstractCegarLoop]: Abstraction has 5404 states and 8288 transitions. [2025-02-06 02:24:10,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-06 02:24:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 8288 transitions. [2025-02-06 02:24:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:24:10,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:10,089 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:10,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 02:24:10,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:10,289 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:10,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1835278293, now seen corresponding path program 1 times [2025-02-06 02:24:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:10,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559208454] [2025-02-06 02:24:10,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:10,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:10,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:10,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:10,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:10,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:24:10,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:10,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559208454] [2025-02-06 02:24:10,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559208454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:10,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:10,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:24:10,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507205319] [2025-02-06 02:24:10,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:10,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:24:10,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:10,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:24:10,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:24:10,622 INFO L87 Difference]: Start difference. First operand 5404 states and 8288 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:24:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:11,149 INFO L93 Difference]: Finished difference Result 13043 states and 20053 transitions. [2025-02-06 02:24:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:24:11,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 303 [2025-02-06 02:24:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:11,164 INFO L225 Difference]: With dead ends: 13043 [2025-02-06 02:24:11,164 INFO L226 Difference]: Without dead ends: 7661 [2025-02-06 02:24:11,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:24:11,172 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 299 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:11,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1096 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:24:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7661 states. [2025-02-06 02:24:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7661 to 5788. [2025-02-06 02:24:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5788 states, 5364 states have (on average 1.5257270693512304) internal successors, (8184), 5373 states have internal predecessors, (8184), 364 states have call successors, (364), 59 states have call predecessors, (364), 59 states have return successors, (364), 355 states have call predecessors, (364), 364 states have call successors, (364) [2025-02-06 02:24:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5788 states to 5788 states and 8912 transitions. [2025-02-06 02:24:11,569 INFO L78 Accepts]: Start accepts. Automaton has 5788 states and 8912 transitions. Word has length 303 [2025-02-06 02:24:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:11,570 INFO L471 AbstractCegarLoop]: Abstraction has 5788 states and 8912 transitions. [2025-02-06 02:24:11,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:24:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 5788 states and 8912 transitions. [2025-02-06 02:24:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:24:11,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:11,577 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:11,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 02:24:11,577 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:11,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:11,578 INFO L85 PathProgramCache]: Analyzing trace with hash -174825548, now seen corresponding path program 1 times [2025-02-06 02:24:11,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:11,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130868763] [2025-02-06 02:24:11,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:11,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:11,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:11,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:11,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:11,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 33 proven. 93 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:24:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:13,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130868763] [2025-02-06 02:24:13,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130868763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:13,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166852483] [2025-02-06 02:24:13,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:13,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:13,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:24:13,016 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:24:13,017 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:24:13,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:13,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:13,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:13,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:13,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 02:24:13,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:24:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1986 proven. 246 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2025-02-06 02:24:14,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:24:15,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166852483] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:15,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:24:15,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2025-02-06 02:24:15,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313879661] [2025-02-06 02:24:15,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:24:15,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 02:24:15,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:15,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 02:24:15,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-02-06 02:24:15,629 INFO L87 Difference]: Start difference. First operand 5788 states and 8912 transitions. Second operand has 23 states, 23 states have (on average 8.0) internal successors, (184), 22 states have internal predecessors, (184), 8 states have call successors, (86), 5 states have call predecessors, (86), 8 states have return successors, (86), 8 states have call predecessors, (86), 8 states have call successors, (86) [2025-02-06 02:24:20,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:20,286 INFO L93 Difference]: Finished difference Result 37193 states and 56283 transitions. [2025-02-06 02:24:20,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-06 02:24:20,287 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.0) internal successors, (184), 22 states have internal predecessors, (184), 8 states have call successors, (86), 5 states have call predecessors, (86), 8 states have return successors, (86), 8 states have call predecessors, (86), 8 states have call successors, (86) Word has length 303 [2025-02-06 02:24:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:20,343 INFO L225 Difference]: With dead ends: 37193 [2025-02-06 02:24:20,343 INFO L226 Difference]: Without dead ends: 31427 [2025-02-06 02:24:20,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=801, Invalid=3359, Unknown=0, NotChecked=0, Total=4160 [2025-02-06 02:24:20,359 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 2226 mSDsluCounter, 4284 mSDsCounter, 0 mSdLazyCounter, 3204 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2248 SdHoareTripleChecker+Valid, 4557 SdHoareTripleChecker+Invalid, 3618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 3204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:20,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2248 Valid, 4557 Invalid, 3618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 3204 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-06 02:24:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31427 states. [2025-02-06 02:24:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31427 to 22515. [2025-02-06 02:24:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22515 states, 21179 states have (on average 1.507294961990651) internal successors, (31923), 21224 states have internal predecessors, (31923), 1060 states have call successors, (1060), 275 states have call predecessors, (1060), 275 states have return successors, (1060), 1015 states have call predecessors, (1060), 1060 states have call successors, (1060) [2025-02-06 02:24:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22515 states to 22515 states and 34043 transitions. [2025-02-06 02:24:21,477 INFO L78 Accepts]: Start accepts. Automaton has 22515 states and 34043 transitions. Word has length 303 [2025-02-06 02:24:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:21,477 INFO L471 AbstractCegarLoop]: Abstraction has 22515 states and 34043 transitions. [2025-02-06 02:24:21,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.0) internal successors, (184), 22 states have internal predecessors, (184), 8 states have call successors, (86), 5 states have call predecessors, (86), 8 states have return successors, (86), 8 states have call predecessors, (86), 8 states have call successors, (86) [2025-02-06 02:24:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 22515 states and 34043 transitions. [2025-02-06 02:24:21,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:24:21,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:21,492 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:21,503 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:24:21,692 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,SelfDestructingSolverStorable24 [2025-02-06 02:24:21,692 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:21,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1408563629, now seen corresponding path program 1 times [2025-02-06 02:24:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:21,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68805530] [2025-02-06 02:24:21,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:21,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:21,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:21,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:21,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:21,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:24:21,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:21,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68805530] [2025-02-06 02:24:21,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68805530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:21,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:21,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:24:21,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117054340] [2025-02-06 02:24:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:21,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:24:21,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:21,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:24:21,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:24:21,790 INFO L87 Difference]: Start difference. First operand 22515 states and 34043 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:24:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:22,440 INFO L93 Difference]: Finished difference Result 25427 states and 38542 transitions. [2025-02-06 02:24:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:24:22,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 303 [2025-02-06 02:24:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:22,491 INFO L225 Difference]: With dead ends: 25427 [2025-02-06 02:24:22,492 INFO L226 Difference]: Without dead ends: 22535 [2025-02-06 02:24:22,505 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:24:22,506 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:22,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 551 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:24:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22535 states.