./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-55.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 0e49f641837e2645381c1f8f53d3b9afa212dfe1d8bd986d5ccb7d6262feaded --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:41:43,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:41:43,654 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:41:43,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:41:43,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:41:43,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:41:43,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:41:43,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:41:43,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:41:43,686 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:41:43,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:41:43,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:41:43,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:41:43,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:41:43,688 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:41:43,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:41:43,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:41:43,689 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:41:43,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:41:43,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:41:43,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:41:43,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:41:43,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:41:43,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:41:43,689 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:41:43,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:41:43,690 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:41:43,690 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:41:43,690 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:41:43,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:41:43,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:41:43,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:41:43,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:41:43,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:41:43,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:41:43,691 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:41:43,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:41:43,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:41:43,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:41:43,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:41:43,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:41:43,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:41:43,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:41:43,691 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 -> 0e49f641837e2645381c1f8f53d3b9afa212dfe1d8bd986d5ccb7d6262feaded [2025-02-06 02:41:43,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:41:43,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:41:43,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:41:43,928 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:41:43,928 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:41:43,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-55.i [2025-02-06 02:41:45,074 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ffad40de/70f2be728eca46889ce56446c42bfcb5/FLAG5b8735f3d [2025-02-06 02:41:45,431 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:41:45,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-55.i [2025-02-06 02:41:45,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ffad40de/70f2be728eca46889ce56446c42bfcb5/FLAG5b8735f3d [2025-02-06 02:41:45,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ffad40de/70f2be728eca46889ce56446c42bfcb5 [2025-02-06 02:41:45,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:41:45,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:41:45,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:41:45,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:41:45,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:41:45,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:41:45" (1/1) ... [2025-02-06 02:41:45,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c442006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:45, skipping insertion in model container [2025-02-06 02:41:45,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:41:45" (1/1) ... [2025-02-06 02:41:45,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:41:45,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-55.i[916,929] [2025-02-06 02:41:45,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:41:46,003 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:41:46,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-55.i[916,929] [2025-02-06 02:41:46,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:41:46,132 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:41:46,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:46 WrapperNode [2025-02-06 02:41:46,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:41:46,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:41:46,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:41:46,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:41:46,141 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:41:46" (1/1) ... [2025-02-06 02:41:46,154 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:41:46" (1/1) ... [2025-02-06 02:41:46,203 INFO L138 Inliner]: procedures = 26, calls = 91, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 750 [2025-02-06 02:41:46,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:41:46,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:41:46,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:41:46,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:41:46,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:46" (1/1) ... [2025-02-06 02:41:46,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:46" (1/1) ... [2025-02-06 02:41:46,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:46" (1/1) ... [2025-02-06 02:41:46,259 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:41:46,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:46" (1/1) ... [2025-02-06 02:41:46,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:46" (1/1) ... [2025-02-06 02:41:46,290 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:46" (1/1) ... [2025-02-06 02:41:46,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:46" (1/1) ... [2025-02-06 02:41:46,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:46" (1/1) ... [2025-02-06 02:41:46,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:46" (1/1) ... [2025-02-06 02:41:46,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:41:46,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:41:46,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:41:46,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:41:46,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:46" (1/1) ... [2025-02-06 02:41:46,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:41:46,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:46,356 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:41:46,398 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:41:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:41:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:41:46,417 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:41:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:41:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:41:46,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:41:46,544 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:41:46,545 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:41:47,362 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L646: havoc property_#t~bitwise58#1;havoc property_#t~short59#1;havoc property_#t~bitwise60#1;havoc property_#t~short61#1;havoc property_#t~ite65#1;havoc property_#t~bitwise62#1;havoc property_#t~ite64#1;havoc property_#t~bitwise63#1;havoc property_#t~short66#1;havoc property_#t~bitwise67#1;havoc property_#t~short68#1;havoc property_#t~bitwise69#1;havoc property_#t~short70#1; [2025-02-06 02:41:47,511 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-02-06 02:41:47,511 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:41:47,538 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:41:47,540 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:41:47,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:47 BoogieIcfgContainer [2025-02-06 02:41:47,540 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:41:47,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:41:47,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:41:47,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:41:47,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:41:45" (1/3) ... [2025-02-06 02:41:47,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78241208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:47, skipping insertion in model container [2025-02-06 02:41:47,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:46" (2/3) ... [2025-02-06 02:41:47,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78241208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:47, skipping insertion in model container [2025-02-06 02:41:47,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:47" (3/3) ... [2025-02-06 02:41:47,548 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-55.i [2025-02-06 02:41:47,558 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:41:47,561 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-55.i that has 2 procedures, 297 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:41:47,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:41:47,627 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;@24fb2fda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:41:47,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:41:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 297 states, 216 states have (on average 1.5092592592592593) internal successors, (326), 217 states have internal predecessors, (326), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 02:41:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-06 02:41:47,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:47,655 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:47,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:47,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:47,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1901561129, now seen corresponding path program 1 times [2025-02-06 02:41:47,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:47,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44488575] [2025-02-06 02:41:47,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:47,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:47,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:41:47,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:41:47,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:47,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2025-02-06 02:41:48,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:48,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44488575] [2025-02-06 02:41:48,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44488575] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:48,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614879995] [2025-02-06 02:41:48,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:48,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:48,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:48,178 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:41:48,180 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:41:48,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:41:48,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:41:48,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:48,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:48,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:41:48,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2025-02-06 02:41:48,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:41:48,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614879995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:48,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:41:48,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:41:48,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474632922] [2025-02-06 02:41:48,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:48,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:41:48,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:48,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:41:48,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:41:48,615 INFO L87 Difference]: Start difference. First operand has 297 states, 216 states have (on average 1.5092592592592593) internal successors, (326), 217 states have internal predecessors, (326), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) [2025-02-06 02:41:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:48,666 INFO L93 Difference]: Finished difference Result 587 states and 1035 transitions. [2025-02-06 02:41:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:41:48,668 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) Word has length 541 [2025-02-06 02:41:48,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:48,674 INFO L225 Difference]: With dead ends: 587 [2025-02-06 02:41:48,674 INFO L226 Difference]: Without dead ends: 293 [2025-02-06 02:41:48,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 542 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:41:48,686 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:48,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 462 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:41:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-06 02:41:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-02-06 02:41:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 213 states have (on average 1.4929577464788732) internal successors, (318), 213 states have internal predecessors, (318), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 02:41:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 474 transitions. [2025-02-06 02:41:48,745 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 474 transitions. Word has length 541 [2025-02-06 02:41:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:48,745 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 474 transitions. [2025-02-06 02:41:48,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) [2025-02-06 02:41:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 474 transitions. [2025-02-06 02:41:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-06 02:41:48,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:48,755 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:48,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:41:48,956 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:41:48,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:48,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash 195491759, now seen corresponding path program 1 times [2025-02-06 02:41:48,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:48,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170621310] [2025-02-06 02:41:48,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:49,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:41:49,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:41:49,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:49,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:41:49,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:49,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170621310] [2025-02-06 02:41:49,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170621310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:49,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:49,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:49,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621723608] [2025-02-06 02:41:49,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:49,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:49,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:49,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:49,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:49,549 INFO L87 Difference]: Start difference. First operand 293 states and 474 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:49,768 INFO L93 Difference]: Finished difference Result 785 states and 1272 transitions. [2025-02-06 02:41:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:49,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-02-06 02:41:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:49,773 INFO L225 Difference]: With dead ends: 785 [2025-02-06 02:41:49,773 INFO L226 Difference]: Without dead ends: 495 [2025-02-06 02:41:49,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:49,776 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 289 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:49,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1030 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:41:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-02-06 02:41:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 492. [2025-02-06 02:41:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 382 states have (on average 1.5183246073298429) internal successors, (580), 383 states have internal predecessors, (580), 107 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2025-02-06 02:41:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 794 transitions. [2025-02-06 02:41:49,814 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 794 transitions. Word has length 541 [2025-02-06 02:41:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:49,815 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 794 transitions. [2025-02-06 02:41:49,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 794 transitions. [2025-02-06 02:41:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-06 02:41:49,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:49,823 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:49,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:41:49,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:49,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:49,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1451657525, now seen corresponding path program 1 times [2025-02-06 02:41:49,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853857145] [2025-02-06 02:41:49,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:49,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:49,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:41:49,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:41:49,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:49,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:41:50,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:50,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853857145] [2025-02-06 02:41:50,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853857145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:50,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:50,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:50,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688814722] [2025-02-06 02:41:50,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:50,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:50,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:50,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:50,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:50,332 INFO L87 Difference]: Start difference. First operand 492 states and 794 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:50,520 INFO L93 Difference]: Finished difference Result 988 states and 1590 transitions. [2025-02-06 02:41:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:50,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-02-06 02:41:50,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:50,528 INFO L225 Difference]: With dead ends: 988 [2025-02-06 02:41:50,528 INFO L226 Difference]: Without dead ends: 499 [2025-02-06 02:41:50,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:50,530 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 241 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:50,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 929 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-02-06 02:41:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 394. [2025-02-06 02:41:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 313 states have (on average 1.5271565495207668) internal successors, (478), 313 states have internal predecessors, (478), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 02:41:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 634 transitions. [2025-02-06 02:41:50,561 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 634 transitions. Word has length 541 [2025-02-06 02:41:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:50,570 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 634 transitions. [2025-02-06 02:41:50,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 634 transitions. [2025-02-06 02:41:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-06 02:41:50,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:50,576 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:50,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:41:50,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:50,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash 970864684, now seen corresponding path program 1 times [2025-02-06 02:41:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:50,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495583790] [2025-02-06 02:41:50,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:50,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:41:50,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:41:50,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:50,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:41:50,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:50,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495583790] [2025-02-06 02:41:50,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495583790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:50,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:50,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:50,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767632278] [2025-02-06 02:41:50,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:50,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:50,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:50,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:50,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:50,915 INFO L87 Difference]: Start difference. First operand 394 states and 634 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:51,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:51,059 INFO L93 Difference]: Finished difference Result 1173 states and 1890 transitions. [2025-02-06 02:41:51,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:51,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-02-06 02:41:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:51,068 INFO L225 Difference]: With dead ends: 1173 [2025-02-06 02:41:51,070 INFO L226 Difference]: Without dead ends: 782 [2025-02-06 02:41:51,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:51,073 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 431 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:51,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 954 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-02-06 02:41:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 780. [2025-02-06 02:41:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 619 states have (on average 1.5105008077544426) internal successors, (935), 619 states have internal predecessors, (935), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-06 02:41:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1247 transitions. [2025-02-06 02:41:51,135 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1247 transitions. Word has length 541 [2025-02-06 02:41:51,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:51,136 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1247 transitions. [2025-02-06 02:41:51,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1247 transitions. [2025-02-06 02:41:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-06 02:41:51,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:51,147 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:51,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:41:51,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:51,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:51,149 INFO L85 PathProgramCache]: Analyzing trace with hash 356019116, now seen corresponding path program 1 times [2025-02-06 02:41:51,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:51,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250399723] [2025-02-06 02:41:51,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:51,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:51,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:41:51,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:41:51,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:51,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:41:52,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:52,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250399723] [2025-02-06 02:41:52,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250399723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:52,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:52,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:41:52,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756538070] [2025-02-06 02:41:52,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:52,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:41:52,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:52,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:41:52,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:41:52,630 INFO L87 Difference]: Start difference. First operand 780 states and 1247 transitions. Second operand has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:53,733 INFO L93 Difference]: Finished difference Result 3594 states and 5750 transitions. [2025-02-06 02:41:53,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:41:53,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-02-06 02:41:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:53,745 INFO L225 Difference]: With dead ends: 3594 [2025-02-06 02:41:53,745 INFO L226 Difference]: Without dead ends: 2817 [2025-02-06 02:41:53,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:41:53,748 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 2010 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:53,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 2929 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:41:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2025-02-06 02:41:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 1577. [2025-02-06 02:41:53,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1330 states have (on average 1.556390977443609) internal successors, (2070), 1332 states have internal predecessors, (2070), 238 states have call successors, (238), 8 states have call predecessors, (238), 8 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 02:41:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2546 transitions. [2025-02-06 02:41:53,825 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2546 transitions. Word has length 541 [2025-02-06 02:41:53,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:53,825 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2546 transitions. [2025-02-06 02:41:53,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2546 transitions. [2025-02-06 02:41:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-06 02:41:53,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:53,830 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:53,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:41:53,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:53,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:53,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1311540395, now seen corresponding path program 1 times [2025-02-06 02:41:53,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:53,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573655124] [2025-02-06 02:41:53,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:53,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:53,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:41:53,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:41:53,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:53,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:41:55,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:55,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573655124] [2025-02-06 02:41:55,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573655124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:55,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:55,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:41:55,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169023698] [2025-02-06 02:41:55,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:55,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:41:55,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:55,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:41:55,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:41:55,240 INFO L87 Difference]: Start difference. First operand 1577 states and 2546 transitions. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:56,975 INFO L93 Difference]: Finished difference Result 6081 states and 9802 transitions. [2025-02-06 02:41:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:41:56,976 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-02-06 02:41:56,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:56,994 INFO L225 Difference]: With dead ends: 6081 [2025-02-06 02:41:56,994 INFO L226 Difference]: Without dead ends: 4507 [2025-02-06 02:41:57,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:41:57,001 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 2093 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:57,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 2834 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 02:41:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2025-02-06 02:41:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3530. [2025-02-06 02:41:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3530 states, 3037 states have (on average 1.5696410931840632) internal successors, (4767), 3041 states have internal predecessors, (4767), 476 states have call successors, (476), 16 states have call predecessors, (476), 16 states have return successors, (476), 472 states have call predecessors, (476), 476 states have call successors, (476) [2025-02-06 02:41:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3530 states to 3530 states and 5719 transitions. [2025-02-06 02:41:57,151 INFO L78 Accepts]: Start accepts. Automaton has 3530 states and 5719 transitions. Word has length 541 [2025-02-06 02:41:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:57,152 INFO L471 AbstractCegarLoop]: Abstraction has 3530 states and 5719 transitions. [2025-02-06 02:41:57,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3530 states and 5719 transitions. [2025-02-06 02:41:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-06 02:41:57,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:57,158 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:57,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:41:57,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:57,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash 782621356, now seen corresponding path program 1 times [2025-02-06 02:41:57,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:57,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967693403] [2025-02-06 02:41:57,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:57,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:57,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:41:57,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:41:57,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:57,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:41:57,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:57,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967693403] [2025-02-06 02:41:57,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967693403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:57,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:57,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:57,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873345463] [2025-02-06 02:41:57,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:57,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:57,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:57,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:57,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:57,358 INFO L87 Difference]: Start difference. First operand 3530 states and 5719 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:57,483 INFO L93 Difference]: Finished difference Result 9531 states and 15428 transitions. [2025-02-06 02:41:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:57,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-02-06 02:41:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:57,506 INFO L225 Difference]: With dead ends: 9531 [2025-02-06 02:41:57,507 INFO L226 Difference]: Without dead ends: 6004 [2025-02-06 02:41:57,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:57,513 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 264 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:57,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1061 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:41:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2025-02-06 02:41:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5994. [2025-02-06 02:41:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5994 states, 5173 states have (on average 1.5694954571815194) internal successors, (8119), 5185 states have internal predecessors, (8119), 788 states have call successors, (788), 32 states have call predecessors, (788), 32 states have return successors, (788), 776 states have call predecessors, (788), 788 states have call successors, (788) [2025-02-06 02:41:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 9695 transitions. [2025-02-06 02:41:57,721 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 9695 transitions. Word has length 541 [2025-02-06 02:41:57,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:57,722 INFO L471 AbstractCegarLoop]: Abstraction has 5994 states and 9695 transitions. [2025-02-06 02:41:57,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 9695 transitions. [2025-02-06 02:41:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-06 02:41:57,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:57,730 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:57,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:41:57,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:57,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash 272087179, now seen corresponding path program 1 times [2025-02-06 02:41:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501341381] [2025-02-06 02:41:57,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:57,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:41:57,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:41:57,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:57,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:41:58,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:58,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501341381] [2025-02-06 02:41:58,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501341381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:58,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:58,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:58,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113080086] [2025-02-06 02:41:58,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:58,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:58,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:58,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:58,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:58,043 INFO L87 Difference]: Start difference. First operand 5994 states and 9695 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:58,209 INFO L93 Difference]: Finished difference Result 12043 states and 19451 transitions. [2025-02-06 02:41:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:58,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-02-06 02:41:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:58,235 INFO L225 Difference]: With dead ends: 12043 [2025-02-06 02:41:58,236 INFO L226 Difference]: Without dead ends: 6052 [2025-02-06 02:41:58,249 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:41:58,249 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 100 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:58,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 985 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2025-02-06 02:41:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 6049. [2025-02-06 02:41:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6049 states, 5205 states have (on average 1.5640730067243036) internal successors, (8141), 5218 states have internal predecessors, (8141), 803 states have call successors, (803), 40 states have call predecessors, (803), 40 states have return successors, (803), 790 states have call predecessors, (803), 803 states have call successors, (803) [2025-02-06 02:41:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6049 states to 6049 states and 9747 transitions. [2025-02-06 02:41:58,445 INFO L78 Accepts]: Start accepts. Automaton has 6049 states and 9747 transitions. Word has length 541 [2025-02-06 02:41:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:58,446 INFO L471 AbstractCegarLoop]: Abstraction has 6049 states and 9747 transitions. [2025-02-06 02:41:58,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6049 states and 9747 transitions. [2025-02-06 02:41:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-06 02:41:58,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:58,453 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:58,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:41:58,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:58,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash -85735379, now seen corresponding path program 1 times [2025-02-06 02:41:58,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:58,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104542859] [2025-02-06 02:41:58,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:58,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:58,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:41:58,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:41:58,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:58,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:41:59,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:59,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104542859] [2025-02-06 02:41:59,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104542859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:59,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:59,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:41:59,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482779101] [2025-02-06 02:41:59,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:59,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:41:59,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:59,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:41:59,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:41:59,168 INFO L87 Difference]: Start difference. First operand 6049 states and 9747 transitions. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:41:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:59,732 INFO L93 Difference]: Finished difference Result 24214 states and 38989 transitions. [2025-02-06 02:41:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:41:59,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-02-06 02:41:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:59,785 INFO L225 Difference]: With dead ends: 24214 [2025-02-06 02:41:59,785 INFO L226 Difference]: Without dead ends: 18191 [2025-02-06 02:41:59,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:41:59,804 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 1423 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:59,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 2207 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18191 states. [2025-02-06 02:42:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18191 to 6601. [2025-02-06 02:42:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6601 states, 5757 states have (on average 1.583637311099531) internal successors, (9117), 5770 states have internal predecessors, (9117), 803 states have call successors, (803), 40 states have call predecessors, (803), 40 states have return successors, (803), 790 states have call predecessors, (803), 803 states have call successors, (803) [2025-02-06 02:42:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 10723 transitions. [2025-02-06 02:42:00,050 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 10723 transitions. Word has length 541 [2025-02-06 02:42:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:00,051 INFO L471 AbstractCegarLoop]: Abstraction has 6601 states and 10723 transitions. [2025-02-06 02:42:00,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 10723 transitions. [2025-02-06 02:42:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-06 02:42:00,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:00,063 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:00,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:42:00,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:00,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash 869785900, now seen corresponding path program 1 times [2025-02-06 02:42:00,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:00,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195518124] [2025-02-06 02:42:00,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:00,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:00,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:42:00,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:42:00,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:00,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:01,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:01,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195518124] [2025-02-06 02:42:01,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195518124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:01,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:01,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:42:01,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370179532] [2025-02-06 02:42:01,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:01,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:42:01,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:01,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:42:01,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:42:01,318 INFO L87 Difference]: Start difference. First operand 6601 states and 10723 transitions. Second operand has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:02,322 INFO L93 Difference]: Finished difference Result 16703 states and 26993 transitions. [2025-02-06 02:42:02,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:42:02,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-02-06 02:42:02,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:02,355 INFO L225 Difference]: With dead ends: 16703 [2025-02-06 02:42:02,355 INFO L226 Difference]: Without dead ends: 10128 [2025-02-06 02:42:02,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:42:02,367 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1348 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:02,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 2348 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:42:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10128 states. [2025-02-06 02:42:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10128 to 6934. [2025-02-06 02:42:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6934 states, 6090 states have (on average 1.5852216748768473) internal successors, (9654), 6103 states have internal predecessors, (9654), 803 states have call successors, (803), 40 states have call predecessors, (803), 40 states have return successors, (803), 790 states have call predecessors, (803), 803 states have call successors, (803) [2025-02-06 02:42:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 11260 transitions. [2025-02-06 02:42:02,553 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 11260 transitions. Word has length 541 [2025-02-06 02:42:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:02,554 INFO L471 AbstractCegarLoop]: Abstraction has 6934 states and 11260 transitions. [2025-02-06 02:42:02,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 11260 transitions. [2025-02-06 02:42:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-06 02:42:02,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:02,560 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:02,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:42:02,561 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:02,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1082460876, now seen corresponding path program 1 times [2025-02-06 02:42:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:02,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052783715] [2025-02-06 02:42:02,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:02,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:02,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:42:02,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:42:02,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:02,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:03,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:03,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052783715] [2025-02-06 02:42:03,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052783715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:03,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:03,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:42:03,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991496262] [2025-02-06 02:42:03,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:03,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:42:03,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:03,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:42:03,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:42:03,150 INFO L87 Difference]: Start difference. First operand 6934 states and 11260 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:03,403 INFO L93 Difference]: Finished difference Result 20750 states and 33698 transitions. [2025-02-06 02:42:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:42:03,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-02-06 02:42:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:03,439 INFO L225 Difference]: With dead ends: 20750 [2025-02-06 02:42:03,439 INFO L226 Difference]: Without dead ends: 13842 [2025-02-06 02:42:03,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:42:03,455 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 456 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:03,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1176 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:42:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13842 states. [2025-02-06 02:42:03,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13842 to 13840. [2025-02-06 02:42:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13840 states, 12168 states have (on average 1.5782380013149244) internal successors, (19204), 12193 states have internal predecessors, (19204), 1591 states have call successors, (1591), 80 states have call predecessors, (1591), 80 states have return successors, (1591), 1566 states have call predecessors, (1591), 1591 states have call successors, (1591) [2025-02-06 02:42:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13840 states to 13840 states and 22386 transitions. [2025-02-06 02:42:03,823 INFO L78 Accepts]: Start accepts. Automaton has 13840 states and 22386 transitions. Word has length 541 [2025-02-06 02:42:03,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:03,824 INFO L471 AbstractCegarLoop]: Abstraction has 13840 states and 22386 transitions. [2025-02-06 02:42:03,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 13840 states and 22386 transitions. [2025-02-06 02:42:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-06 02:42:03,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:03,835 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:03,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:42:03,835 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:03,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:03,836 INFO L85 PathProgramCache]: Analyzing trace with hash -848158229, now seen corresponding path program 1 times [2025-02-06 02:42:03,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:03,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615556360] [2025-02-06 02:42:03,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:03,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-06 02:42:04,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-06 02:42:04,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:04,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:04,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:04,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615556360] [2025-02-06 02:42:04,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615556360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:04,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:04,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:42:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48415417] [2025-02-06 02:42:04,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:04,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:42:04,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:04,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:42:04,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:42:04,529 INFO L87 Difference]: Start difference. First operand 13840 states and 22386 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:05,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:05,193 INFO L93 Difference]: Finished difference Result 31744 states and 50874 transitions. [2025-02-06 02:42:05,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:42:05,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-02-06 02:42:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:05,238 INFO L225 Difference]: With dead ends: 31744 [2025-02-06 02:42:05,238 INFO L226 Difference]: Without dead ends: 17930 [2025-02-06 02:42:05,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:42:05,264 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1100 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:05,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 2344 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:42:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17930 states. [2025-02-06 02:42:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17930 to 13999. [2025-02-06 02:42:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13999 states, 12296 states have (on average 1.5765289525048796) internal successors, (19385), 12322 states have internal predecessors, (19385), 1620 states have call successors, (1620), 82 states have call predecessors, (1620), 82 states have return successors, (1620), 1594 states have call predecessors, (1620), 1620 states have call successors, (1620) [2025-02-06 02:42:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13999 states to 13999 states and 22625 transitions. [2025-02-06 02:42:05,671 INFO L78 Accepts]: Start accepts. Automaton has 13999 states and 22625 transitions. Word has length 541 [2025-02-06 02:42:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:05,672 INFO L471 AbstractCegarLoop]: Abstraction has 13999 states and 22625 transitions. [2025-02-06 02:42:05,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand 13999 states and 22625 transitions. [2025-02-06 02:42:05,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-02-06 02:42:05,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:05,728 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:05,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:42:05,728 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:05,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:05,729 INFO L85 PathProgramCache]: Analyzing trace with hash -581073601, now seen corresponding path program 1 times [2025-02-06 02:42:05,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:05,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357743472] [2025-02-06 02:42:05,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:05,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:05,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-02-06 02:42:05,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-02-06 02:42:05,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:05,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:06,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:06,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357743472] [2025-02-06 02:42:06,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357743472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:06,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:06,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:42:06,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872979953] [2025-02-06 02:42:06,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:06,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:42:06,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:06,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:42:06,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:42:06,164 INFO L87 Difference]: Start difference. First operand 13999 states and 22625 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:07,026 INFO L93 Difference]: Finished difference Result 33373 states and 53348 transitions. [2025-02-06 02:42:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:42:07,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 542 [2025-02-06 02:42:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:07,077 INFO L225 Difference]: With dead ends: 33373 [2025-02-06 02:42:07,078 INFO L226 Difference]: Without dead ends: 19400 [2025-02-06 02:42:07,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:42:07,097 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 626 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:07,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1623 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:42:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19400 states. [2025-02-06 02:42:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19400 to 12317. [2025-02-06 02:42:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12317 states, 10614 states have (on average 1.5546448087431695) internal successors, (16501), 10640 states have internal predecessors, (16501), 1620 states have call successors, (1620), 82 states have call predecessors, (1620), 82 states have return successors, (1620), 1594 states have call predecessors, (1620), 1620 states have call successors, (1620) [2025-02-06 02:42:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12317 states to 12317 states and 19741 transitions. [2025-02-06 02:42:07,714 INFO L78 Accepts]: Start accepts. Automaton has 12317 states and 19741 transitions. Word has length 542 [2025-02-06 02:42:07,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:07,714 INFO L471 AbstractCegarLoop]: Abstraction has 12317 states and 19741 transitions. [2025-02-06 02:42:07,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:07,715 INFO L276 IsEmpty]: Start isEmpty. Operand 12317 states and 19741 transitions. [2025-02-06 02:42:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-02-06 02:42:07,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:07,722 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:07,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:42:07,722 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:07,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash -807846869, now seen corresponding path program 1 times [2025-02-06 02:42:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:07,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080210392] [2025-02-06 02:42:07,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:07,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-02-06 02:42:07,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-02-06 02:42:07,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:07,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:08,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:08,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080210392] [2025-02-06 02:42:08,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080210392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:08,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:08,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:42:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428316446] [2025-02-06 02:42:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:08,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:42:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:08,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:42:08,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:42:08,589 INFO L87 Difference]: Start difference. First operand 12317 states and 19741 transitions. Second operand has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:10,715 INFO L93 Difference]: Finished difference Result 30088 states and 48025 transitions. [2025-02-06 02:42:10,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:42:10,715 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 542 [2025-02-06 02:42:10,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:10,759 INFO L225 Difference]: With dead ends: 30088 [2025-02-06 02:42:10,759 INFO L226 Difference]: Without dead ends: 17797 [2025-02-06 02:42:10,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:42:10,780 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 3549 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3549 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:10,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3549 Valid, 2453 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 02:42:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17797 states. [2025-02-06 02:42:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17797 to 14045. [2025-02-06 02:42:11,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14045 states, 12270 states have (on average 1.5598207008964955) internal successors, (19139), 12300 states have internal predecessors, (19139), 1680 states have call successors, (1680), 94 states have call predecessors, (1680), 94 states have return successors, (1680), 1650 states have call predecessors, (1680), 1680 states have call successors, (1680) [2025-02-06 02:42:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14045 states to 14045 states and 22499 transitions. [2025-02-06 02:42:11,277 INFO L78 Accepts]: Start accepts. Automaton has 14045 states and 22499 transitions. Word has length 542 [2025-02-06 02:42:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:11,277 INFO L471 AbstractCegarLoop]: Abstraction has 14045 states and 22499 transitions. [2025-02-06 02:42:11,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 14045 states and 22499 transitions. [2025-02-06 02:42:11,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-02-06 02:42:11,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:11,287 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:11,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:42:11,287 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:11,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1251458292, now seen corresponding path program 1 times [2025-02-06 02:42:11,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:11,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497869621] [2025-02-06 02:42:11,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:11,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-02-06 02:42:11,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-02-06 02:42:11,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:11,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:12,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:12,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497869621] [2025-02-06 02:42:12,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497869621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:12,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:12,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:42:12,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954077126] [2025-02-06 02:42:12,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:12,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:42:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:12,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:42:12,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:42:12,400 INFO L87 Difference]: Start difference. First operand 14045 states and 22499 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:13,664 INFO L93 Difference]: Finished difference Result 43103 states and 68417 transitions. [2025-02-06 02:42:13,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:42:13,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 542 [2025-02-06 02:42:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:13,732 INFO L225 Difference]: With dead ends: 43103 [2025-02-06 02:42:13,733 INFO L226 Difference]: Without dead ends: 29084 [2025-02-06 02:42:13,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:42:13,755 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 870 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:13,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 2360 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:42:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29084 states. [2025-02-06 02:42:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29084 to 17555. [2025-02-06 02:42:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17555 states, 15780 states have (on average 1.5804816223067173) internal successors, (24940), 15810 states have internal predecessors, (24940), 1680 states have call successors, (1680), 94 states have call predecessors, (1680), 94 states have return successors, (1680), 1650 states have call predecessors, (1680), 1680 states have call successors, (1680) [2025-02-06 02:42:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17555 states to 17555 states and 28300 transitions. [2025-02-06 02:42:14,697 INFO L78 Accepts]: Start accepts. Automaton has 17555 states and 28300 transitions. Word has length 542 [2025-02-06 02:42:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:14,698 INFO L471 AbstractCegarLoop]: Abstraction has 17555 states and 28300 transitions. [2025-02-06 02:42:14,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 17555 states and 28300 transitions. [2025-02-06 02:42:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-02-06 02:42:14,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:14,731 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:14,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:42:14,731 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:14,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:14,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2120825421, now seen corresponding path program 1 times [2025-02-06 02:42:14,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:14,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136927536] [2025-02-06 02:42:14,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:14,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-02-06 02:42:15,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-02-06 02:42:15,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:15,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:15,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:15,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136927536] [2025-02-06 02:42:15,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136927536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:15,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:15,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:42:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807520449] [2025-02-06 02:42:15,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:15,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:42:15,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:15,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:42:15,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:42:15,885 INFO L87 Difference]: Start difference. First operand 17555 states and 28300 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:16,534 INFO L93 Difference]: Finished difference Result 34968 states and 56327 transitions. [2025-02-06 02:42:16,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:42:16,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 542 [2025-02-06 02:42:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:16,573 INFO L225 Difference]: With dead ends: 34968 [2025-02-06 02:42:16,574 INFO L226 Difference]: Without dead ends: 17439 [2025-02-06 02:42:16,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:42:16,596 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 618 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:16,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1124 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:42:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17439 states. [2025-02-06 02:42:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17439 to 16860. [2025-02-06 02:42:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16860 states, 15279 states have (on average 1.578375548137967) internal successors, (24116), 15308 states have internal predecessors, (24116), 1491 states have call successors, (1491), 89 states have call predecessors, (1491), 89 states have return successors, (1491), 1462 states have call predecessors, (1491), 1491 states have call successors, (1491) [2025-02-06 02:42:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16860 states to 16860 states and 27098 transitions. [2025-02-06 02:42:17,160 INFO L78 Accepts]: Start accepts. Automaton has 16860 states and 27098 transitions. Word has length 542 [2025-02-06 02:42:17,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:17,160 INFO L471 AbstractCegarLoop]: Abstraction has 16860 states and 27098 transitions. [2025-02-06 02:42:17,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 16860 states and 27098 transitions. [2025-02-06 02:42:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-02-06 02:42:17,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:17,172 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:17,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:42:17,172 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:17,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1606657559, now seen corresponding path program 1 times [2025-02-06 02:42:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:17,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095938680] [2025-02-06 02:42:17,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:17,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-02-06 02:42:18,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-02-06 02:42:18,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:18,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 63 proven. 168 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-02-06 02:42:19,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:19,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095938680] [2025-02-06 02:42:19,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095938680] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:42:19,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356529611] [2025-02-06 02:42:19,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:19,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:19,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:19,878 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:42:19,880 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:42:20,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-02-06 02:42:20,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-02-06 02:42:20,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:20,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:20,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:42:20,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:42:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 5703 proven. 144 refuted. 0 times theorem prover too weak. 6165 trivial. 0 not checked. [2025-02-06 02:42:20,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:42:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 87 proven. 144 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-02-06 02:42:21,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356529611] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:42:21,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:42:21,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 16 [2025-02-06 02:42:21,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020932921] [2025-02-06 02:42:21,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:42:21,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 02:42:21,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:21,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 02:42:21,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:42:21,158 INFO L87 Difference]: Start difference. First operand 16860 states and 27098 transitions. Second operand has 16 states, 16 states have (on average 16.625) internal successors, (266), 16 states have internal predecessors, (266), 3 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (184), 3 states have call predecessors, (184), 3 states have call successors, (184) [2025-02-06 02:42:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:23,176 INFO L93 Difference]: Finished difference Result 25682 states and 40669 transitions. [2025-02-06 02:42:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 02:42:23,176 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 16.625) internal successors, (266), 16 states have internal predecessors, (266), 3 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (184), 3 states have call predecessors, (184), 3 states have call successors, (184) Word has length 543 [2025-02-06 02:42:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:23,200 INFO L225 Difference]: With dead ends: 25682 [2025-02-06 02:42:23,200 INFO L226 Difference]: Without dead ends: 8825 [2025-02-06 02:42:23,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1114 GetRequests, 1088 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-02-06 02:42:23,218 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 832 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 2543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:23,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 2191 Invalid, 2543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 02:42:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8825 states. [2025-02-06 02:42:23,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8825 to 8454. [2025-02-06 02:42:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8454 states, 6809 states have (on average 1.4746658833896313) internal successors, (10041), 6838 states have internal predecessors, (10041), 1505 states have call successors, (1505), 139 states have call predecessors, (1505), 139 states have return successors, (1505), 1476 states have call predecessors, (1505), 1505 states have call successors, (1505) [2025-02-06 02:42:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8454 states to 8454 states and 13051 transitions. [2025-02-06 02:42:23,654 INFO L78 Accepts]: Start accepts. Automaton has 8454 states and 13051 transitions. Word has length 543 [2025-02-06 02:42:23,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:23,655 INFO L471 AbstractCegarLoop]: Abstraction has 8454 states and 13051 transitions. [2025-02-06 02:42:23,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.625) internal successors, (266), 16 states have internal predecessors, (266), 3 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (184), 3 states have call predecessors, (184), 3 states have call successors, (184) [2025-02-06 02:42:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 8454 states and 13051 transitions. [2025-02-06 02:42:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-02-06 02:42:23,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:23,664 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:23,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:42:23,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 02:42:23,866 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:23,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:23,867 INFO L85 PathProgramCache]: Analyzing trace with hash -405815604, now seen corresponding path program 1 times [2025-02-06 02:42:23,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:23,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797183029] [2025-02-06 02:42:23,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:23,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:23,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-02-06 02:42:23,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-02-06 02:42:23,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:23,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:24,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:24,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797183029] [2025-02-06 02:42:24,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797183029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:24,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:24,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:42:24,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961893615] [2025-02-06 02:42:24,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:24,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:42:24,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:24,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:42:24,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:42:24,591 INFO L87 Difference]: Start difference. First operand 8454 states and 13051 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:26,429 INFO L93 Difference]: Finished difference Result 36727 states and 56756 transitions. [2025-02-06 02:42:26,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:42:26,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 544 [2025-02-06 02:42:26,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:26,483 INFO L225 Difference]: With dead ends: 36727 [2025-02-06 02:42:26,483 INFO L226 Difference]: Without dead ends: 28333 [2025-02-06 02:42:26,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:42:26,497 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 1523 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:26,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1973 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:42:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28333 states. [2025-02-06 02:42:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28333 to 10590. [2025-02-06 02:42:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10590 states, 8945 states have (on average 1.5245388485187255) internal successors, (13637), 8974 states have internal predecessors, (13637), 1505 states have call successors, (1505), 139 states have call predecessors, (1505), 139 states have return successors, (1505), 1476 states have call predecessors, (1505), 1505 states have call successors, (1505) [2025-02-06 02:42:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10590 states to 10590 states and 16647 transitions. [2025-02-06 02:42:27,148 INFO L78 Accepts]: Start accepts. Automaton has 10590 states and 16647 transitions. Word has length 544 [2025-02-06 02:42:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:27,149 INFO L471 AbstractCegarLoop]: Abstraction has 10590 states and 16647 transitions. [2025-02-06 02:42:27,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 10590 states and 16647 transitions. [2025-02-06 02:42:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-02-06 02:42:27,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:27,155 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:27,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 02:42:27,155 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:27,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1615057843, now seen corresponding path program 1 times [2025-02-06 02:42:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:27,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870422931] [2025-02-06 02:42:27,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:27,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-02-06 02:42:27,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-02-06 02:42:27,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:27,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:27,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870422931] [2025-02-06 02:42:27,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870422931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:27,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:27,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:42:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518285750] [2025-02-06 02:42:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:27,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:42:27,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:27,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:42:27,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:42:27,810 INFO L87 Difference]: Start difference. First operand 10590 states and 16647 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:30,140 INFO L93 Difference]: Finished difference Result 41834 states and 64887 transitions. [2025-02-06 02:42:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:42:30,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 544 [2025-02-06 02:42:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:30,216 INFO L225 Difference]: With dead ends: 41834 [2025-02-06 02:42:30,216 INFO L226 Difference]: Without dead ends: 31304 [2025-02-06 02:42:30,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:42:30,235 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 1202 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 2619 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:30,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 2619 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:42:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31304 states. [2025-02-06 02:42:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31304 to 26306. [2025-02-06 02:42:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26306 states, 21977 states have (on average 1.4972471219911725) internal successors, (32905), 22078 states have internal predecessors, (32905), 3937 states have call successors, (3937), 391 states have call predecessors, (3937), 391 states have return successors, (3937), 3836 states have call predecessors, (3937), 3937 states have call successors, (3937) [2025-02-06 02:42:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26306 states to 26306 states and 40779 transitions. [2025-02-06 02:42:32,142 INFO L78 Accepts]: Start accepts. Automaton has 26306 states and 40779 transitions. Word has length 544 [2025-02-06 02:42:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:32,143 INFO L471 AbstractCegarLoop]: Abstraction has 26306 states and 40779 transitions. [2025-02-06 02:42:32,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 26306 states and 40779 transitions. [2025-02-06 02:42:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-02-06 02:42:32,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:32,164 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:32,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 02:42:32,165 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:32,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:32,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1757225870, now seen corresponding path program 1 times [2025-02-06 02:42:32,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:32,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088442346] [2025-02-06 02:42:32,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:32,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:32,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-02-06 02:42:33,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-02-06 02:42:33,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:33,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 93 proven. 138 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-02-06 02:42:33,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:33,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088442346] [2025-02-06 02:42:33,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088442346] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:42:33,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689879118] [2025-02-06 02:42:33,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:33,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:33,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:33,403 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:42:33,405 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:42:33,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-02-06 02:42:33,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-02-06 02:42:33,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:33,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:33,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:42:33,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:42:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 6077 proven. 111 refuted. 0 times theorem prover too weak. 5824 trivial. 0 not checked. [2025-02-06 02:42:34,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:42:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 120 proven. 111 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-02-06 02:42:34,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689879118] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:42:34,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:42:34,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 02:42:34,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892130076] [2025-02-06 02:42:34,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:42:34,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:42:34,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:34,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:42:34,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:42:34,461 INFO L87 Difference]: Start difference. First operand 26306 states and 40779 transitions. Second operand has 8 states, 8 states have (on average 27.125) internal successors, (217), 8 states have internal predecessors, (217), 3 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 3 states have call predecessors, (163), 3 states have call successors, (163) [2025-02-06 02:42:35,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:35,597 INFO L93 Difference]: Finished difference Result 35950 states and 55354 transitions. [2025-02-06 02:42:35,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:42:35,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.125) internal successors, (217), 8 states have internal predecessors, (217), 3 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 3 states have call predecessors, (163), 3 states have call successors, (163) Word has length 544 [2025-02-06 02:42:35,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:35,632 INFO L225 Difference]: With dead ends: 35950 [2025-02-06 02:42:35,633 INFO L226 Difference]: Without dead ends: 9704 [2025-02-06 02:42:35,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1101 GetRequests, 1085 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:42:35,668 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 1039 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:35,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 900 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:42:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9704 states. [2025-02-06 02:42:36,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9704 to 7298. [2025-02-06 02:42:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7298 states, 5585 states have (on average 1.4254252461951655) internal successors, (7961), 5602 states have internal predecessors, (7961), 1525 states have call successors, (1525), 187 states have call predecessors, (1525), 187 states have return successors, (1525), 1508 states have call predecessors, (1525), 1525 states have call successors, (1525) [2025-02-06 02:42:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7298 states to 7298 states and 11011 transitions. [2025-02-06 02:42:36,187 INFO L78 Accepts]: Start accepts. Automaton has 7298 states and 11011 transitions. Word has length 544 [2025-02-06 02:42:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:36,188 INFO L471 AbstractCegarLoop]: Abstraction has 7298 states and 11011 transitions. [2025-02-06 02:42:36,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.125) internal successors, (217), 8 states have internal predecessors, (217), 3 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 3 states have call predecessors, (163), 3 states have call successors, (163) [2025-02-06 02:42:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 7298 states and 11011 transitions. [2025-02-06 02:42:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-02-06 02:42:36,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:36,193 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:36,204 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:42:36,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:36,394 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:36,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:36,394 INFO L85 PathProgramCache]: Analyzing trace with hash -362838628, now seen corresponding path program 1 times [2025-02-06 02:42:36,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:36,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633239099] [2025-02-06 02:42:36,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:36,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:36,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-02-06 02:42:36,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-02-06 02:42:36,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:36,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:37,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:37,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633239099] [2025-02-06 02:42:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633239099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:37,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:42:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057165561] [2025-02-06 02:42:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:37,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:42:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:37,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:42:37,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:42:37,068 INFO L87 Difference]: Start difference. First operand 7298 states and 11011 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:38,234 INFO L93 Difference]: Finished difference Result 18854 states and 28177 transitions. [2025-02-06 02:42:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:42:38,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 544 [2025-02-06 02:42:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:38,262 INFO L225 Difference]: With dead ends: 18854 [2025-02-06 02:42:38,262 INFO L226 Difference]: Without dead ends: 11616 [2025-02-06 02:42:38,274 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:42:38,274 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 613 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:38,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1075 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:42:38,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11616 states. [2025-02-06 02:42:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11616 to 7118. [2025-02-06 02:42:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7118 states, 5381 states have (on average 1.4081025831629808) internal successors, (7577), 5398 states have internal predecessors, (7577), 1525 states have call successors, (1525), 211 states have call predecessors, (1525), 211 states have return successors, (1525), 1508 states have call predecessors, (1525), 1525 states have call successors, (1525) [2025-02-06 02:42:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7118 states to 7118 states and 10627 transitions. [2025-02-06 02:42:38,794 INFO L78 Accepts]: Start accepts. Automaton has 7118 states and 10627 transitions. Word has length 544 [2025-02-06 02:42:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:38,794 INFO L471 AbstractCegarLoop]: Abstraction has 7118 states and 10627 transitions. [2025-02-06 02:42:38,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 7118 states and 10627 transitions. [2025-02-06 02:42:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:42:38,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:38,799 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:38,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 02:42:38,799 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:38,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash -824694261, now seen corresponding path program 1 times [2025-02-06 02:42:38,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:38,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412651711] [2025-02-06 02:42:38,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:38,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:38,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:42:39,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:42:39,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:39,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:39,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:39,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412651711] [2025-02-06 02:42:39,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412651711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:39,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:39,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:42:39,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065353547] [2025-02-06 02:42:39,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:39,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:42:39,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:39,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:42:39,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:42:39,580 INFO L87 Difference]: Start difference. First operand 7118 states and 10627 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:41,502 INFO L93 Difference]: Finished difference Result 26434 states and 40209 transitions. [2025-02-06 02:42:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 02:42:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 545 [2025-02-06 02:42:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:41,630 INFO L225 Difference]: With dead ends: 26434 [2025-02-06 02:42:41,630 INFO L226 Difference]: Without dead ends: 19376 [2025-02-06 02:42:41,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-02-06 02:42:41,641 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 3337 mSDsluCounter, 3038 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3337 SdHoareTripleChecker+Valid, 3624 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:41,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3337 Valid, 3624 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:42:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19376 states. [2025-02-06 02:42:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19376 to 12126. [2025-02-06 02:42:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12126 states, 10021 states have (on average 1.4678175830755413) internal successors, (14709), 10054 states have internal predecessors, (14709), 1861 states have call successors, (1861), 243 states have call predecessors, (1861), 243 states have return successors, (1861), 1828 states have call predecessors, (1861), 1861 states have call successors, (1861) [2025-02-06 02:42:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12126 states to 12126 states and 18431 transitions. [2025-02-06 02:42:42,390 INFO L78 Accepts]: Start accepts. Automaton has 12126 states and 18431 transitions. Word has length 545 [2025-02-06 02:42:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:42,391 INFO L471 AbstractCegarLoop]: Abstraction has 12126 states and 18431 transitions. [2025-02-06 02:42:42,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 12126 states and 18431 transitions. [2025-02-06 02:42:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:42:42,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:42,410 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:42,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 02:42:42,410 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:42,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1308369588, now seen corresponding path program 1 times [2025-02-06 02:42:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:42,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340411493] [2025-02-06 02:42:42,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:42,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:42:42,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:42:42,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:42,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:43,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:43,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340411493] [2025-02-06 02:42:43,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340411493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:43,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:43,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:42:43,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651348044] [2025-02-06 02:42:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:43,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:42:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:43,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:42:43,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:42:43,120 INFO L87 Difference]: Start difference. First operand 12126 states and 18431 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:44,602 INFO L93 Difference]: Finished difference Result 34331 states and 52478 transitions. [2025-02-06 02:42:44,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:42:44,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 545 [2025-02-06 02:42:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:44,649 INFO L225 Difference]: With dead ends: 34331 [2025-02-06 02:42:44,649 INFO L226 Difference]: Without dead ends: 22265 [2025-02-06 02:42:44,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:42:44,665 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 1023 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:44,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1173 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:42:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22265 states. [2025-02-06 02:42:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22265 to 16030. [2025-02-06 02:42:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16030 states, 13925 states have (on average 1.5084380610412926) internal successors, (21005), 13958 states have internal predecessors, (21005), 1861 states have call successors, (1861), 243 states have call predecessors, (1861), 243 states have return successors, (1861), 1828 states have call predecessors, (1861), 1861 states have call successors, (1861) [2025-02-06 02:42:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16030 states to 16030 states and 24727 transitions. [2025-02-06 02:42:45,795 INFO L78 Accepts]: Start accepts. Automaton has 16030 states and 24727 transitions. Word has length 545 [2025-02-06 02:42:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:45,796 INFO L471 AbstractCegarLoop]: Abstraction has 16030 states and 24727 transitions. [2025-02-06 02:42:45,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 16030 states and 24727 transitions. [2025-02-06 02:42:45,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:42:45,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:45,811 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:45,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 02:42:45,811 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:45,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:45,811 INFO L85 PathProgramCache]: Analyzing trace with hash -93102676, now seen corresponding path program 1 times [2025-02-06 02:42:45,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:45,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708389007] [2025-02-06 02:42:45,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:45,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:45,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:42:46,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:42:46,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:46,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 63 proven. 168 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-02-06 02:42:47,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:47,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708389007] [2025-02-06 02:42:47,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708389007] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:42:47,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971671362] [2025-02-06 02:42:47,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:47,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:47,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:47,549 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:42:47,550 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:42:47,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:42:47,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:42:47,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:47,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:47,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 02:42:47,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:42:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 6063 proven. 108 refuted. 0 times theorem prover too weak. 5841 trivial. 0 not checked. [2025-02-06 02:42:48,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:42:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 123 proven. 108 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-02-06 02:42:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971671362] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:42:49,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:42:49,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2025-02-06 02:42:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768975602] [2025-02-06 02:42:49,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:42:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 02:42:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:49,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 02:42:49,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:42:49,188 INFO L87 Difference]: Start difference. First operand 16030 states and 24727 transitions. Second operand has 21 states, 21 states have (on average 13.285714285714286) internal successors, (279), 21 states have internal predecessors, (279), 5 states have call successors, (234), 3 states have call predecessors, (234), 6 states have return successors, (234), 5 states have call predecessors, (234), 5 states have call successors, (234) [2025-02-06 02:42:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:52,443 INFO L93 Difference]: Finished difference Result 28932 states and 44131 transitions. [2025-02-06 02:42:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 02:42:52,444 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 13.285714285714286) internal successors, (279), 21 states have internal predecessors, (279), 5 states have call successors, (234), 3 states have call predecessors, (234), 6 states have return successors, (234), 5 states have call predecessors, (234), 5 states have call successors, (234) Word has length 545 [2025-02-06 02:42:52,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:52,485 INFO L225 Difference]: With dead ends: 28932 [2025-02-06 02:42:52,486 INFO L226 Difference]: Without dead ends: 12962 [2025-02-06 02:42:52,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1086 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=354, Invalid=1368, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 02:42:52,508 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1896 mSDsluCounter, 3522 mSDsCounter, 0 mSdLazyCounter, 4290 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 4879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 4290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:52,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 3982 Invalid, 4879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 4290 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 02:42:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12962 states. [2025-02-06 02:42:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12962 to 9014. [2025-02-06 02:42:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9014 states, 7261 states have (on average 1.4572372951384107) internal successors, (10581), 7278 states have internal predecessors, (10581), 1525 states have call successors, (1525), 227 states have call predecessors, (1525), 227 states have return successors, (1525), 1508 states have call predecessors, (1525), 1525 states have call successors, (1525) [2025-02-06 02:42:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9014 states to 9014 states and 13631 transitions. [2025-02-06 02:42:53,239 INFO L78 Accepts]: Start accepts. Automaton has 9014 states and 13631 transitions. Word has length 545 [2025-02-06 02:42:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:53,240 INFO L471 AbstractCegarLoop]: Abstraction has 9014 states and 13631 transitions. [2025-02-06 02:42:53,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.285714285714286) internal successors, (279), 21 states have internal predecessors, (279), 5 states have call successors, (234), 3 states have call predecessors, (234), 6 states have return successors, (234), 5 states have call predecessors, (234), 5 states have call successors, (234) [2025-02-06 02:42:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 9014 states and 13631 transitions. [2025-02-06 02:42:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:42:53,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:53,246 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:53,256 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:42:53,446 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,SelfDestructingSolverStorable23 [2025-02-06 02:42:53,447 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:53,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1191108204, now seen corresponding path program 1 times [2025-02-06 02:42:53,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:53,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697717275] [2025-02-06 02:42:53,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:53,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:53,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:42:53,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:42:53,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:53,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-02-06 02:42:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697717275] [2025-02-06 02:42:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697717275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:54,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:54,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:42:54,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105448034] [2025-02-06 02:42:54,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:54,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:42:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:54,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:42:54,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:42:54,108 INFO L87 Difference]: Start difference. First operand 9014 states and 13631 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:56,086 INFO L93 Difference]: Finished difference Result 32208 states and 48972 transitions. [2025-02-06 02:42:56,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:42:56,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 545 [2025-02-06 02:42:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:56,134 INFO L225 Difference]: With dead ends: 32208 [2025-02-06 02:42:56,134 INFO L226 Difference]: Without dead ends: 23254 [2025-02-06 02:42:56,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:42:56,150 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 2320 mSDsluCounter, 2085 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2320 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:56,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2320 Valid, 2679 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:42:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23254 states. [2025-02-06 02:42:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23254 to 16166. [2025-02-06 02:42:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16166 states, 13861 states have (on average 1.4888536180650747) internal successors, (20637), 13902 states have internal predecessors, (20637), 2029 states have call successors, (2029), 275 states have call predecessors, (2029), 275 states have return successors, (2029), 1988 states have call predecessors, (2029), 2029 states have call successors, (2029) [2025-02-06 02:42:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16166 states to 16166 states and 24695 transitions. [2025-02-06 02:42:57,148 INFO L78 Accepts]: Start accepts. Automaton has 16166 states and 24695 transitions. Word has length 545 [2025-02-06 02:42:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:57,149 INFO L471 AbstractCegarLoop]: Abstraction has 16166 states and 24695 transitions. [2025-02-06 02:42:57,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-02-06 02:42:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 16166 states and 24695 transitions. [2025-02-06 02:42:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:42:57,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:57,160 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:57,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 02:42:57,161 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:57,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:57,161 INFO L85 PathProgramCache]: Analyzing trace with hash 707432877, now seen corresponding path program 1 times [2025-02-06 02:42:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:57,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965668594] [2025-02-06 02:42:57,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:57,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:57,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:42:57,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:42:57,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:57,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 63 proven. 168 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-02-06 02:42:58,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:58,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965668594] [2025-02-06 02:42:58,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965668594] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:42:58,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086666464] [2025-02-06 02:42:58,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:58,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:58,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:58,416 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:42:58,417 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:42:58,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:42:58,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:42:58,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:58,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:58,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 02:42:58,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:42:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 3731 proven. 42 refuted. 0 times theorem prover too weak. 8239 trivial. 0 not checked. [2025-02-06 02:42:59,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:42:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 189 proven. 42 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-02-06 02:42:59,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086666464] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:42:59,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:42:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 18 [2025-02-06 02:42:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658904838] [2025-02-06 02:42:59,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:42:59,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 02:42:59,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:59,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 02:42:59,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-02-06 02:42:59,851 INFO L87 Difference]: Start difference. First operand 16166 states and 24695 transitions. Second operand has 18 states, 18 states have (on average 16.944444444444443) internal successors, (305), 18 states have internal predecessors, (305), 6 states have call successors, (234), 3 states have call predecessors, (234), 6 states have return successors, (234), 6 states have call predecessors, (234), 6 states have call successors, (234)