./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-63.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-500_file-63.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 ddb079fdd3784496be289fc7e9dce8b5519454d886eda78b14b11167cae45c0d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:59:45,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:59:45,979 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:59:45,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:59:45,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:59:45,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:59:45,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:59:45,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:59:45,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:59:45,998 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:59:45,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:59:45,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:59:45,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:59:45,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:59:45,998 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:59:45,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:59:45,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:59:45,999 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:59:45,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:59:45,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:59:45,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:59:45,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:59:46,000 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:46,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:59:46,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:59:46,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:59:46,001 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 -> ddb079fdd3784496be289fc7e9dce8b5519454d886eda78b14b11167cae45c0d [2025-02-05 21:59:46,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:59:46,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:59:46,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:59:46,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:59:46,208 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:59:46,209 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-500_file-63.i [2025-02-05 21:59:47,413 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89c20e49c/969cc9b00097404193cc11e3736dac0a/FLAG335086764 [2025-02-05 21:59:47,744 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:59:47,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-63.i [2025-02-05 21:59:47,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89c20e49c/969cc9b00097404193cc11e3736dac0a/FLAG335086764 [2025-02-05 21:59:47,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89c20e49c/969cc9b00097404193cc11e3736dac0a [2025-02-05 21:59:47,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:59:47,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:59:48,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:48,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:59:48,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:59:48,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:47" (1/1) ... [2025-02-05 21:59:48,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ace293c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48, skipping insertion in model container [2025-02-05 21:59:48,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:47" (1/1) ... [2025-02-05 21:59:48,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:59:48,141 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-500_file-63.i[916,929] [2025-02-05 21:59:48,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:48,256 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:59:48,263 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-500_file-63.i[916,929] [2025-02-05 21:59:48,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:48,333 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:59:48,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48 WrapperNode [2025-02-05 21:59:48,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:48,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:48,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:59:48,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:59:48,339 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:59:48" (1/1) ... [2025-02-05 21:59:48,350 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:59:48" (1/1) ... [2025-02-05 21:59:48,410 INFO L138 Inliner]: procedures = 26, calls = 109, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 914 [2025-02-05 21:59:48,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:48,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:59:48,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:59:48,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:59:48,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48" (1/1) ... [2025-02-05 21:59:48,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48" (1/1) ... [2025-02-05 21:59:48,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48" (1/1) ... [2025-02-05 21:59:48,462 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:59:48,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48" (1/1) ... [2025-02-05 21:59:48,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48" (1/1) ... [2025-02-05 21:59:48,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48" (1/1) ... [2025-02-05 21:59:48,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48" (1/1) ... [2025-02-05 21:59:48,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48" (1/1) ... [2025-02-05 21:59:48,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48" (1/1) ... [2025-02-05 21:59:48,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:59:48,518 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:59:48,519 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:59:48,519 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:59:48,520 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48" (1/1) ... [2025-02-05 21:59:48,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:48,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:48,549 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:59:48,553 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:59:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:59:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:59:48,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:59:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:59:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:59:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:59:48,747 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:59:48,748 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:59:49,598 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc property_#t~bitwise85#1;havoc property_#t~bitwise86#1;havoc property_#t~short87#1; [2025-02-05 21:59:49,796 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-02-05 21:59:49,796 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:59:49,839 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:59:49,843 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:59:49,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:49 BoogieIcfgContainer [2025-02-05 21:59:49,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:59:49,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:59:49,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:59:49,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:59:49,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:59:47" (1/3) ... [2025-02-05 21:59:49,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3094b608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:49, skipping insertion in model container [2025-02-05 21:59:49,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:48" (2/3) ... [2025-02-05 21:59:49,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3094b608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:49, skipping insertion in model container [2025-02-05 21:59:49,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:49" (3/3) ... [2025-02-05 21:59:49,852 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-63.i [2025-02-05 21:59:49,862 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:59:49,864 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-63.i that has 2 procedures, 367 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:59:49,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:59:49,932 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;@3021fbcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:59:49,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:59:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 367 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 269 states have internal predecessors, (427), 96 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-05 21:59:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:59:49,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:49,966 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:49,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:49,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:49,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1668344418, now seen corresponding path program 1 times [2025-02-05 21:59:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:49,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102840947] [2025-02-05 21:59:49,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:49,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:50,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:59:50,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:59:50,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:50,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2025-02-05 21:59:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102840947] [2025-02-05 21:59:50,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102840947] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:59:50,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457593017] [2025-02-05 21:59:50,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:50,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:59:50,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:50,507 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:59:50,517 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:59:50,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:59:50,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:59:50,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:50,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:50,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:59:50,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:59:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2025-02-05 21:59:50,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:59:50,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457593017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:50,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:59:50,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:59:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294111108] [2025-02-05 21:59:50,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:50,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:59:50,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:50,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:59:50,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:59:50,995 INFO L87 Difference]: Start difference. First operand has 367 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 269 states have internal predecessors, (427), 96 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-05 21:59:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:51,068 INFO L93 Difference]: Finished difference Result 727 states and 1327 transitions. [2025-02-05 21:59:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:59:51,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 2 states have call successors, (96) Word has length 641 [2025-02-05 21:59:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:51,077 INFO L225 Difference]: With dead ends: 727 [2025-02-05 21:59:51,078 INFO L226 Difference]: Without dead ends: 363 [2025-02-05 21:59:51,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 642 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:59:51,084 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:51,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-05 21:59:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-02-05 21:59:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 265 states have (on average 1.5660377358490567) internal successors, (415), 265 states have internal predecessors, (415), 96 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-05 21:59:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 607 transitions. [2025-02-05 21:59:51,145 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 607 transitions. Word has length 641 [2025-02-05 21:59:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:51,145 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 607 transitions. [2025-02-05 21:59:51,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-05 21:59:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 607 transitions. [2025-02-05 21:59:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:59:51,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:51,157 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:51,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:59:51,362 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:59:51,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:51,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:51,364 INFO L85 PathProgramCache]: Analyzing trace with hash 944262468, now seen corresponding path program 1 times [2025-02-05 21:59:51,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:51,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797749987] [2025-02-05 21:59:51,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:51,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:51,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:59:51,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:59:51,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:51,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 21:59:51,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:51,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797749987] [2025-02-05 21:59:51,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797749987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:51,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:51,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:51,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250764344] [2025-02-05 21:59:51,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:51,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:51,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:51,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:51,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:51,919 INFO L87 Difference]: Start difference. First operand 363 states and 607 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:52,046 INFO L93 Difference]: Finished difference Result 965 states and 1616 transitions. [2025-02-05 21:59:52,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:52,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-02-05 21:59:52,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:52,054 INFO L225 Difference]: With dead ends: 965 [2025-02-05 21:59:52,054 INFO L226 Difference]: Without dead ends: 605 [2025-02-05 21:59:52,055 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:59:52,055 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 396 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:52,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1401 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-02-05 21:59:52,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 602. [2025-02-05 21:59:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 465 states have (on average 1.5870967741935484) internal successors, (738), 466 states have internal predecessors, (738), 134 states have call successors, (134), 2 states have call predecessors, (134), 2 states have return successors, (134), 133 states have call predecessors, (134), 134 states have call successors, (134) [2025-02-05 21:59:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1006 transitions. [2025-02-05 21:59:52,102 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1006 transitions. Word has length 641 [2025-02-05 21:59:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:52,103 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 1006 transitions. [2025-02-05 21:59:52,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1006 transitions. [2025-02-05 21:59:52,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:59:52,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:52,112 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:52,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:59:52,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:52,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:52,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1700568029, now seen corresponding path program 1 times [2025-02-05 21:59:52,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:52,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514754966] [2025-02-05 21:59:52,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:52,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:52,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:59:52,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:59:52,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:52,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 21:59:52,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:52,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514754966] [2025-02-05 21:59:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514754966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:52,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:52,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336110643] [2025-02-05 21:59:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:52,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:52,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:52,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:52,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:52,553 INFO L87 Difference]: Start difference. First operand 602 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:52,640 INFO L93 Difference]: Finished difference Result 1203 states and 2013 transitions. [2025-02-05 21:59:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:52,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-02-05 21:59:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:52,649 INFO L225 Difference]: With dead ends: 1203 [2025-02-05 21:59:52,651 INFO L226 Difference]: Without dead ends: 604 [2025-02-05 21:59:52,653 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:59:52,653 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:52,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1155 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-02-05 21:59:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2025-02-05 21:59:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 467 states have (on average 1.5845824411134903) internal successors, (740), 468 states have internal predecessors, (740), 134 states have call successors, (134), 2 states have call predecessors, (134), 2 states have return successors, (134), 133 states have call predecessors, (134), 134 states have call successors, (134) [2025-02-05 21:59:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1008 transitions. [2025-02-05 21:59:52,708 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1008 transitions. Word has length 641 [2025-02-05 21:59:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:52,711 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 1008 transitions. [2025-02-05 21:59:52,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1008 transitions. [2025-02-05 21:59:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:59:52,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:52,716 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:52,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:59:52,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:52,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash 663780162, now seen corresponding path program 1 times [2025-02-05 21:59:52,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:52,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819101420] [2025-02-05 21:59:52,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:52,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:52,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:59:52,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:59:52,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:52,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 21:59:52,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:52,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819101420] [2025-02-05 21:59:52,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819101420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:52,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:52,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:52,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600159036] [2025-02-05 21:59:52,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:52,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:52,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:52,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:52,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:52,982 INFO L87 Difference]: Start difference. First operand 604 states and 1008 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:53,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:53,081 INFO L93 Difference]: Finished difference Result 1212 states and 2018 transitions. [2025-02-05 21:59:53,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:53,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-02-05 21:59:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:53,085 INFO L225 Difference]: With dead ends: 1212 [2025-02-05 21:59:53,085 INFO L226 Difference]: Without dead ends: 611 [2025-02-05 21:59:53,087 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:59:53,087 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 358 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:53,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1156 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-02-05 21:59:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 481. [2025-02-05 21:59:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 382 states have (on average 1.6073298429319371) internal successors, (614), 382 states have internal predecessors, (614), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-05 21:59:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 806 transitions. [2025-02-05 21:59:53,111 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 806 transitions. Word has length 641 [2025-02-05 21:59:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:53,112 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 806 transitions. [2025-02-05 21:59:53,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 806 transitions. [2025-02-05 21:59:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:59:53,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:53,117 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:53,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:59:53,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:53,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:53,118 INFO L85 PathProgramCache]: Analyzing trace with hash 787853409, now seen corresponding path program 1 times [2025-02-05 21:59:53,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:53,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003535400] [2025-02-05 21:59:53,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:53,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:53,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:59:53,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:59:53,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:53,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 21:59:53,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:53,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003535400] [2025-02-05 21:59:53,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003535400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:53,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:53,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:53,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461735290] [2025-02-05 21:59:53,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:53,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:53,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:53,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:53,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:53,412 INFO L87 Difference]: Start difference. First operand 481 states and 806 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:53,513 INFO L93 Difference]: Finished difference Result 1435 states and 2408 transitions. [2025-02-05 21:59:53,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:53,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-02-05 21:59:53,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:53,519 INFO L225 Difference]: With dead ends: 1435 [2025-02-05 21:59:53,519 INFO L226 Difference]: Without dead ends: 957 [2025-02-05 21:59:53,520 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:59:53,521 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 572 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:53,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1563 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2025-02-05 21:59:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 955. [2025-02-05 21:59:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 758 states have (on average 1.6055408970976253) internal successors, (1217), 758 states have internal predecessors, (1217), 192 states have call successors, (192), 4 states have call predecessors, (192), 4 states have return successors, (192), 192 states have call predecessors, (192), 192 states have call successors, (192) [2025-02-05 21:59:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1601 transitions. [2025-02-05 21:59:53,578 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1601 transitions. Word has length 641 [2025-02-05 21:59:53,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:53,579 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1601 transitions. [2025-02-05 21:59:53,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1601 transitions. [2025-02-05 21:59:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:59:53,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:53,583 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:53,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:59:53,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:53,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:53,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1813345408, now seen corresponding path program 1 times [2025-02-05 21:59:53,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:53,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395536282] [2025-02-05 21:59:53,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:53,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:53,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:59:53,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:59:53,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:53,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 21:59:53,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:53,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395536282] [2025-02-05 21:59:53,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395536282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:53,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:53,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:53,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194478662] [2025-02-05 21:59:53,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:53,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:53,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:53,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:53,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:53,831 INFO L87 Difference]: Start difference. First operand 955 states and 1601 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:53,966 INFO L93 Difference]: Finished difference Result 2851 states and 4783 transitions. [2025-02-05 21:59:53,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:53,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-02-05 21:59:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:53,976 INFO L225 Difference]: With dead ends: 2851 [2025-02-05 21:59:53,977 INFO L226 Difference]: Without dead ends: 1899 [2025-02-05 21:59:53,979 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:59:53,980 INFO L435 NwaCegarLoop]: 1120 mSDtfsCounter, 582 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:53,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 1684 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-02-05 21:59:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1877. [2025-02-05 21:59:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1484 states have (on average 1.5970350404312668) internal successors, (2370), 1484 states have internal predecessors, (2370), 384 states have call successors, (384), 8 states have call predecessors, (384), 8 states have return successors, (384), 384 states have call predecessors, (384), 384 states have call successors, (384) [2025-02-05 21:59:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 3138 transitions. [2025-02-05 21:59:54,059 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 3138 transitions. Word has length 641 [2025-02-05 21:59:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:54,059 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 3138 transitions. [2025-02-05 21:59:54,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 3138 transitions. [2025-02-05 21:59:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:59:54,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:54,064 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:54,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:59:54,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:54,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:54,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1137854655, now seen corresponding path program 1 times [2025-02-05 21:59:54,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:54,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762725077] [2025-02-05 21:59:54,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:54,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:54,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:59:54,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:59:54,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:54,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 21:59:54,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:54,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762725077] [2025-02-05 21:59:54,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762725077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:54,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:54,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:54,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318195213] [2025-02-05 21:59:54,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:54,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:54,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:54,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:54,301 INFO L87 Difference]: Start difference. First operand 1877 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:54,411 INFO L93 Difference]: Finished difference Result 3865 states and 6442 transitions. [2025-02-05 21:59:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:54,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-02-05 21:59:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:54,422 INFO L225 Difference]: With dead ends: 3865 [2025-02-05 21:59:54,422 INFO L226 Difference]: Without dead ends: 1991 [2025-02-05 21:59:54,425 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:59:54,426 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 33 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:54,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1161 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2025-02-05 21:59:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1929. [2025-02-05 21:59:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1536 states have (on average 1.5924479166666667) internal successors, (2446), 1536 states have internal predecessors, (2446), 384 states have call successors, (384), 8 states have call predecessors, (384), 8 states have return successors, (384), 384 states have call predecessors, (384), 384 states have call successors, (384) [2025-02-05 21:59:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3214 transitions. [2025-02-05 21:59:54,498 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3214 transitions. Word has length 641 [2025-02-05 21:59:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:54,498 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 3214 transitions. [2025-02-05 21:59:54,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3214 transitions. [2025-02-05 21:59:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:59:54,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:54,502 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:54,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:59:54,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:54,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:54,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1494091999, now seen corresponding path program 1 times [2025-02-05 21:59:54,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:54,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629105410] [2025-02-05 21:59:54,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:54,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:54,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:59:54,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:59:54,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:54,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 21:59:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:54,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629105410] [2025-02-05 21:59:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629105410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072343433] [2025-02-05 21:59:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:54,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:54,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:54,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:54,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:54,817 INFO L87 Difference]: Start difference. First operand 1929 states and 3214 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:55,105 INFO L93 Difference]: Finished difference Result 7109 states and 11862 transitions. [2025-02-05 21:59:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:59:55,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-02-05 21:59:55,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:55,127 INFO L225 Difference]: With dead ends: 7109 [2025-02-05 21:59:55,127 INFO L226 Difference]: Without dead ends: 5183 [2025-02-05 21:59:55,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:55,134 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 1227 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:55,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 2004 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:59:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2025-02-05 21:59:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 5165. [2025-02-05 21:59:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 4552 states have (on average 1.6282952548330405) internal successors, (7412), 4564 states have internal predecessors, (7412), 592 states have call successors, (592), 20 states have call predecessors, (592), 20 states have return successors, (592), 580 states have call predecessors, (592), 592 states have call successors, (592) [2025-02-05 21:59:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 8596 transitions. [2025-02-05 21:59:55,365 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 8596 transitions. Word has length 641 [2025-02-05 21:59:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:55,366 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 8596 transitions. [2025-02-05 21:59:55,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 8596 transitions. [2025-02-05 21:59:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:59:55,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:55,376 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:55,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:59:55,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:55,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1933823072, now seen corresponding path program 1 times [2025-02-05 21:59:55,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:55,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370633893] [2025-02-05 21:59:55,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:55,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:55,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:59:55,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:59:55,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:55,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 21:59:55,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:55,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370633893] [2025-02-05 21:59:55,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370633893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:55,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:55,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:55,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864532695] [2025-02-05 21:59:55,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:55,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:55,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:55,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:55,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:55,988 INFO L87 Difference]: Start difference. First operand 5165 states and 8596 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:56,230 INFO L93 Difference]: Finished difference Result 15489 states and 25782 transitions. [2025-02-05 21:59:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:56,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-02-05 21:59:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:56,273 INFO L225 Difference]: With dead ends: 15489 [2025-02-05 21:59:56,273 INFO L226 Difference]: Without dead ends: 10327 [2025-02-05 21:59:56,283 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:59:56,287 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 435 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:56,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1147 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10327 states. [2025-02-05 21:59:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10327 to 10293. [2025-02-05 21:59:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10293 states, 9068 states have (on average 1.624172915747684) internal successors, (14728), 9092 states have internal predecessors, (14728), 1184 states have call successors, (1184), 40 states have call predecessors, (1184), 40 states have return successors, (1184), 1160 states have call predecessors, (1184), 1184 states have call successors, (1184) [2025-02-05 21:59:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10293 states to 10293 states and 17096 transitions. [2025-02-05 21:59:56,647 INFO L78 Accepts]: Start accepts. Automaton has 10293 states and 17096 transitions. Word has length 641 [2025-02-05 21:59:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:56,648 INFO L471 AbstractCegarLoop]: Abstraction has 10293 states and 17096 transitions. [2025-02-05 21:59:56,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 10293 states and 17096 transitions. [2025-02-05 21:59:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-02-05 21:59:56,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:56,664 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:56,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:59:56,665 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:56,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash 521049187, now seen corresponding path program 1 times [2025-02-05 21:59:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:56,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373384538] [2025-02-05 21:59:56,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:56,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:56,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-02-05 21:59:56,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-02-05 21:59:56,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:56,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 21:59:57,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:57,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373384538] [2025-02-05 21:59:57,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373384538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:57,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:57,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636417561] [2025-02-05 21:59:57,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:57,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:57,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:57,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:57,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:57,053 INFO L87 Difference]: Start difference. First operand 10293 states and 17096 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:57,613 INFO L93 Difference]: Finished difference Result 30873 states and 51282 transitions. [2025-02-05 21:59:57,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:57,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 642 [2025-02-05 21:59:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:57,689 INFO L225 Difference]: With dead ends: 30873 [2025-02-05 21:59:57,689 INFO L226 Difference]: Without dead ends: 20583 [2025-02-05 21:59:57,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:57,713 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 418 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:57,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1150 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20583 states. [2025-02-05 21:59:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20583 to 20581. [2025-02-05 21:59:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20581 states, 18132 states have (on average 1.6216633575998236) internal successors, (29404), 18180 states have internal predecessors, (29404), 2368 states have call successors, (2368), 80 states have call predecessors, (2368), 80 states have return successors, (2368), 2320 states have call predecessors, (2368), 2368 states have call successors, (2368) [2025-02-05 21:59:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20581 states to 20581 states and 34140 transitions. [2025-02-05 21:59:58,544 INFO L78 Accepts]: Start accepts. Automaton has 20581 states and 34140 transitions. Word has length 642 [2025-02-05 21:59:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:58,545 INFO L471 AbstractCegarLoop]: Abstraction has 20581 states and 34140 transitions. [2025-02-05 21:59:58,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 20581 states and 34140 transitions. [2025-02-05 21:59:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 21:59:58,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:58,567 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:58,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:59:58,567 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:58,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:58,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2112634385, now seen corresponding path program 1 times [2025-02-05 21:59:58,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:58,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538720777] [2025-02-05 21:59:58,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:58,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:58,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:59:58,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:59:58,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:58,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 21:59:58,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:58,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538720777] [2025-02-05 21:59:58,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538720777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:58,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:58,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:58,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339394271] [2025-02-05 21:59:58,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:58,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:58,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:59,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:59,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:59,000 INFO L87 Difference]: Start difference. First operand 20581 states and 34140 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 21:59:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:59,680 INFO L93 Difference]: Finished difference Result 51473 states and 85434 transitions. [2025-02-05 21:59:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:59,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 643 [2025-02-05 21:59:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:59,772 INFO L225 Difference]: With dead ends: 51473 [2025-02-05 21:59:59,772 INFO L226 Difference]: Without dead ends: 30895 [2025-02-05 21:59:59,824 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:59:59,825 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 406 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1316 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:59:59,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1316 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30895 states. [2025-02-05 22:00:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30895 to 30893. [2025-02-05 22:00:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30893 states, 27220 states have (on average 1.620573108008817) internal successors, (44112), 27292 states have internal predecessors, (44112), 3552 states have call successors, (3552), 120 states have call predecessors, (3552), 120 states have return successors, (3552), 3480 states have call predecessors, (3552), 3552 states have call successors, (3552) [2025-02-05 22:00:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30893 states to 30893 states and 51216 transitions. [2025-02-05 22:00:00,853 INFO L78 Accepts]: Start accepts. Automaton has 30893 states and 51216 transitions. Word has length 643 [2025-02-05 22:00:00,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:00,855 INFO L471 AbstractCegarLoop]: Abstraction has 30893 states and 51216 transitions. [2025-02-05 22:00:00,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 22:00:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 30893 states and 51216 transitions. [2025-02-05 22:00:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 22:00:00,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:00,876 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:00:00,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:00:00,877 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:00,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:00,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1275989138, now seen corresponding path program 1 times [2025-02-05 22:00:00,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:00,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851340335] [2025-02-05 22:00:00,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:00,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:00,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 22:00:00,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 22:00:00,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:00,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 22:00:01,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:01,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851340335] [2025-02-05 22:00:01,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851340335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:01,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:01,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:00:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240768426] [2025-02-05 22:00:01,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:01,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:00:01,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:01,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:00:01,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:00:01,480 INFO L87 Difference]: Start difference. First operand 30893 states and 51216 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 22:00:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:02,689 INFO L93 Difference]: Finished difference Result 92673 states and 153642 transitions. [2025-02-05 22:00:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:00:02,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 643 [2025-02-05 22:00:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:02,897 INFO L225 Difference]: With dead ends: 92673 [2025-02-05 22:00:02,898 INFO L226 Difference]: Without dead ends: 61783 [2025-02-05 22:00:02,967 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 22:00:02,967 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 394 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:02,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1150 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:00:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61783 states. [2025-02-05 22:00:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61783 to 60197. [2025-02-05 22:00:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60197 states, 52852 states have (on average 1.6133353515477182) internal successors, (85268), 52996 states have internal predecessors, (85268), 7104 states have call successors, (7104), 240 states have call predecessors, (7104), 240 states have return successors, (7104), 6960 states have call predecessors, (7104), 7104 states have call successors, (7104) [2025-02-05 22:00:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60197 states to 60197 states and 99476 transitions. [2025-02-05 22:00:04,923 INFO L78 Accepts]: Start accepts. Automaton has 60197 states and 99476 transitions. Word has length 643 [2025-02-05 22:00:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:04,924 INFO L471 AbstractCegarLoop]: Abstraction has 60197 states and 99476 transitions. [2025-02-05 22:00:04,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 22:00:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 60197 states and 99476 transitions. [2025-02-05 22:00:04,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 22:00:04,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:04,963 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:00:04,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:00:04,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:04,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:04,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1960483092, now seen corresponding path program 1 times [2025-02-05 22:00:04,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:04,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223225906] [2025-02-05 22:00:04,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:04,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:04,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 22:00:05,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 22:00:05,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:05,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 22:00:05,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:05,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223225906] [2025-02-05 22:00:05,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223225906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:05,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:05,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:00:05,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135162527] [2025-02-05 22:00:05,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:05,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:00:05,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:05,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:00:05,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:00:05,602 INFO L87 Difference]: Start difference. First operand 60197 states and 99476 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 22:00:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:06,840 INFO L93 Difference]: Finished difference Result 120627 states and 199163 transitions. [2025-02-05 22:00:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:00:06,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 643 [2025-02-05 22:00:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:07,005 INFO L225 Difference]: With dead ends: 120627 [2025-02-05 22:00:07,005 INFO L226 Difference]: Without dead ends: 60433 [2025-02-05 22:00:07,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 22:00:07,085 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 391 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:07,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 908 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:00:07,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60433 states. [2025-02-05 22:00:08,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60433 to 60432. [2025-02-05 22:00:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60432 states, 53013 states have (on average 1.6087563427838454) internal successors, (85285), 53158 states have internal predecessors, (85285), 7130 states have call successors, (7130), 288 states have call predecessors, (7130), 288 states have return successors, (7130), 6985 states have call predecessors, (7130), 7130 states have call successors, (7130) [2025-02-05 22:00:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60432 states to 60432 states and 99545 transitions. [2025-02-05 22:00:08,936 INFO L78 Accepts]: Start accepts. Automaton has 60432 states and 99545 transitions. Word has length 643 [2025-02-05 22:00:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:08,937 INFO L471 AbstractCegarLoop]: Abstraction has 60432 states and 99545 transitions. [2025-02-05 22:00:08,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 22:00:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 60432 states and 99545 transitions. [2025-02-05 22:00:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-02-05 22:00:08,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:08,966 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:00:08,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:00:08,967 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:08,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:08,967 INFO L85 PathProgramCache]: Analyzing trace with hash -103753702, now seen corresponding path program 1 times [2025-02-05 22:00:08,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:08,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516740149] [2025-02-05 22:00:08,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:08,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:08,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-02-05 22:00:09,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-02-05 22:00:09,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:09,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 22:00:09,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:09,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516740149] [2025-02-05 22:00:09,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516740149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:09,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:09,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:00:09,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805141338] [2025-02-05 22:00:09,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:09,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:00:09,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:09,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:00:09,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:00:09,934 INFO L87 Difference]: Start difference. First operand 60432 states and 99545 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 22:00:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:13,784 INFO L93 Difference]: Finished difference Result 193864 states and 320076 transitions. [2025-02-05 22:00:13,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:00:13,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 644 [2025-02-05 22:00:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:14,187 INFO L225 Difference]: With dead ends: 193864 [2025-02-05 22:00:14,187 INFO L226 Difference]: Without dead ends: 133478 [2025-02-05 22:00:14,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:00:14,302 INFO L435 NwaCegarLoop]: 1649 mSDtfsCounter, 1605 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:14,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 2546 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:00:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133478 states. [2025-02-05 22:00:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133478 to 64488. [2025-02-05 22:00:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64488 states, 57056 states have (on average 1.6026360067302299) internal successors, (91440), 57201 states have internal predecessors, (91440), 7142 states have call successors, (7142), 289 states have call predecessors, (7142), 289 states have return successors, (7142), 6997 states have call predecessors, (7142), 7142 states have call successors, (7142) [2025-02-05 22:00:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64488 states to 64488 states and 105724 transitions. [2025-02-05 22:00:17,804 INFO L78 Accepts]: Start accepts. Automaton has 64488 states and 105724 transitions. Word has length 644 [2025-02-05 22:00:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:17,807 INFO L471 AbstractCegarLoop]: Abstraction has 64488 states and 105724 transitions. [2025-02-05 22:00:17,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 22:00:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 64488 states and 105724 transitions. [2025-02-05 22:00:17,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-02-05 22:00:17,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:17,839 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:00:17,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 22:00:17,840 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:17,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:17,842 INFO L85 PathProgramCache]: Analyzing trace with hash 673158825, now seen corresponding path program 1 times [2025-02-05 22:00:17,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:17,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032941313] [2025-02-05 22:00:17,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:17,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:17,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-02-05 22:00:17,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-02-05 22:00:17,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:17,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 22:00:18,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032941313] [2025-02-05 22:00:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032941313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:18,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:18,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 22:00:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292913458] [2025-02-05 22:00:18,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:18,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:00:18,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:18,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:00:18,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:00:18,772 INFO L87 Difference]: Start difference. First operand 64488 states and 105724 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 22:00:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:24,195 INFO L93 Difference]: Finished difference Result 186604 states and 306206 transitions. [2025-02-05 22:00:24,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:00:24,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 645 [2025-02-05 22:00:24,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:24,467 INFO L225 Difference]: With dead ends: 186604 [2025-02-05 22:00:24,468 INFO L226 Difference]: Without dead ends: 122186 [2025-02-05 22:00:24,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:00:24,586 INFO L435 NwaCegarLoop]: 1105 mSDtfsCounter, 1197 mSDsluCounter, 3076 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 4181 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:24,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 4181 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 22:00:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122186 states. [2025-02-05 22:00:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122186 to 66792. [2025-02-05 22:00:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66792 states, 59360 states have (on average 1.5954177897574124) internal successors, (94704), 59505 states have internal predecessors, (94704), 7142 states have call successors, (7142), 289 states have call predecessors, (7142), 289 states have return successors, (7142), 6997 states have call predecessors, (7142), 7142 states have call successors, (7142) [2025-02-05 22:00:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66792 states to 66792 states and 108988 transitions. [2025-02-05 22:00:29,143 INFO L78 Accepts]: Start accepts. Automaton has 66792 states and 108988 transitions. Word has length 645 [2025-02-05 22:00:29,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:29,144 INFO L471 AbstractCegarLoop]: Abstraction has 66792 states and 108988 transitions. [2025-02-05 22:00:29,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 22:00:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 66792 states and 108988 transitions. [2025-02-05 22:00:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2025-02-05 22:00:29,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:29,176 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:00:29,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 22:00:29,177 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:29,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash 677507576, now seen corresponding path program 1 times [2025-02-05 22:00:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338616785] [2025-02-05 22:00:29,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:29,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:29,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes. [2025-02-05 22:00:29,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements. [2025-02-05 22:00:29,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:29,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 22:00:29,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:29,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338616785] [2025-02-05 22:00:29,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338616785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:29,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:29,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:00:29,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444539082] [2025-02-05 22:00:29,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:29,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:00:29,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:29,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:00:29,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:00:29,965 INFO L87 Difference]: Start difference. First operand 66792 states and 108988 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 22:00:38,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:38,727 INFO L93 Difference]: Finished difference Result 260240 states and 418464 transitions. [2025-02-05 22:00:38,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:00:38,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 646 [2025-02-05 22:00:38,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:39,191 INFO L225 Difference]: With dead ends: 260240 [2025-02-05 22:00:39,192 INFO L226 Difference]: Without dead ends: 193518 [2025-02-05 22:00:39,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:00:39,314 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 1272 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:39,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 2536 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 22:00:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193518 states. [2025-02-05 22:00:46,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193518 to 112968. [2025-02-05 22:00:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112968 states, 99248 states have (on average 1.5710140254715461) internal successors, (155920), 99585 states have internal predecessors, (155920), 13142 states have call successors, (13142), 577 states have call predecessors, (13142), 577 states have return successors, (13142), 12805 states have call predecessors, (13142), 13142 states have call successors, (13142) [2025-02-05 22:00:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112968 states to 112968 states and 182204 transitions. [2025-02-05 22:00:46,711 INFO L78 Accepts]: Start accepts. Automaton has 112968 states and 182204 transitions. Word has length 646 [2025-02-05 22:00:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:46,712 INFO L471 AbstractCegarLoop]: Abstraction has 112968 states and 182204 transitions. [2025-02-05 22:00:46,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 22:00:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 112968 states and 182204 transitions. [2025-02-05 22:00:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2025-02-05 22:00:46,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:46,788 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:00:46,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 22:00:46,789 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:46,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1007273337, now seen corresponding path program 1 times [2025-02-05 22:00:46,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:46,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551287671] [2025-02-05 22:00:46,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:46,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:46,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes. [2025-02-05 22:00:46,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements. [2025-02-05 22:00:46,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:46,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-05 22:00:48,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:48,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551287671] [2025-02-05 22:00:48,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551287671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:48,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:48,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:00:48,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208534079] [2025-02-05 22:00:48,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:48,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:00:48,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:48,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:00:48,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:00:48,048 INFO L87 Difference]: Start difference. First operand 112968 states and 182204 transitions. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 22:00:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:52,866 INFO L93 Difference]: Finished difference Result 252752 states and 400784 transitions. [2025-02-05 22:00:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:00:52,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 646 [2025-02-05 22:00:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:53,179 INFO L225 Difference]: With dead ends: 252752 [2025-02-05 22:00:53,179 INFO L226 Difference]: Without dead ends: 139854 [2025-02-05 22:00:53,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:00:53,336 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 103 mSDsluCounter, 3388 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 3975 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:53,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 3975 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:00:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139854 states.