./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.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 19040c859ca30831fc6cd7ac759a469fd491f693781bcf5be67393e1fb0ba0e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:36:26,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:36:26,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:36:26,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:36:26,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:36:26,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:36:26,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:36:26,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:36:26,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:36:26,553 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:36:26,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:36:26,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:36:26,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:36:26,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:36:26,555 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:36:26,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:36:26,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:36:26,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:36:26,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:36:26,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:36:26,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:36:26,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:36:26,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:36:26,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:36:26,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:36:26,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:36:26,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:36:26,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:36:26,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:36:26,557 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 -> 19040c859ca30831fc6cd7ac759a469fd491f693781bcf5be67393e1fb0ba0e1 [2025-02-05 21:36:26,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:36:26,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:36:26,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:36:26,837 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:36:26,837 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:36:26,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i [2025-02-05 21:36:28,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38b67fda5/b0b931db630741ca935b7fa7131ad50d/FLAG9033fb3db [2025-02-05 21:36:28,513 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:36:28,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i [2025-02-05 21:36:28,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38b67fda5/b0b931db630741ca935b7fa7131ad50d/FLAG9033fb3db [2025-02-05 21:36:28,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38b67fda5/b0b931db630741ca935b7fa7131ad50d [2025-02-05 21:36:28,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:36:28,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:36:28,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:36:28,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:36:28,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:36:28,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:36:28" (1/1) ... [2025-02-05 21:36:28,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a328d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:28, skipping insertion in model container [2025-02-05 21:36:28,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:36:28" (1/1) ... [2025-02-05 21:36:28,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:36:28,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i[916,929] [2025-02-05 21:36:29,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:36:29,089 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:36:29,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i[916,929] [2025-02-05 21:36:29,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:36:29,196 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:36:29,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29 WrapperNode [2025-02-05 21:36:29,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:36:29,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:36:29,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:36:29,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:36:29,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (1/1) ... [2025-02-05 21:36:29,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (1/1) ... [2025-02-05 21:36:29,288 INFO L138 Inliner]: procedures = 26, calls = 88, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2025-02-05 21:36:29,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:36:29,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:36:29,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:36:29,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:36:29,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (1/1) ... [2025-02-05 21:36:29,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (1/1) ... [2025-02-05 21:36:29,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (1/1) ... [2025-02-05 21:36:29,337 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:36:29,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (1/1) ... [2025-02-05 21:36:29,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (1/1) ... [2025-02-05 21:36:29,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (1/1) ... [2025-02-05 21:36:29,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (1/1) ... [2025-02-05 21:36:29,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (1/1) ... [2025-02-05 21:36:29,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (1/1) ... [2025-02-05 21:36:29,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:36:29,377 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:36:29,377 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:36:29,377 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:36:29,378 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (1/1) ... [2025-02-05 21:36:29,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:36:29,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:36:29,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:36:29,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:36:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:36:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:36:29,442 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:36:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:36:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:36:29,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:36:29,554 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:36:29,556 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:36:30,322 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 21:36:30,322 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:36:30,354 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:36:30,354 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:36:30,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:36:30 BoogieIcfgContainer [2025-02-05 21:36:30,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:36:30,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:36:30,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:36:30,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:36:30,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:36:28" (1/3) ... [2025-02-05 21:36:30,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acee784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:36:30, skipping insertion in model container [2025-02-05 21:36:30,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:29" (2/3) ... [2025-02-05 21:36:30,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acee784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:36:30, skipping insertion in model container [2025-02-05 21:36:30,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:36:30" (3/3) ... [2025-02-05 21:36:30,371 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-51.i [2025-02-05 21:36:30,387 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:36:30,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-51.i that has 2 procedures, 221 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:36:30,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:36:30,477 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;@26b3119a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:36:30,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:36:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 143 states have (on average 1.5524475524475525) internal successors, (222), 144 states have internal predecessors, (222), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-05 21:36:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-02-05 21:36:30,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:30,507 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:36:30,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:30,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash 758045282, now seen corresponding path program 1 times [2025-02-05 21:36:30,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:30,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028344267] [2025-02-05 21:36:30,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:30,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:30,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-05 21:36:30,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-05 21:36:30,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:30,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-02-05 21:36:31,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:31,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028344267] [2025-02-05 21:36:31,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028344267] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:36:31,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491679352] [2025-02-05 21:36:31,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:31,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:31,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:36:31,214 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:36:31,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:36:31,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-05 21:36:31,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-05 21:36:31,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:31,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:31,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:36:31,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:36:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-02-05 21:36:31,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:36:31,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491679352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:31,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:36:31,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:36:31,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287437057] [2025-02-05 21:36:31,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:31,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:36:31,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:31,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:36:31,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:36:31,695 INFO L87 Difference]: Start difference. First operand has 221 states, 143 states have (on average 1.5524475524475525) internal successors, (222), 144 states have internal predecessors, (222), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-02-05 21:36:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:31,765 INFO L93 Difference]: Finished difference Result 436 states and 814 transitions. [2025-02-05 21:36:31,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:36:31,767 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) Word has length 473 [2025-02-05 21:36:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:31,777 INFO L225 Difference]: With dead ends: 436 [2025-02-05 21:36:31,777 INFO L226 Difference]: Without dead ends: 218 [2025-02-05 21:36:31,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:36:31,787 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:31,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:36:31,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-05 21:36:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-05 21:36:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 141 states have (on average 1.524822695035461) internal successors, (215), 141 states have internal predecessors, (215), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-05 21:36:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 365 transitions. [2025-02-05 21:36:31,862 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 365 transitions. Word has length 473 [2025-02-05 21:36:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:31,863 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 365 transitions. [2025-02-05 21:36:31,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-02-05 21:36:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 365 transitions. [2025-02-05 21:36:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-02-05 21:36:31,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:31,878 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:36:31,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:36:32,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:36:32,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:32,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:32,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1638964289, now seen corresponding path program 1 times [2025-02-05 21:36:32,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:32,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128142028] [2025-02-05 21:36:32,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:32,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:32,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-05 21:36:32,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-05 21:36:32,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:32,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:36:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:32,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128142028] [2025-02-05 21:36:32,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128142028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:32,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:32,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:36:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821830435] [2025-02-05 21:36:32,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:32,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:36:32,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:32,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:36:32,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:36:32,593 INFO L87 Difference]: Start difference. First operand 218 states and 365 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:32,715 INFO L93 Difference]: Finished difference Result 588 states and 989 transitions. [2025-02-05 21:36:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:36:32,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 473 [2025-02-05 21:36:32,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:32,724 INFO L225 Difference]: With dead ends: 588 [2025-02-05 21:36:32,725 INFO L226 Difference]: Without dead ends: 373 [2025-02-05 21:36:32,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:36:32,727 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 255 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:32,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 698 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:36:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-05 21:36:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 370. [2025-02-05 21:36:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 254 states have (on average 1.5551181102362204) internal successors, (395), 255 states have internal predecessors, (395), 113 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-02-05 21:36:32,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 621 transitions. [2025-02-05 21:36:32,793 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 621 transitions. Word has length 473 [2025-02-05 21:36:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:32,796 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 621 transitions. [2025-02-05 21:36:32,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 621 transitions. [2025-02-05 21:36:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-02-05 21:36:32,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:32,801 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:36:32,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:36:32,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:32,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:32,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1472655710, now seen corresponding path program 1 times [2025-02-05 21:36:32,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:32,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006667216] [2025-02-05 21:36:32,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:32,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:32,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-05 21:36:32,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-05 21:36:32,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:32,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:36:33,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006667216] [2025-02-05 21:36:33,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006667216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:33,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:33,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:36:33,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111638004] [2025-02-05 21:36:33,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:33,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:36:33,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:33,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:36:33,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:36:33,700 INFO L87 Difference]: Start difference. First operand 370 states and 621 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:35,149 INFO L93 Difference]: Finished difference Result 1930 states and 3245 transitions. [2025-02-05 21:36:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:36:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 473 [2025-02-05 21:36:35,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:35,171 INFO L225 Difference]: With dead ends: 1930 [2025-02-05 21:36:35,172 INFO L226 Difference]: Without dead ends: 1563 [2025-02-05 21:36:35,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:36:35,176 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 1307 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 2388 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:35,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 2388 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 21:36:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-02-05 21:36:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1545. [2025-02-05 21:36:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1096 states have (on average 1.573905109489051) internal successors, (1725), 1104 states have internal predecessors, (1725), 438 states have call successors, (438), 10 states have call predecessors, (438), 10 states have return successors, (438), 430 states have call predecessors, (438), 438 states have call successors, (438) [2025-02-05 21:36:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2601 transitions. [2025-02-05 21:36:35,423 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2601 transitions. Word has length 473 [2025-02-05 21:36:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:35,425 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2601 transitions. [2025-02-05 21:36:35,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2601 transitions. [2025-02-05 21:36:35,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-02-05 21:36:35,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:35,433 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:36:35,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:36:35,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:35,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:35,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1023959071, now seen corresponding path program 1 times [2025-02-05 21:36:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:35,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91135247] [2025-02-05 21:36:35,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:35,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:35,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-05 21:36:35,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-05 21:36:35,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:35,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:36:35,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:35,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91135247] [2025-02-05 21:36:35,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91135247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:35,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:35,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:36:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032239696] [2025-02-05 21:36:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:35,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:36:35,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:35,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:36:35,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:36:35,979 INFO L87 Difference]: Start difference. First operand 1545 states and 2601 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:37,045 INFO L93 Difference]: Finished difference Result 5731 states and 9591 transitions. [2025-02-05 21:36:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:36:37,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 473 [2025-02-05 21:36:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:37,082 INFO L225 Difference]: With dead ends: 5731 [2025-02-05 21:36:37,083 INFO L226 Difference]: Without dead ends: 4189 [2025-02-05 21:36:37,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:36:37,092 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 739 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:37,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1287 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:36:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4189 states. [2025-02-05 21:36:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4189 to 3078. [2025-02-05 21:36:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 2160 states have (on average 1.5537037037037038) internal successors, (3356), 2179 states have internal predecessors, (3356), 895 states have call successors, (895), 22 states have call predecessors, (895), 22 states have return successors, (895), 876 states have call predecessors, (895), 895 states have call successors, (895) [2025-02-05 21:36:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 5146 transitions. [2025-02-05 21:36:37,558 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 5146 transitions. Word has length 473 [2025-02-05 21:36:37,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:37,559 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 5146 transitions. [2025-02-05 21:36:37,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 5146 transitions. [2025-02-05 21:36:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-02-05 21:36:37,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:37,569 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:36:37,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:36:37,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:37,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:37,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1351114291, now seen corresponding path program 1 times [2025-02-05 21:36:37,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:37,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321055815] [2025-02-05 21:36:37,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:37,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:37,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-02-05 21:36:37,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-02-05 21:36:37,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:37,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:36:38,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:38,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321055815] [2025-02-05 21:36:38,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321055815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:38,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:38,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:36:38,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347904694] [2025-02-05 21:36:38,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:38,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:36:38,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:38,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:36:38,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:36:38,107 INFO L87 Difference]: Start difference. First operand 3078 states and 5146 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:38,634 INFO L93 Difference]: Finished difference Result 7454 states and 12531 transitions. [2025-02-05 21:36:38,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:36:38,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 474 [2025-02-05 21:36:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:38,666 INFO L225 Difference]: With dead ends: 7454 [2025-02-05 21:36:38,667 INFO L226 Difference]: Without dead ends: 4379 [2025-02-05 21:36:38,680 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-05 21:36:38,681 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 326 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:38,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1053 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:36:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4379 states. [2025-02-05 21:36:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4379 to 4035. [2025-02-05 21:36:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4035 states, 3039 states have (on average 1.6028298782494241) internal successors, (4871), 3058 states have internal predecessors, (4871), 970 states have call successors, (970), 25 states have call predecessors, (970), 25 states have return successors, (970), 951 states have call predecessors, (970), 970 states have call successors, (970) [2025-02-05 21:36:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 6811 transitions. [2025-02-05 21:36:39,107 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 6811 transitions. Word has length 474 [2025-02-05 21:36:39,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:39,110 INFO L471 AbstractCegarLoop]: Abstraction has 4035 states and 6811 transitions. [2025-02-05 21:36:39,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 6811 transitions. [2025-02-05 21:36:39,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-02-05 21:36:39,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:39,119 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:36:39,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:36:39,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:39,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:39,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2040459573, now seen corresponding path program 1 times [2025-02-05 21:36:39,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:39,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663529664] [2025-02-05 21:36:39,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:39,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:39,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-02-05 21:36:39,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-02-05 21:36:39,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:39,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:36:39,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:39,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663529664] [2025-02-05 21:36:39,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663529664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:39,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:39,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:36:39,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904843893] [2025-02-05 21:36:39,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:39,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:36:39,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:39,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:36:39,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:36:39,766 INFO L87 Difference]: Start difference. First operand 4035 states and 6811 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:40,241 INFO L93 Difference]: Finished difference Result 9278 states and 15604 transitions. [2025-02-05 21:36:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:36:40,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 475 [2025-02-05 21:36:40,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:40,288 INFO L225 Difference]: With dead ends: 9278 [2025-02-05 21:36:40,289 INFO L226 Difference]: Without dead ends: 5955 [2025-02-05 21:36:40,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:36:40,306 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 232 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:40,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1019 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:36:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2025-02-05 21:36:40,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 5950. [2025-02-05 21:36:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5950 states, 4497 states have (on average 1.601067378252168) internal successors, (7200), 4528 states have internal predecessors, (7200), 1408 states have call successors, (1408), 44 states have call predecessors, (1408), 44 states have return successors, (1408), 1377 states have call predecessors, (1408), 1408 states have call successors, (1408) [2025-02-05 21:36:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5950 states to 5950 states and 10016 transitions. [2025-02-05 21:36:40,804 INFO L78 Accepts]: Start accepts. Automaton has 5950 states and 10016 transitions. Word has length 475 [2025-02-05 21:36:40,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:40,806 INFO L471 AbstractCegarLoop]: Abstraction has 5950 states and 10016 transitions. [2025-02-05 21:36:40,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 5950 states and 10016 transitions. [2025-02-05 21:36:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-02-05 21:36:40,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:40,815 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:36:40,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:36:40,815 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:40,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1229015724, now seen corresponding path program 1 times [2025-02-05 21:36:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:40,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854007791] [2025-02-05 21:36:40,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:40,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-02-05 21:36:40,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-02-05 21:36:40,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:40,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:36:41,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854007791] [2025-02-05 21:36:41,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854007791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:41,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:41,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:36:41,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163286325] [2025-02-05 21:36:41,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:41,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:36:41,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:41,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:36:41,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:36:41,544 INFO L87 Difference]: Start difference. First operand 5950 states and 10016 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:42,673 INFO L93 Difference]: Finished difference Result 15298 states and 25509 transitions. [2025-02-05 21:36:42,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:36:42,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 475 [2025-02-05 21:36:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:42,746 INFO L225 Difference]: With dead ends: 15298 [2025-02-05 21:36:42,746 INFO L226 Difference]: Without dead ends: 10710 [2025-02-05 21:36:42,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:36:42,770 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 337 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:42,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1266 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:36:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10710 states. [2025-02-05 21:36:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10710 to 10536. [2025-02-05 21:36:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10536 states, 7710 states have (on average 1.5749675745784695) internal successors, (12143), 7772 states have internal predecessors, (12143), 2741 states have call successors, (2741), 84 states have call predecessors, (2741), 84 states have return successors, (2741), 2679 states have call predecessors, (2741), 2741 states have call successors, (2741) [2025-02-05 21:36:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10536 states to 10536 states and 17625 transitions. [2025-02-05 21:36:43,923 INFO L78 Accepts]: Start accepts. Automaton has 10536 states and 17625 transitions. Word has length 475 [2025-02-05 21:36:43,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:43,925 INFO L471 AbstractCegarLoop]: Abstraction has 10536 states and 17625 transitions. [2025-02-05 21:36:43,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 10536 states and 17625 transitions. [2025-02-05 21:36:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 21:36:43,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:43,939 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:36:43,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:36:43,940 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:43,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:43,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1832670708, now seen corresponding path program 1 times [2025-02-05 21:36:43,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:43,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130273839] [2025-02-05 21:36:43,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:43,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:36:44,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:36:44,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:44,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:36:44,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:44,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130273839] [2025-02-05 21:36:44,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130273839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:44,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:44,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:36:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009211244] [2025-02-05 21:36:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:44,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:36:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:44,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:36:44,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:36:44,469 INFO L87 Difference]: Start difference. First operand 10536 states and 17625 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-02-05 21:36:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:45,965 INFO L93 Difference]: Finished difference Result 28884 states and 48131 transitions. [2025-02-05 21:36:45,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:36:45,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 476 [2025-02-05 21:36:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:46,078 INFO L225 Difference]: With dead ends: 28884 [2025-02-05 21:36:46,079 INFO L226 Difference]: Without dead ends: 19710 [2025-02-05 21:36:46,117 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-05 21:36:46,118 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 332 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:46,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1036 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:36:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19710 states. [2025-02-05 21:36:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19710 to 19708. [2025-02-05 21:36:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19708 states, 14136 states have (on average 1.5559564233163554) internal successors, (21995), 14260 states have internal predecessors, (21995), 5407 states have call successors, (5407), 164 states have call predecessors, (5407), 164 states have return successors, (5407), 5283 states have call predecessors, (5407), 5407 states have call successors, (5407) [2025-02-05 21:36:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19708 states to 19708 states and 32809 transitions. [2025-02-05 21:36:48,223 INFO L78 Accepts]: Start accepts. Automaton has 19708 states and 32809 transitions. Word has length 476 [2025-02-05 21:36:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:48,225 INFO L471 AbstractCegarLoop]: Abstraction has 19708 states and 32809 transitions. [2025-02-05 21:36:48,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-02-05 21:36:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 19708 states and 32809 transitions. [2025-02-05 21:36:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 21:36:48,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:48,234 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:36:48,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:36:48,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:48,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:48,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1636157203, now seen corresponding path program 1 times [2025-02-05 21:36:48,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:48,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381837526] [2025-02-05 21:36:48,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:48,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:48,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:36:48,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:36:48,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:48,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:36:48,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381837526] [2025-02-05 21:36:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381837526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:48,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:48,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:36:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131646040] [2025-02-05 21:36:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:48,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:36:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:48,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:36:48,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:36:48,579 INFO L87 Difference]: Start difference. First operand 19708 states and 32809 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:49,627 INFO L93 Difference]: Finished difference Result 38394 states and 63824 transitions. [2025-02-05 21:36:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:36:49,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 476 [2025-02-05 21:36:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:49,737 INFO L225 Difference]: With dead ends: 38394 [2025-02-05 21:36:49,737 INFO L226 Difference]: Without dead ends: 20048 [2025-02-05 21:36:49,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:36:49,806 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 17 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:49,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 721 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:36:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20048 states. [2025-02-05 21:36:51,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20048 to 19708. [2025-02-05 21:36:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19708 states, 14136 states have (on average 1.546335597057159) internal successors, (21859), 14260 states have internal predecessors, (21859), 5407 states have call successors, (5407), 164 states have call predecessors, (5407), 164 states have return successors, (5407), 5283 states have call predecessors, (5407), 5407 states have call successors, (5407) [2025-02-05 21:36:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19708 states to 19708 states and 32673 transitions. [2025-02-05 21:36:51,568 INFO L78 Accepts]: Start accepts. Automaton has 19708 states and 32673 transitions. Word has length 476 [2025-02-05 21:36:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:51,569 INFO L471 AbstractCegarLoop]: Abstraction has 19708 states and 32673 transitions. [2025-02-05 21:36:51,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:36:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 19708 states and 32673 transitions. [2025-02-05 21:36:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-05 21:36:51,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:51,576 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:36:51,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:36:51,577 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:51,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:51,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1201576365, now seen corresponding path program 1 times [2025-02-05 21:36:51,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:51,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977936493] [2025-02-05 21:36:51,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:51,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:51,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-05 21:36:51,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-05 21:36:51,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:51,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-02-05 21:36:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977936493] [2025-02-05 21:36:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977936493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:36:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175294297] [2025-02-05 21:36:52,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:52,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:52,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:36:52,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:36:52,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:36:52,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-05 21:36:52,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-05 21:36:52,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:52,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:52,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:36:52,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:36:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 2202 proven. 198 refuted. 0 times theorem prover too weak. 8700 trivial. 0 not checked. [2025-02-05 21:36:53,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:36:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-02-05 21:36:53,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175294297] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:36:53,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:36:53,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 21:36:53,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101650219] [2025-02-05 21:36:53,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:36:53,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:36:53,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:53,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:36:53,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:36:53,673 INFO L87 Difference]: Start difference. First operand 19708 states and 32673 transitions. Second operand has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) [2025-02-05 21:36:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:55,828 INFO L93 Difference]: Finished difference Result 29758 states and 48597 transitions. [2025-02-05 21:36:55,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:36:55,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) Word has length 477 [2025-02-05 21:36:55,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:55,940 INFO L225 Difference]: With dead ends: 29758 [2025-02-05 21:36:55,940 INFO L226 Difference]: Without dead ends: 20584 [2025-02-05 21:36:55,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 951 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:36:55,977 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 135 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:55,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 674 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:36:55,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20584 states. [2025-02-05 21:36:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20584 to 10812. [2025-02-05 21:36:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10812 states, 7917 states have (on average 1.5427560944802323) internal successors, (12214), 7979 states have internal predecessors, (12214), 2741 states have call successors, (2741), 153 states have call predecessors, (2741), 153 states have return successors, (2741), 2679 states have call predecessors, (2741), 2741 states have call successors, (2741) [2025-02-05 21:36:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10812 states to 10812 states and 17696 transitions. [2025-02-05 21:36:57,206 INFO L78 Accepts]: Start accepts. Automaton has 10812 states and 17696 transitions. Word has length 477 [2025-02-05 21:36:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:57,207 INFO L471 AbstractCegarLoop]: Abstraction has 10812 states and 17696 transitions. [2025-02-05 21:36:57,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) [2025-02-05 21:36:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 10812 states and 17696 transitions. [2025-02-05 21:36:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-05 21:36:57,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:57,213 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:36:57,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 21:36:57,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:57,414 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:57,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:57,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1398089870, now seen corresponding path program 1 times [2025-02-05 21:36:57,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:57,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074547032] [2025-02-05 21:36:57,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:57,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:57,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-05 21:36:57,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-05 21:36:57,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:57,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 54 proven. 168 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-02-05 21:36:58,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:58,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074547032] [2025-02-05 21:36:58,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074547032] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:36:58,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507115063] [2025-02-05 21:36:58,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:58,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:58,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:36:58,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:36:58,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 21:36:58,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-05 21:36:58,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-05 21:36:58,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:58,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:58,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 21:36:58,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:36:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 5627 proven. 162 refuted. 0 times theorem prover too weak. 5311 trivial. 0 not checked. [2025-02-05 21:36:59,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:37:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 276 proven. 165 refuted. 0 times theorem prover too weak. 10659 trivial. 0 not checked. [2025-02-05 21:37:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507115063] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:37:00,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:37:00,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 16 [2025-02-05 21:37:00,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107079290] [2025-02-05 21:37:00,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:37:00,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:37:00,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:00,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:37:00,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:37:00,071 INFO L87 Difference]: Start difference. First operand 10812 states and 17696 transitions. Second operand has 16 states, 16 states have (on average 13.6875) internal successors, (219), 16 states have internal predecessors, (219), 4 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) [2025-02-05 21:37:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:05,717 INFO L93 Difference]: Finished difference Result 48538 states and 76068 transitions. [2025-02-05 21:37:05,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-02-05 21:37:05,717 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 13.6875) internal successors, (219), 16 states have internal predecessors, (219), 4 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) Word has length 477 [2025-02-05 21:37:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:05,918 INFO L225 Difference]: With dead ends: 48538 [2025-02-05 21:37:05,918 INFO L226 Difference]: Without dead ends: 38290 [2025-02-05 21:37:05,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 952 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1417, Invalid=4745, Unknown=0, NotChecked=0, Total=6162 [2025-02-05 21:37:05,970 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 1688 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 1070 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 2262 SdHoareTripleChecker+Invalid, 3525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1070 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:05,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1692 Valid, 2262 Invalid, 3525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1070 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 21:37:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38290 states. [2025-02-05 21:37:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38290 to 25268. [2025-02-05 21:37:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25268 states, 18036 states have (on average 1.4555333776890662) internal successors, (26252), 18228 states have internal predecessors, (26252), 6563 states have call successors, (6563), 668 states have call predecessors, (6563), 668 states have return successors, (6563), 6371 states have call predecessors, (6563), 6563 states have call successors, (6563) [2025-02-05 21:37:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25268 states to 25268 states and 39378 transitions. [2025-02-05 21:37:09,560 INFO L78 Accepts]: Start accepts. Automaton has 25268 states and 39378 transitions. Word has length 477 [2025-02-05 21:37:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:09,561 INFO L471 AbstractCegarLoop]: Abstraction has 25268 states and 39378 transitions. [2025-02-05 21:37:09,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.6875) internal successors, (219), 16 states have internal predecessors, (219), 4 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) [2025-02-05 21:37:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 25268 states and 39378 transitions. [2025-02-05 21:37:09,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-05 21:37:09,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:09,571 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:09,581 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-05 21:37:09,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:37:09,772 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:09,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1541761459, now seen corresponding path program 1 times [2025-02-05 21:37:09,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:09,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980923017] [2025-02-05 21:37:09,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:09,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:09,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-05 21:37:09,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-05 21:37:09,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:09,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:37:10,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:10,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980923017] [2025-02-05 21:37:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980923017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:10,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:10,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:37:10,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88904919] [2025-02-05 21:37:10,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:10,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:37:10,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:10,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:37:10,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:10,032 INFO L87 Difference]: Start difference. First operand 25268 states and 39378 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:37:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:13,436 INFO L93 Difference]: Finished difference Result 60900 states and 94606 transitions. [2025-02-05 21:37:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:37:13,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 478 [2025-02-05 21:37:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:13,885 INFO L225 Difference]: With dead ends: 60900 [2025-02-05 21:37:13,886 INFO L226 Difference]: Without dead ends: 37542 [2025-02-05 21:37:13,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:13,942 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 212 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:13,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 693 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:37:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37542 states. [2025-02-05 21:37:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37542 to 37540. [2025-02-05 21:37:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37540 states, 26734 states have (on average 1.4509613226602829) internal successors, (38790), 27022 states have internal predecessors, (38790), 9807 states have call successors, (9807), 998 states have call predecessors, (9807), 998 states have return successors, (9807), 9519 states have call predecessors, (9807), 9807 states have call successors, (9807) [2025-02-05 21:37:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37540 states to 37540 states and 58404 transitions. [2025-02-05 21:37:18,400 INFO L78 Accepts]: Start accepts. Automaton has 37540 states and 58404 transitions. Word has length 478 [2025-02-05 21:37:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:18,401 INFO L471 AbstractCegarLoop]: Abstraction has 37540 states and 58404 transitions. [2025-02-05 21:37:18,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:37:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 37540 states and 58404 transitions. [2025-02-05 21:37:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-05 21:37:18,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:18,411 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:18,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:37:18,411 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:18,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1034225307, now seen corresponding path program 1 times [2025-02-05 21:37:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:18,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206288940] [2025-02-05 21:37:18,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:18,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:18,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-05 21:37:18,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-05 21:37:18,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:18,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:37:18,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:18,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206288940] [2025-02-05 21:37:18,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206288940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:18,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:18,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:37:18,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679725351] [2025-02-05 21:37:18,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:18,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:37:18,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:18,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:37:18,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:18,547 INFO L87 Difference]: Start difference. First operand 37540 states and 58404 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:37:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:22,185 INFO L93 Difference]: Finished difference Result 78860 states and 121929 transitions. [2025-02-05 21:37:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:37:22,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 478 [2025-02-05 21:37:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:22,434 INFO L225 Difference]: With dead ends: 78860 [2025-02-05 21:37:22,434 INFO L226 Difference]: Without dead ends: 42488 [2025-02-05 21:37:22,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:22,554 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 239 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:22,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 701 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:37:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42488 states. [2025-02-05 21:37:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42488 to 42254. [2025-02-05 21:37:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42254 states, 29695 states have (on average 1.4310489981478363) internal successors, (42495), 30019 states have internal predecessors, (42495), 11307 states have call successors, (11307), 1251 states have call predecessors, (11307), 1251 states have return successors, (11307), 10983 states have call predecessors, (11307), 11307 states have call successors, (11307) [2025-02-05 21:37:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42254 states to 42254 states and 65109 transitions. [2025-02-05 21:37:27,157 INFO L78 Accepts]: Start accepts. Automaton has 42254 states and 65109 transitions. Word has length 478 [2025-02-05 21:37:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:27,158 INFO L471 AbstractCegarLoop]: Abstraction has 42254 states and 65109 transitions. [2025-02-05 21:37:27,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:37:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 42254 states and 65109 transitions. [2025-02-05 21:37:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-05 21:37:27,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:27,166 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:27,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:37:27,166 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:27,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash 236197076, now seen corresponding path program 1 times [2025-02-05 21:37:27,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:27,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805486206] [2025-02-05 21:37:27,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:27,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:27,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-05 21:37:27,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-05 21:37:27,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:27,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:37:28,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:28,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805486206] [2025-02-05 21:37:28,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805486206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:28,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:28,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:37:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755672663] [2025-02-05 21:37:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:28,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:37:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:28,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:37:28,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:37:28,827 INFO L87 Difference]: Start difference. First operand 42254 states and 65109 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75)