./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-98.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-98.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 29660a505d12db16cb6ebaa6d023074ab3483b7ffc3518a7c288ecb4d9bcecec --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:24:16,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:24:16,833 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:24:16,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:24:16,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:24:16,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:24:16,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:24:16,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:24:16,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:24:16,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:24:16,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:24:16,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:24:16,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:24:16,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:24:16,857 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:24:16,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:24:16,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:24:16,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:24:16,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:24:16,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:24:16,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:24:16,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:24:16,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:24:16,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:24:16,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:24:16,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:24:16,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:24:16,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:24:16,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:24:16,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:24:16,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:24:16,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:24:16,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:24:16,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:24:16,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:24:16,860 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:24:16,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:24:16,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:24:16,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:24:16,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:24:16,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:24:16,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:24:16,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:24:16,861 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 -> 29660a505d12db16cb6ebaa6d023074ab3483b7ffc3518a7c288ecb4d9bcecec [2025-02-06 02:24:17,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:24:17,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:24:17,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:24:17,135 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:24:17,135 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:24:17,136 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-98.i [2025-02-06 02:24:18,466 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4590955ec/2261cfe03215470fa9e4377123c1768d/FLAG20586857c [2025-02-06 02:24:18,760 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:24:18,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-98.i [2025-02-06 02:24:18,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4590955ec/2261cfe03215470fa9e4377123c1768d/FLAG20586857c [2025-02-06 02:24:19,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4590955ec/2261cfe03215470fa9e4377123c1768d [2025-02-06 02:24:19,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:24:19,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:24:19,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:24:19,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:24:19,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:24:19,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:24:19" (1/1) ... [2025-02-06 02:24:19,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9e4b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19, skipping insertion in model container [2025-02-06 02:24:19,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:24:19" (1/1) ... [2025-02-06 02:24:19,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:24:19,204 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-98.i[916,929] [2025-02-06 02:24:19,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:24:19,327 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:24:19,338 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-98.i[916,929] [2025-02-06 02:24:19,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:24:19,443 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:24:19,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19 WrapperNode [2025-02-06 02:24:19,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:24:19,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:24:19,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:24:19,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:24:19,451 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:24:19" (1/1) ... [2025-02-06 02:24:19,474 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:24:19" (1/1) ... [2025-02-06 02:24:19,530 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2025-02-06 02:24:19,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:24:19,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:24:19,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:24:19,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:24:19,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19" (1/1) ... [2025-02-06 02:24:19,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19" (1/1) ... [2025-02-06 02:24:19,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19" (1/1) ... [2025-02-06 02:24:19,595 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:24:19,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19" (1/1) ... [2025-02-06 02:24:19,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19" (1/1) ... [2025-02-06 02:24:19,616 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19" (1/1) ... [2025-02-06 02:24:19,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19" (1/1) ... [2025-02-06 02:24:19,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19" (1/1) ... [2025-02-06 02:24:19,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19" (1/1) ... [2025-02-06 02:24:19,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:24:19,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:24:19,650 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:24:19,650 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:24:19,651 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19" (1/1) ... [2025-02-06 02:24:19,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:24:19,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:24:19,681 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:24:19,684 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:24:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:24:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:24:19,708 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:24:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:24:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:24:19,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:24:19,808 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:24:19,810 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:24:20,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L352: havoc property_#t~ite36#1;havoc property_#t~ite35#1;havoc property_#t~ite34#1;havoc property_#t~bitwise33#1;havoc property_#t~short37#1;havoc property_#t~ite39#1;havoc property_#t~bitwise38#1;havoc property_#t~short40#1;havoc property_#t~bitwise41#1;havoc property_#t~short42#1;havoc property_#t~ite44#1;havoc property_#t~bitwise43#1;havoc property_#t~short45#1;havoc property_#t~ite47#1;havoc property_#t~bitwise46#1;havoc property_#t~short48#1; [2025-02-06 02:24:20,799 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2025-02-06 02:24:20,799 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:24:20,835 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:24:20,836 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:24:20,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:24:20 BoogieIcfgContainer [2025-02-06 02:24:20,839 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:24:20,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:24:20,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:24:20,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:24:20,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:24:19" (1/3) ... [2025-02-06 02:24:20,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1677e3f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:24:20, skipping insertion in model container [2025-02-06 02:24:20,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:24:19" (2/3) ... [2025-02-06 02:24:20,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1677e3f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:24:20, skipping insertion in model container [2025-02-06 02:24:20,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:24:20" (3/3) ... [2025-02-06 02:24:20,850 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-98.i [2025-02-06 02:24:20,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:24:20,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-98.i that has 2 procedures, 199 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:24:20,927 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:24:20,939 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;@783d7bad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:24:20,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:24:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 199 states, 153 states have (on average 1.522875816993464) internal successors, (233), 154 states have internal predecessors, (233), 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:24:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-02-06 02:24:20,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:20,967 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] [2025-02-06 02:24:20,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:20,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash -619414157, now seen corresponding path program 1 times [2025-02-06 02:24:20,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:20,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943915105] [2025-02-06 02:24:20,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:20,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:21,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-06 02:24:21,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-06 02:24:21,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:21,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:21,497 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:24:21,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:21,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943915105] [2025-02-06 02:24:21,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943915105] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:21,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918941867] [2025-02-06 02:24:21,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:21,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:21,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:24:21,502 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:24:21,503 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:24:21,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-06 02:24:21,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-06 02:24:21,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:21,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:21,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:24:21,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:24:21,812 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:24:21,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:24:21,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918941867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:21,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:24:21,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:24:21,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260899874] [2025-02-06 02:24:21,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:21,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:24:21,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:21,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:24:21,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:24:21,839 INFO L87 Difference]: Start difference. First operand has 199 states, 153 states have (on average 1.522875816993464) internal successors, (233), 154 states have internal predecessors, (233), 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 42.0) internal successors, (84), 2 states have internal predecessors, (84), 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:24:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:21,930 INFO L93 Difference]: Finished difference Result 392 states and 676 transitions. [2025-02-06 02:24:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:24:21,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 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 294 [2025-02-06 02:24:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:21,947 INFO L225 Difference]: With dead ends: 392 [2025-02-06 02:24:21,947 INFO L226 Difference]: Without dead ends: 196 [2025-02-06 02:24:21,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 295 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:24:21,959 INFO L435 NwaCegarLoop]: 304 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, 304 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:24:21,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:24:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-06 02:24:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-06 02:24:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 151 states have (on average 1.509933774834437) internal successors, (228), 151 states have internal predecessors, (228), 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:24:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 314 transitions. [2025-02-06 02:24:22,028 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 314 transitions. Word has length 294 [2025-02-06 02:24:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:22,028 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 314 transitions. [2025-02-06 02:24:22,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 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:24:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 314 transitions. [2025-02-06 02:24:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-02-06 02:24:22,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:22,037 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] [2025-02-06 02:24:22,048 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:24:22,242 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:24:22,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:22,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1080797106, now seen corresponding path program 1 times [2025-02-06 02:24:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:22,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597355634] [2025-02-06 02:24:22,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:22,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:22,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-06 02:24:22,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-06 02:24:22,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:22,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:23,345 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:23,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:23,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597355634] [2025-02-06 02:24:23,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597355634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:23,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:23,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:24:23,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52568700] [2025-02-06 02:24:23,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:23,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:24:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:23,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:24:23,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:24:23,352 INFO L87 Difference]: Start difference. First operand 196 states and 314 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:23,679 INFO L93 Difference]: Finished difference Result 583 states and 937 transitions. [2025-02-06 02:24:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:24:23,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 294 [2025-02-06 02:24:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:23,685 INFO L225 Difference]: With dead ends: 583 [2025-02-06 02:24:23,685 INFO L226 Difference]: Without dead ends: 390 [2025-02-06 02:24:23,686 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:24:23,687 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 233 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:23,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 892 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:24:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-06 02:24:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 272. [2025-02-06 02:24:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 183 states have (on average 1.4316939890710383) internal successors, (262), 183 states have internal predecessors, (262), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-06 02:24:23,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 434 transitions. [2025-02-06 02:24:23,747 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 434 transitions. Word has length 294 [2025-02-06 02:24:23,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:23,748 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 434 transitions. [2025-02-06 02:24:23,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 434 transitions. [2025-02-06 02:24:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-02-06 02:24:23,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:23,753 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] [2025-02-06 02:24:23,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:24:23,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:23,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:23,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1088556465, now seen corresponding path program 1 times [2025-02-06 02:24:23,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:23,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64577984] [2025-02-06 02:24:23,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:23,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:23,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-06 02:24:23,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-06 02:24:23,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:23,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:24,384 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:24,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:24,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64577984] [2025-02-06 02:24:24,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64577984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:24,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:24,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:24:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608630923] [2025-02-06 02:24:24,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:24,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:24:24,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:24,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:24:24,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:24:24,387 INFO L87 Difference]: Start difference. First operand 272 states and 434 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:24,785 INFO L93 Difference]: Finished difference Result 742 states and 1183 transitions. [2025-02-06 02:24:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:24:24,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 294 [2025-02-06 02:24:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:24,793 INFO L225 Difference]: With dead ends: 742 [2025-02-06 02:24:24,794 INFO L226 Difference]: Without dead ends: 549 [2025-02-06 02:24:24,796 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:24:24,797 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 539 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:24,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1118 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:24:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-06 02:24:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 466. [2025-02-06 02:24:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 352 states have (on average 1.5056818181818181) internal successors, (530), 353 states have internal predecessors, (530), 109 states have call successors, (109), 4 states have call predecessors, (109), 4 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-06 02:24:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 748 transitions. [2025-02-06 02:24:24,858 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 748 transitions. Word has length 294 [2025-02-06 02:24:24,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:24,859 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 748 transitions. [2025-02-06 02:24:24,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 748 transitions. [2025-02-06 02:24:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-02-06 02:24:24,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:24,864 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] [2025-02-06 02:24:24,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:24:24,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:24,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:24,865 INFO L85 PathProgramCache]: Analyzing trace with hash -847103822, now seen corresponding path program 1 times [2025-02-06 02:24:24,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:24,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221904627] [2025-02-06 02:24:24,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:24,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:24,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-06 02:24:24,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-06 02:24:24,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:24,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:25,558 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:25,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:25,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221904627] [2025-02-06 02:24:25,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221904627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:25,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:25,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:24:25,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283506508] [2025-02-06 02:24:25,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:25,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:24:25,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:25,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:24:25,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:24:25,561 INFO L87 Difference]: Start difference. First operand 466 states and 748 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:26,069 INFO L93 Difference]: Finished difference Result 1483 states and 2403 transitions. [2025-02-06 02:24:26,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:24:26,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 294 [2025-02-06 02:24:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:26,084 INFO L225 Difference]: With dead ends: 1483 [2025-02-06 02:24:26,084 INFO L226 Difference]: Without dead ends: 1100 [2025-02-06 02:24:26,086 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:24:26,088 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 368 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:26,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 785 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:24:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2025-02-06 02:24:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1052. [2025-02-06 02:24:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 870 states have (on average 1.5632183908045978) internal successors, (1360), 872 states have internal predecessors, (1360), 175 states have call successors, (175), 6 states have call predecessors, (175), 6 states have return successors, (175), 173 states have call predecessors, (175), 175 states have call successors, (175) [2025-02-06 02:24:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1710 transitions. [2025-02-06 02:24:26,226 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1710 transitions. Word has length 294 [2025-02-06 02:24:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:26,230 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1710 transitions. [2025-02-06 02:24:26,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1710 transitions. [2025-02-06 02:24:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-06 02:24:26,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:26,237 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] [2025-02-06 02:24:26,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:24:26,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:26,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:26,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2051322031, now seen corresponding path program 1 times [2025-02-06 02:24:26,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:26,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48482071] [2025-02-06 02:24:26,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:26,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:26,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-06 02:24:26,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-06 02:24:26,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:26,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:28,103 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:28,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:28,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48482071] [2025-02-06 02:24:28,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48482071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:28,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:28,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:24:28,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898193786] [2025-02-06 02:24:28,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:28,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:24:28,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:28,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:24:28,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:24:28,106 INFO L87 Difference]: Start difference. First operand 1052 states and 1710 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:29,006 INFO L93 Difference]: Finished difference Result 2021 states and 3294 transitions. [2025-02-06 02:24:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:24:29,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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 295 [2025-02-06 02:24:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:29,016 INFO L225 Difference]: With dead ends: 2021 [2025-02-06 02:24:29,017 INFO L226 Difference]: Without dead ends: 1052 [2025-02-06 02:24:29,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:24:29,023 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 277 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:29,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 526 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:24:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-02-06 02:24:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2025-02-06 02:24:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 870 states have (on average 1.5528735632183908) internal successors, (1351), 872 states have internal predecessors, (1351), 175 states have call successors, (175), 6 states have call predecessors, (175), 6 states have return successors, (175), 173 states have call predecessors, (175), 175 states have call successors, (175) [2025-02-06 02:24:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1701 transitions. [2025-02-06 02:24:29,140 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1701 transitions. Word has length 295 [2025-02-06 02:24:29,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:29,140 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1701 transitions. [2025-02-06 02:24:29,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1701 transitions. [2025-02-06 02:24:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 02:24:29,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:29,149 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] [2025-02-06 02:24:29,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:24:29,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:29,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:29,155 INFO L85 PathProgramCache]: Analyzing trace with hash -687604689, now seen corresponding path program 1 times [2025-02-06 02:24:29,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:29,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778674605] [2025-02-06 02:24:29,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:29,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:29,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 02:24:29,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 02:24:29,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:29,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:30,703 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:30,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:30,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778674605] [2025-02-06 02:24:30,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778674605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:30,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:30,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:24:30,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181706294] [2025-02-06 02:24:30,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:30,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:24:30,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:30,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:24:30,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:24:30,706 INFO L87 Difference]: Start difference. First operand 1052 states and 1701 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-02-06 02:24:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:32,685 INFO L93 Difference]: Finished difference Result 3807 states and 6068 transitions. [2025-02-06 02:24:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:24:32,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 297 [2025-02-06 02:24:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:32,701 INFO L225 Difference]: With dead ends: 3807 [2025-02-06 02:24:32,701 INFO L226 Difference]: Without dead ends: 2838 [2025-02-06 02:24:32,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:24:32,706 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 892 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:32,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1536 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 02:24:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2025-02-06 02:24:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2820. [2025-02-06 02:24:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2486 states have (on average 1.5446500402252614) internal successors, (3840), 2500 states have internal predecessors, (3840), 315 states have call successors, (315), 18 states have call predecessors, (315), 18 states have return successors, (315), 301 states have call predecessors, (315), 315 states have call successors, (315) [2025-02-06 02:24:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4470 transitions. [2025-02-06 02:24:32,911 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4470 transitions. Word has length 297 [2025-02-06 02:24:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:32,912 INFO L471 AbstractCegarLoop]: Abstraction has 2820 states and 4470 transitions. [2025-02-06 02:24:32,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-02-06 02:24:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4470 transitions. [2025-02-06 02:24:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 02:24:32,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:32,922 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] [2025-02-06 02:24:32,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:24:32,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:32,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:32,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1627665583, now seen corresponding path program 1 times [2025-02-06 02:24:32,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:32,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817706073] [2025-02-06 02:24:32,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:32,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 02:24:33,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 02:24:33,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:33,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:33,552 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:33,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:33,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817706073] [2025-02-06 02:24:33,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817706073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:33,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:33,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:24:33,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79307728] [2025-02-06 02:24:33,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:33,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:24:33,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:33,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:24:33,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:24:33,555 INFO L87 Difference]: Start difference. First operand 2820 states and 4470 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-02-06 02:24:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:34,682 INFO L93 Difference]: Finished difference Result 5920 states and 9352 transitions. [2025-02-06 02:24:34,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:24:34,683 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 297 [2025-02-06 02:24:34,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:34,703 INFO L225 Difference]: With dead ends: 5920 [2025-02-06 02:24:34,704 INFO L226 Difference]: Without dead ends: 3183 [2025-02-06 02:24:34,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:24:34,711 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 704 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:34,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1746 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:24:34,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2025-02-06 02:24:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3065. [2025-02-06 02:24:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3065 states, 2708 states have (on average 1.534711964549483) internal successors, (4156), 2723 states have internal predecessors, (4156), 336 states have call successors, (336), 20 states have call predecessors, (336), 20 states have return successors, (336), 321 states have call predecessors, (336), 336 states have call successors, (336) [2025-02-06 02:24:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4828 transitions. [2025-02-06 02:24:34,922 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4828 transitions. Word has length 297 [2025-02-06 02:24:34,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:34,923 INFO L471 AbstractCegarLoop]: Abstraction has 3065 states and 4828 transitions. [2025-02-06 02:24:34,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-02-06 02:24:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4828 transitions. [2025-02-06 02:24:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 02:24:34,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:34,931 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] [2025-02-06 02:24:34,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:24:34,932 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:34,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash 281976334, now seen corresponding path program 1 times [2025-02-06 02:24:34,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:34,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979320818] [2025-02-06 02:24:34,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:34,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 02:24:35,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 02:24:35,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:35,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:35,471 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:35,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:35,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979320818] [2025-02-06 02:24:35,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979320818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:35,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:35,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:24:35,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965330445] [2025-02-06 02:24:35,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:35,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:24:35,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:35,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:24:35,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:24:35,475 INFO L87 Difference]: Start difference. First operand 3065 states and 4828 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:35,869 INFO L93 Difference]: Finished difference Result 7419 states and 11615 transitions. [2025-02-06 02:24:35,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:24:35,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 297 [2025-02-06 02:24:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:35,900 INFO L225 Difference]: With dead ends: 7419 [2025-02-06 02:24:35,901 INFO L226 Difference]: Without dead ends: 4437 [2025-02-06 02:24:35,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:24:35,910 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 166 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:35,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1117 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:24:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4437 states. [2025-02-06 02:24:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4437 to 3383. [2025-02-06 02:24:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3383 states, 3025 states have (on average 1.5464462809917356) internal successors, (4678), 3040 states have internal predecessors, (4678), 336 states have call successors, (336), 21 states have call predecessors, (336), 21 states have return successors, (336), 321 states have call predecessors, (336), 336 states have call successors, (336) [2025-02-06 02:24:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 5350 transitions. [2025-02-06 02:24:36,167 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 5350 transitions. Word has length 297 [2025-02-06 02:24:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:36,168 INFO L471 AbstractCegarLoop]: Abstraction has 3383 states and 5350 transitions. [2025-02-06 02:24:36,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:36,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 5350 transitions. [2025-02-06 02:24:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-06 02:24:36,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:36,178 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:24:36,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:24:36,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:36,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash -183478485, now seen corresponding path program 1 times [2025-02-06 02:24:36,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:36,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880342947] [2025-02-06 02:24:36,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:36,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:36,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 02:24:36,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 02:24:36,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:36,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:36,953 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:36,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:36,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880342947] [2025-02-06 02:24:36,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880342947] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:36,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140636994] [2025-02-06 02:24:36,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:36,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:36,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:24:36,957 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:36,960 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:37,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 02:24:37,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 02:24:37,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:37,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:37,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:24:37,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:24:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2247 proven. 63 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2025-02-06 02:24:37,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:24:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 63 proven. 63 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:24:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140636994] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:24:38,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:24:38,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-06 02:24:38,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324730893] [2025-02-06 02:24:38,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:24:38,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 02:24:38,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:38,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 02:24:38,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:24:38,427 INFO L87 Difference]: Start difference. First operand 3383 states and 5350 transitions. Second operand has 14 states, 14 states have (on average 15.571428571428571) internal successors, (218), 14 states have internal predecessors, (218), 7 states have call successors, (122), 3 states have call predecessors, (122), 6 states have return successors, (122), 7 states have call predecessors, (122), 7 states have call successors, (122) [2025-02-06 02:24:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:39,827 INFO L93 Difference]: Finished difference Result 6067 states and 9594 transitions. [2025-02-06 02:24:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 02:24:39,828 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.571428571428571) internal successors, (218), 14 states have internal predecessors, (218), 7 states have call successors, (122), 3 states have call predecessors, (122), 6 states have return successors, (122), 7 states have call predecessors, (122), 7 states have call successors, (122) Word has length 298 [2025-02-06 02:24:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:39,845 INFO L225 Difference]: With dead ends: 6067 [2025-02-06 02:24:39,845 INFO L226 Difference]: Without dead ends: 2771 [2025-02-06 02:24:39,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2025-02-06 02:24:39,852 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 1730 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:39,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 1027 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:24:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2025-02-06 02:24:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2268. [2025-02-06 02:24:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2268 states, 1927 states have (on average 1.4992215879605604) internal successors, (2889), 1940 states have internal predecessors, (2889), 308 states have call successors, (308), 32 states have call predecessors, (308), 32 states have return successors, (308), 295 states have call predecessors, (308), 308 states have call successors, (308) [2025-02-06 02:24:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 3505 transitions. [2025-02-06 02:24:40,021 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 3505 transitions. Word has length 298 [2025-02-06 02:24:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:40,022 INFO L471 AbstractCegarLoop]: Abstraction has 2268 states and 3505 transitions. [2025-02-06 02:24:40,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.571428571428571) internal successors, (218), 14 states have internal predecessors, (218), 7 states have call successors, (122), 3 states have call predecessors, (122), 6 states have return successors, (122), 7 states have call predecessors, (122), 7 states have call successors, (122) [2025-02-06 02:24:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 3505 transitions. [2025-02-06 02:24:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:24:40,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:40,028 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:24:40,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:24:40,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:40,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:40,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:40,233 INFO L85 PathProgramCache]: Analyzing trace with hash 463566224, now seen corresponding path program 1 times [2025-02-06 02:24:40,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:40,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621879279] [2025-02-06 02:24:40,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:40,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:40,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:24:40,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:24:40,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:40,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 9 proven. 117 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:24:41,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:41,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621879279] [2025-02-06 02:24:41,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621879279] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:41,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545348390] [2025-02-06 02:24:41,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:41,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:41,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:24:41,057 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:41,060 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:41,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:24:41,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:24:41,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:41,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:41,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:24:41,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:24:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1836 proven. 57 refuted. 0 times theorem prover too weak. 1719 trivial. 0 not checked. [2025-02-06 02:24:41,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:24:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 69 proven. 57 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:24:41,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545348390] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:24:41,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:24:41,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-02-06 02:24:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333554882] [2025-02-06 02:24:41,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:24:41,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:24:41,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:41,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:24:41,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:24:41,827 INFO L87 Difference]: Start difference. First operand 2268 states and 3505 transitions. Second operand has 12 states, 11 states have (on average 12.272727272727273) internal successors, (135), 12 states have internal predecessors, (135), 5 states have call successors, (105), 2 states have call predecessors, (105), 4 states have return successors, (106), 4 states have call predecessors, (106), 5 states have call successors, (106) [2025-02-06 02:24:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:42,711 INFO L93 Difference]: Finished difference Result 2999 states and 4595 transitions. [2025-02-06 02:24:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:24:42,712 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 12.272727272727273) internal successors, (135), 12 states have internal predecessors, (135), 5 states have call successors, (105), 2 states have call predecessors, (105), 4 states have return successors, (106), 4 states have call predecessors, (106), 5 states have call successors, (106) Word has length 299 [2025-02-06 02:24:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:42,719 INFO L225 Difference]: With dead ends: 2999 [2025-02-06 02:24:42,719 INFO L226 Difference]: Without dead ends: 825 [2025-02-06 02:24:42,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 596 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2025-02-06 02:24:42,725 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1172 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:42,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 685 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:24:42,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-02-06 02:24:42,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 811. [2025-02-06 02:24:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 667 states have (on average 1.4437781109445278) internal successors, (963), 670 states have internal predecessors, (963), 121 states have call successors, (121), 22 states have call predecessors, (121), 22 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2025-02-06 02:24:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1205 transitions. [2025-02-06 02:24:42,801 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1205 transitions. Word has length 299 [2025-02-06 02:24:42,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:42,801 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1205 transitions. [2025-02-06 02:24:42,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 12.272727272727273) internal successors, (135), 12 states have internal predecessors, (135), 5 states have call successors, (105), 2 states have call predecessors, (105), 4 states have return successors, (106), 4 states have call predecessors, (106), 5 states have call successors, (106) [2025-02-06 02:24:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1205 transitions. [2025-02-06 02:24:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:24:42,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:42,805 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:42,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 02:24:43,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:43,011 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:43,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash -416618345, now seen corresponding path program 1 times [2025-02-06 02:24:43,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:43,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087729235] [2025-02-06 02:24:43,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:43,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:43,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:43,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:43,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:43,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:43,274 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:43,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:43,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087729235] [2025-02-06 02:24:43,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087729235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:43,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:43,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:24:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407749787] [2025-02-06 02:24:43,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:43,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:24:43,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:43,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:24:43,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:24:43,275 INFO L87 Difference]: Start difference. First operand 811 states and 1205 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:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:43,484 INFO L93 Difference]: Finished difference Result 2057 states and 3059 transitions. [2025-02-06 02:24:43,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:24:43,485 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:43,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:43,495 INFO L225 Difference]: With dead ends: 2057 [2025-02-06 02:24:43,495 INFO L226 Difference]: Without dead ends: 1349 [2025-02-06 02:24:43,497 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:24:43,498 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 193 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:43,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 687 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:24:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-02-06 02:24:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1345. [2025-02-06 02:24:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1108 states have (on average 1.4323104693140793) internal successors, (1587), 1114 states have internal predecessors, (1587), 199 states have call successors, (199), 37 states have call predecessors, (199), 37 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2025-02-06 02:24:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1985 transitions. [2025-02-06 02:24:43,663 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1985 transitions. Word has length 303 [2025-02-06 02:24:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:43,664 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 1985 transitions. [2025-02-06 02:24:43,664 INFO L472 AbstractCegarLoop]: INTERPOLANT 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) [2025-02-06 02:24:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1985 transitions. [2025-02-06 02:24:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:24:43,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:43,668 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:43,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:24:43,668 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:43,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash 194444184, now seen corresponding path program 1 times [2025-02-06 02:24:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:43,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107421513] [2025-02-06 02:24:43,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:43,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:43,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:43,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:43,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:43,893 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:43,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:43,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107421513] [2025-02-06 02:24:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107421513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:43,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:43,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:24:43,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602254093] [2025-02-06 02:24:43,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:43,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:24:43,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:43,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:24:43,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:24:43,895 INFO L87 Difference]: Start difference. First operand 1345 states and 1985 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:44,067 INFO L93 Difference]: Finished difference Result 2057 states and 3058 transitions. [2025-02-06 02:24:44,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:24:44,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:44,082 INFO L225 Difference]: With dead ends: 2057 [2025-02-06 02:24:44,082 INFO L226 Difference]: Without dead ends: 1349 [2025-02-06 02:24:44,084 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:24:44,085 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 207 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:44,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 525 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:24:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-02-06 02:24:44,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2025-02-06 02:24:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1112 states have (on average 1.4307553956834533) internal successors, (1591), 1118 states have internal predecessors, (1591), 199 states have call successors, (199), 37 states have call predecessors, (199), 37 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2025-02-06 02:24:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1989 transitions. [2025-02-06 02:24:44,210 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1989 transitions. Word has length 303 [2025-02-06 02:24:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:44,211 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 1989 transitions. [2025-02-06 02:24:44,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1989 transitions. [2025-02-06 02:24:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:24:44,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:44,215 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:44,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:24:44,215 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:44,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:44,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2097488036, now seen corresponding path program 1 times [2025-02-06 02:24:44,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:44,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124786836] [2025-02-06 02:24:44,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:44,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:44,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:44,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:44,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:44,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 63 proven. 63 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:24:44,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:44,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124786836] [2025-02-06 02:24:44,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124786836] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:44,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128352720] [2025-02-06 02:24:44,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:44,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:44,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:24:44,983 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:44,985 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:45,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:45,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:45,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:45,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:45,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 02:24:45,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:24:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2240 proven. 63 refuted. 0 times theorem prover too weak. 1309 trivial. 0 not checked. [2025-02-06 02:24:45,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:24:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 63 proven. 63 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:24:46,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128352720] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:24:46,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:24:46,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-02-06 02:24:46,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633042724] [2025-02-06 02:24:46,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:24:46,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 02:24:46,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:46,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 02:24:46,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:24:46,088 INFO L87 Difference]: Start difference. First operand 1349 states and 1989 transitions. Second operand has 14 states, 14 states have (on average 14.0) internal successors, (196), 14 states have internal predecessors, (196), 6 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (86), 6 states have call predecessors, (86), 6 states have call successors, (86) [2025-02-06 02:24:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:46,588 INFO L93 Difference]: Finished difference Result 2639 states and 3877 transitions. [2025-02-06 02:24:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:24:46,590 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 14.0) internal successors, (196), 14 states have internal predecessors, (196), 6 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (86), 6 states have call predecessors, (86), 6 states have call successors, (86) Word has length 303 [2025-02-06 02:24:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:46,597 INFO L225 Difference]: With dead ends: 2639 [2025-02-06 02:24:46,597 INFO L226 Difference]: Without dead ends: 1393 [2025-02-06 02:24:46,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2025-02-06 02:24:46,603 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 175 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:46,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 822 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:24:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-02-06 02:24:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 897. [2025-02-06 02:24:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 723 states have (on average 1.4190871369294606) internal successors, (1026), 725 states have internal predecessors, (1026), 143 states have call successors, (143), 30 states have call predecessors, (143), 30 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2025-02-06 02:24:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1312 transitions. [2025-02-06 02:24:46,739 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1312 transitions. Word has length 303 [2025-02-06 02:24:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:46,739 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1312 transitions. [2025-02-06 02:24:46,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.0) internal successors, (196), 14 states have internal predecessors, (196), 6 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (86), 6 states have call predecessors, (86), 6 states have call successors, (86) [2025-02-06 02:24:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1312 transitions. [2025-02-06 02:24:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:24:46,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:46,744 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:46,755 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:46,944 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,SelfDestructingSolverStorable12 [2025-02-06 02:24:46,945 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:46,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:46,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2128507843, now seen corresponding path program 1 times [2025-02-06 02:24:46,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:46,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850942403] [2025-02-06 02:24:46,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:46,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:46,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:47,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:47,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:47,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 102 proven. 144 refuted. 0 times theorem prover too weak. 3366 trivial. 0 not checked. [2025-02-06 02:24:47,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:47,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850942403] [2025-02-06 02:24:47,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850942403] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:47,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819627975] [2025-02-06 02:24:47,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:47,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:47,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:24:47,890 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:24:47,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:24:48,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:48,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:48,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:48,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:48,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 02:24:48,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:24:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2022 proven. 216 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2025-02-06 02:24:48,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:24:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 144 proven. 225 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2025-02-06 02:24:49,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819627975] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:24:49,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:24:49,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 26 [2025-02-06 02:24:49,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677379175] [2025-02-06 02:24:49,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:24:49,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 02:24:49,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:49,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 02:24:49,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2025-02-06 02:24:49,779 INFO L87 Difference]: Start difference. First operand 897 states and 1312 transitions. Second operand has 26 states, 24 states have (on average 8.5) internal successors, (204), 24 states have internal predecessors, (204), 10 states have call successors, (98), 4 states have call predecessors, (98), 9 states have return successors, (99), 9 states have call predecessors, (99), 10 states have call successors, (99) [2025-02-06 02:24:52,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:52,153 INFO L93 Difference]: Finished difference Result 3285 states and 4734 transitions. [2025-02-06 02:24:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-02-06 02:24:52,154 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 8.5) internal successors, (204), 24 states have internal predecessors, (204), 10 states have call successors, (98), 4 states have call predecessors, (98), 9 states have return successors, (99), 9 states have call predecessors, (99), 10 states have call successors, (99) Word has length 303 [2025-02-06 02:24:52,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:52,170 INFO L225 Difference]: With dead ends: 3285 [2025-02-06 02:24:52,170 INFO L226 Difference]: Without dead ends: 2495 [2025-02-06 02:24:52,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1308, Invalid=3662, Unknown=0, NotChecked=0, Total=4970 [2025-02-06 02:24:52,175 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 1686 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:52,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 1823 Invalid, 2034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 02:24:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2025-02-06 02:24:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 1275. [2025-02-06 02:24:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1092 states have (on average 1.4532967032967032) internal successors, (1587), 1094 states have internal predecessors, (1587), 143 states have call successors, (143), 39 states have call predecessors, (143), 39 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2025-02-06 02:24:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1873 transitions. [2025-02-06 02:24:52,333 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1873 transitions. Word has length 303 [2025-02-06 02:24:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:52,334 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1873 transitions. [2025-02-06 02:24:52,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 8.5) internal successors, (204), 24 states have internal predecessors, (204), 10 states have call successors, (98), 4 states have call predecessors, (98), 9 states have return successors, (99), 9 states have call predecessors, (99), 10 states have call successors, (99) [2025-02-06 02:24:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1873 transitions. [2025-02-06 02:24:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:24:52,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:52,340 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:52,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 02:24:52,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 02:24:52,544 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:52,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:52,545 INFO L85 PathProgramCache]: Analyzing trace with hash 945160546, now seen corresponding path program 1 times [2025-02-06 02:24:52,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:52,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409506253] [2025-02-06 02:24:52,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:52,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:52,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:52,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:52,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:52,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 285 proven. 285 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-02-06 02:24:54,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:54,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409506253] [2025-02-06 02:24:54,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409506253] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:54,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006381767] [2025-02-06 02:24:54,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:54,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:54,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:24:54,135 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:24:54,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 02:24:54,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:24:54,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:24:54,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:54,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:54,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 02:24:54,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:24:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2381 proven. 300 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-02-06 02:24:55,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:24:56,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006381767] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:56,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:24:56,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 21] total 25 [2025-02-06 02:24:56,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037505290] [2025-02-06 02:24:56,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:24:56,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 02:24:56,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:56,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 02:24:56,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1023, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 02:24:56,559 INFO L87 Difference]: Start difference. First operand 1275 states and 1873 transitions. Second operand has 25 states, 24 states have (on average 6.541666666666667) internal successors, (157), 21 states have internal predecessors, (157), 10 states have call successors, (68), 7 states have call predecessors, (68), 9 states have return successors, (68), 10 states have call predecessors, (68), 10 states have call successors, (68) [2025-02-06 02:24:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:58,563 INFO L93 Difference]: Finished difference Result 2043 states and 2915 transitions. [2025-02-06 02:24:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-06 02:24:58,563 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.541666666666667) internal successors, (157), 21 states have internal predecessors, (157), 10 states have call successors, (68), 7 states have call predecessors, (68), 9 states have return successors, (68), 10 states have call predecessors, (68), 10 states have call successors, (68) Word has length 303 [2025-02-06 02:24:58,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:58,568 INFO L225 Difference]: With dead ends: 2043 [2025-02-06 02:24:58,568 INFO L226 Difference]: Without dead ends: 887 [2025-02-06 02:24:58,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=941, Invalid=2719, Unknown=0, NotChecked=0, Total=3660 [2025-02-06 02:24:58,572 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 826 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 2679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:58,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 2427 Invalid, 2679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 02:24:58,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-02-06 02:24:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 496. [2025-02-06 02:24:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 367 states have (on average 1.2724795640326976) internal successors, (467), 368 states have internal predecessors, (467), 93 states have call successors, (93), 35 states have call predecessors, (93), 35 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-06 02:24:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 653 transitions. [2025-02-06 02:24:58,714 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 653 transitions. Word has length 303 [2025-02-06 02:24:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:58,714 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 653 transitions. [2025-02-06 02:24:58,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.541666666666667) internal successors, (157), 21 states have internal predecessors, (157), 10 states have call successors, (68), 7 states have call predecessors, (68), 9 states have return successors, (68), 10 states have call predecessors, (68), 10 states have call successors, (68) [2025-02-06 02:24:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 653 transitions. [2025-02-06 02:24:58,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-06 02:24:58,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:58,717 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, 1, 1] [2025-02-06 02:24:58,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 02:24:58,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 02:24:58,921 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:58,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:58,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1249494304, now seen corresponding path program 1 times [2025-02-06 02:24:58,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:58,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075783045] [2025-02-06 02:24:58,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:58,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:24:58,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:24:58,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:58,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:59,104 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:59,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:59,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075783045] [2025-02-06 02:24:59,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075783045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:59,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:59,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:24:59,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168132285] [2025-02-06 02:24:59,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:59,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:24:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:59,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:24:59,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:24:59,108 INFO L87 Difference]: Start difference. First operand 496 states and 653 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:59,397 INFO L93 Difference]: Finished difference Result 895 states and 1204 transitions. [2025-02-06 02:24:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:24:59,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 305 [2025-02-06 02:24:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:59,403 INFO L225 Difference]: With dead ends: 895 [2025-02-06 02:24:59,403 INFO L226 Difference]: Without dead ends: 516 [2025-02-06 02:24:59,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:24:59,405 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 392 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:59,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 749 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:24:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-06 02:24:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 496. [2025-02-06 02:24:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 367 states have (on average 1.2670299727520435) internal successors, (465), 368 states have internal predecessors, (465), 93 states have call successors, (93), 35 states have call predecessors, (93), 35 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-06 02:24:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 651 transitions. [2025-02-06 02:24:59,504 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 651 transitions. Word has length 305 [2025-02-06 02:24:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:59,504 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 651 transitions. [2025-02-06 02:24:59,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 651 transitions. [2025-02-06 02:24:59,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-06 02:24:59,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:59,507 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, 1, 1, 1] [2025-02-06 02:24:59,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:24:59,507 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:59,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash -70162314, now seen corresponding path program 1 times [2025-02-06 02:24:59,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:59,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940782827] [2025-02-06 02:24:59,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:59,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:59,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-06 02:24:59,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-06 02:24:59,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:59,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 93 proven. 33 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:24:59,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:59,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940782827] [2025-02-06 02:24:59,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940782827] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:59,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357958905] [2025-02-06 02:24:59,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:59,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:59,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:24:59,974 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:24:59,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 02:25:00,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-06 02:25:00,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-06 02:25:00,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:25:00,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:25:00,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:25:00,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:25:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2269 proven. 33 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2025-02-06 02:25:00,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:25:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 93 proven. 33 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:25:00,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357958905] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:25:00,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:25:00,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-06 02:25:00,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136818074] [2025-02-06 02:25:00,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:25:00,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:25:00,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:25:00,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:25:00,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:25:00,915 INFO L87 Difference]: Start difference. First operand 496 states and 651 transitions. Second operand has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 6 states have call successors, (111), 3 states have call predecessors, (111), 6 states have return successors, (111), 6 states have call predecessors, (111), 6 states have call successors, (111) [2025-02-06 02:25:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:25:01,344 INFO L93 Difference]: Finished difference Result 871 states and 1151 transitions. [2025-02-06 02:25:01,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:25:01,345 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 6 states have call successors, (111), 3 states have call predecessors, (111), 6 states have return successors, (111), 6 states have call predecessors, (111), 6 states have call successors, (111) Word has length 306 [2025-02-06 02:25:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:25:01,348 INFO L225 Difference]: With dead ends: 871 [2025-02-06 02:25:01,348 INFO L226 Difference]: Without dead ends: 514 [2025-02-06 02:25:01,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:25:01,350 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 171 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:25:01,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 631 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:25:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-02-06 02:25:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 504. [2025-02-06 02:25:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 373 states have (on average 1.2520107238605898) internal successors, (467), 374 states have internal predecessors, (467), 93 states have call successors, (93), 37 states have call predecessors, (93), 37 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-06 02:25:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 653 transitions. [2025-02-06 02:25:01,449 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 653 transitions. Word has length 306 [2025-02-06 02:25:01,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:25:01,451 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 653 transitions. [2025-02-06 02:25:01,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 6 states have call successors, (111), 3 states have call predecessors, (111), 6 states have return successors, (111), 6 states have call predecessors, (111), 6 states have call successors, (111) [2025-02-06 02:25:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 653 transitions. [2025-02-06 02:25:01,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-06 02:25:01,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:25:01,453 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, 1, 1, 1, 1] [2025-02-06 02:25:01,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 02:25:01,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:25:01,654 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:25:01,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:25:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash -58657420, now seen corresponding path program 1 times [2025-02-06 02:25:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:25:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287256614] [2025-02-06 02:25:01,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:25:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:25:01,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-06 02:25:01,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-06 02:25:01,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:25:01,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:25:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 312 proven. 258 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-02-06 02:25:03,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:25:03,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287256614] [2025-02-06 02:25:03,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287256614] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:25:03,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761364130] [2025-02-06 02:25:03,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:25:03,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:25:03,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:25:03,334 INFO L229 MonitoredProcess]: Starting monitored process 9 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:25:03,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 02:25:03,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-06 02:25:03,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-06 02:25:03,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:25:03,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:25:03,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 02:25:03,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:25:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2626 proven. 420 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2025-02-06 02:25:05,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:25:08,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761364130] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:25:08,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:25:08,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 24] total 34 [2025-02-06 02:25:08,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991517883] [2025-02-06 02:25:08,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:25:08,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 02:25:08,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:25:08,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 02:25:08,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=1854, Unknown=0, NotChecked=0, Total=2352 [2025-02-06 02:25:08,076 INFO L87 Difference]: Start difference. First operand 504 states and 653 transitions. Second operand has 34 states, 32 states have (on average 5.625) internal successors, (180), 29 states have internal predecessors, (180), 14 states have call successors, (77), 8 states have call predecessors, (77), 12 states have return successors, (77), 14 states have call predecessors, (77), 14 states have call successors, (77) [2025-02-06 02:25:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:25:11,383 INFO L93 Difference]: Finished difference Result 1727 states and 2282 transitions. [2025-02-06 02:25:11,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-02-06 02:25:11,384 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 5.625) internal successors, (180), 29 states have internal predecessors, (180), 14 states have call successors, (77), 8 states have call predecessors, (77), 12 states have return successors, (77), 14 states have call predecessors, (77), 14 states have call successors, (77) Word has length 307 [2025-02-06 02:25:11,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:25:11,389 INFO L225 Difference]: With dead ends: 1727 [2025-02-06 02:25:11,389 INFO L226 Difference]: Without dead ends: 1366 [2025-02-06 02:25:11,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2563, Invalid=8149, Unknown=0, NotChecked=0, Total=10712 [2025-02-06 02:25:11,392 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 1797 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1806 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:25:11,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1806 Valid, 1978 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 02:25:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-02-06 02:25:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 690. [2025-02-06 02:25:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 553 states have (on average 1.3110307414104883) internal successors, (725), 554 states have internal predecessors, (725), 93 states have call successors, (93), 43 states have call predecessors, (93), 43 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-06 02:25:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 911 transitions. [2025-02-06 02:25:11,484 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 911 transitions. Word has length 307 [2025-02-06 02:25:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:25:11,484 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 911 transitions. [2025-02-06 02:25:11,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 5.625) internal successors, (180), 29 states have internal predecessors, (180), 14 states have call successors, (77), 8 states have call predecessors, (77), 12 states have return successors, (77), 14 states have call predecessors, (77), 14 states have call successors, (77) [2025-02-06 02:25:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 911 transitions. [2025-02-06 02:25:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-06 02:25:11,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:25:11,487 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, 1, 1, 1, 1] [2025-02-06 02:25:11,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 02:25:11,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 02:25:11,691 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:25:11,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:25:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash -299197549, now seen corresponding path program 1 times [2025-02-06 02:25:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:25:11,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44477584] [2025-02-06 02:25:11,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:25:11,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:25:11,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-06 02:25:12,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-06 02:25:12,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:25:12,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 02:25:12,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845298876] [2025-02-06 02:25:12,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:25:12,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:25:12,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:25:12,031 INFO L229 MonitoredProcess]: Starting monitored process 10 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:25:12,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 02:25:12,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-06 02:25:12,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-06 02:25:12,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:25:12,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:25:12,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 02:25:12,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:25:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2268 proven. 240 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 02:25:14,462 INFO L312 TraceCheckSpWp]: Computing backward predicates...