./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-22.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-22.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 ae10f7a0aac4ff5642a6d224665fe38f2df489ec0407dcdcfbdd7d0fdf46302b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:55:58,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:55:58,054 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:55:58,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:55:58,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:55:58,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:55:58,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:55:58,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:55:58,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:55:58,074 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:55:58,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:55:58,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:55:58,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:55:58,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:55:58,075 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:55:58,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:55:58,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:55:58,075 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:55:58,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:55:58,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:55:58,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:55:58,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:55:58,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:55:58,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:55:58,076 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:55:58,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:55:58,076 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:55:58,076 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:55:58,076 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:55:58,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:55:58,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:55:58,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:55:58,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:55:58,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:55:58,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:55:58,077 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:55:58,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:55:58,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:55:58,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:55:58,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:55:58,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:55:58,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:55:58,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:55:58,077 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 -> ae10f7a0aac4ff5642a6d224665fe38f2df489ec0407dcdcfbdd7d0fdf46302b [2025-02-05 21:55:58,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:55:58,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:55:58,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:55:58,287 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:55:58,287 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:55:58,288 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-22.i [2025-02-05 21:55:59,458 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ea5b7667/7e18fe86ba6449a28ee1154c2537cff1/FLAG23c2e6a3e [2025-02-05 21:55:59,811 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:55:59,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-22.i [2025-02-05 21:55:59,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ea5b7667/7e18fe86ba6449a28ee1154c2537cff1/FLAG23c2e6a3e [2025-02-05 21:56:00,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ea5b7667/7e18fe86ba6449a28ee1154c2537cff1 [2025-02-05 21:56:00,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:56:00,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:56:00,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:00,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:56:00,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:56:00,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53da7ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00, skipping insertion in model container [2025-02-05 21:56:00,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:56:00,207 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-22.i[916,929] [2025-02-05 21:56:00,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:00,347 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:56:00,357 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-22.i[916,929] [2025-02-05 21:56:00,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:00,449 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:56:00,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00 WrapperNode [2025-02-05 21:56:00,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:00,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:00,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:56:00,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:56:00,455 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:56:00" (1/1) ... [2025-02-05 21:56:00,468 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:56:00" (1/1) ... [2025-02-05 21:56:00,523 INFO L138 Inliner]: procedures = 26, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 942 [2025-02-05 21:56:00,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:00,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:56:00,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:56:00,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:56:00,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,575 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:56:00,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,610 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:56:00,644 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:56:00,644 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:56:00,645 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:56:00,646 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (1/1) ... [2025-02-05 21:56:00,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:00,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:00,674 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:56:00,681 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:56:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:56:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:56:00,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:56:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:56:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:56:00,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:56:00,806 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:56:00,807 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:56:01,632 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: havoc property_#t~bitwise93#1;havoc property_#t~short94#1; [2025-02-05 21:56:01,878 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-05 21:56:01,878 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:56:01,909 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:56:01,909 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:56:01,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:01 BoogieIcfgContainer [2025-02-05 21:56:01,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:56:01,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:56:01,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:56:01,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:56:01,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:56:00" (1/3) ... [2025-02-05 21:56:01,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5f62f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:01, skipping insertion in model container [2025-02-05 21:56:01,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:00" (2/3) ... [2025-02-05 21:56:01,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5f62f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:01, skipping insertion in model container [2025-02-05 21:56:01,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:01" (3/3) ... [2025-02-05 21:56:01,916 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-22.i [2025-02-05 21:56:01,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:56:01,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-22.i that has 2 procedures, 391 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:56:01,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:56:01,995 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;@53ee2a1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:56:01,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:56:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 391 states, 265 states have (on average 1.5849056603773586) internal successors, (420), 266 states have internal predecessors, (420), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2025-02-05 21:56:02,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-02-05 21:56:02,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:02,028 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:02,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:02,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:02,032 INFO L85 PathProgramCache]: Analyzing trace with hash 474364758, now seen corresponding path program 1 times [2025-02-05 21:56:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:02,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452770924] [2025-02-05 21:56:02,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:02,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 21:56:02,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 21:56:02,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:02,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 29768 trivial. 0 not checked. [2025-02-05 21:56:02,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:02,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452770924] [2025-02-05 21:56:02,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452770924] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:56:02,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923076374] [2025-02-05 21:56:02,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:02,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:56:02,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:02,677 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:56:02,678 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:56:02,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 21:56:03,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 21:56:03,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:03,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:03,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 1730 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:56:03,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:56:03,086 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 29768 trivial. 0 not checked. [2025-02-05 21:56:03,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:56:03,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923076374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:03,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:56:03,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:56:03,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037702709] [2025-02-05 21:56:03,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:03,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:56:03,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:03,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:56:03,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:56:03,112 INFO L87 Difference]: Start difference. First operand has 391 states, 265 states have (on average 1.5849056603773586) internal successors, (420), 266 states have internal predecessors, (420), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) Second operand has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) [2025-02-05 21:56:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:03,183 INFO L93 Difference]: Finished difference Result 776 states and 1450 transitions. [2025-02-05 21:56:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:56:03,185 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) Word has length 777 [2025-02-05 21:56:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:03,196 INFO L225 Difference]: With dead ends: 776 [2025-02-05 21:56:03,196 INFO L226 Difference]: Without dead ends: 388 [2025-02-05 21:56:03,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 778 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:56:03,204 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:03,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 637 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-05 21:56:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-02-05 21:56:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 263 states have (on average 1.570342205323194) internal successors, (413), 263 states have internal predecessors, (413), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2025-02-05 21:56:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 659 transitions. [2025-02-05 21:56:03,293 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 659 transitions. Word has length 777 [2025-02-05 21:56:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:03,295 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 659 transitions. [2025-02-05 21:56:03,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) [2025-02-05 21:56:03,295 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 659 transitions. [2025-02-05 21:56:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-02-05 21:56:03,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:03,310 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:03,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:56:03,511 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:56:03,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:03,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash -920965660, now seen corresponding path program 1 times [2025-02-05 21:56:03,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:03,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303494811] [2025-02-05 21:56:03,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:03,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 21:56:03,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 21:56:03,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:03,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-02-05 21:56:04,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:04,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303494811] [2025-02-05 21:56:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303494811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:04,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:04,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:04,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628574688] [2025-02-05 21:56:04,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:04,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:04,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:04,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:04,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:04,220 INFO L87 Difference]: Start difference. First operand 388 states and 659 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:04,347 INFO L93 Difference]: Finished difference Result 978 states and 1671 transitions. [2025-02-05 21:56:04,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:04,347 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-02-05 21:56:04,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:04,360 INFO L225 Difference]: With dead ends: 978 [2025-02-05 21:56:04,360 INFO L226 Difference]: Without dead ends: 593 [2025-02-05 21:56:04,362 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:56:04,362 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 326 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:04,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1318 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-05 21:56:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 590. [2025-02-05 21:56:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 441 states have (on average 1.6235827664399094) internal successors, (716), 442 states have internal predecessors, (716), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 145 states have call predecessors, (146), 146 states have call successors, (146) [2025-02-05 21:56:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1008 transitions. [2025-02-05 21:56:04,416 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1008 transitions. Word has length 777 [2025-02-05 21:56:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:04,417 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 1008 transitions. [2025-02-05 21:56:04,418 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:04,418 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1008 transitions. [2025-02-05 21:56:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-02-05 21:56:04,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:04,431 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:56:04,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:04,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:04,432 INFO L85 PathProgramCache]: Analyzing trace with hash 944584994, now seen corresponding path program 1 times [2025-02-05 21:56:04,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:04,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305394594] [2025-02-05 21:56:04,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:04,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:04,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 21:56:04,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 21:56:04,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:04,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-02-05 21:56:04,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:04,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305394594] [2025-02-05 21:56:04,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305394594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:04,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:04,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:04,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798108397] [2025-02-05 21:56:04,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:04,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:04,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:04,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:04,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:04,902 INFO L87 Difference]: Start difference. First operand 590 states and 1008 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:05,754 INFO L93 Difference]: Finished difference Result 2317 states and 3961 transitions. [2025-02-05 21:56:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:56:05,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-02-05 21:56:05,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:05,769 INFO L225 Difference]: With dead ends: 2317 [2025-02-05 21:56:05,769 INFO L226 Difference]: Without dead ends: 1730 [2025-02-05 21:56:05,771 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:56:05,771 INFO L435 NwaCegarLoop]: 1073 mSDtfsCounter, 1004 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:05,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 2067 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:56:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2025-02-05 21:56:05,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1726. [2025-02-05 21:56:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1281 states have (on average 1.620608899297424) internal successors, (2076), 1284 states have internal predecessors, (2076), 438 states have call successors, (438), 6 states have call predecessors, (438), 6 states have return successors, (438), 435 states have call predecessors, (438), 438 states have call successors, (438) [2025-02-05 21:56:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2952 transitions. [2025-02-05 21:56:05,942 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2952 transitions. Word has length 777 [2025-02-05 21:56:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:05,943 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2952 transitions. [2025-02-05 21:56:05,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2952 transitions. [2025-02-05 21:56:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-02-05 21:56:05,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:05,949 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:05,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:56:05,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:05,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:05,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1596107231, now seen corresponding path program 1 times [2025-02-05 21:56:05,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:05,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559023306] [2025-02-05 21:56:05,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:05,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:05,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 21:56:06,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 21:56:06,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:06,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-02-05 21:56:06,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:06,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559023306] [2025-02-05 21:56:06,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559023306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:06,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:06,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:06,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078192371] [2025-02-05 21:56:06,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:06,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:06,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:06,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:06,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:06,230 INFO L87 Difference]: Start difference. First operand 1726 states and 2952 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:06,398 INFO L93 Difference]: Finished difference Result 4621 states and 7922 transitions. [2025-02-05 21:56:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:06,398 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-02-05 21:56:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:06,414 INFO L225 Difference]: With dead ends: 4621 [2025-02-05 21:56:06,414 INFO L226 Difference]: Without dead ends: 2898 [2025-02-05 21:56:06,420 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:56:06,420 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 338 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:06,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1285 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2025-02-05 21:56:06,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2893. [2025-02-05 21:56:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2893 states, 2262 states have (on average 1.6396993810786915) internal successors, (3709), 2271 states have internal predecessors, (3709), 618 states have call successors, (618), 12 states have call predecessors, (618), 12 states have return successors, (618), 609 states have call predecessors, (618), 618 states have call successors, (618) [2025-02-05 21:56:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 4945 transitions. [2025-02-05 21:56:06,635 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 4945 transitions. Word has length 777 [2025-02-05 21:56:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:06,636 INFO L471 AbstractCegarLoop]: Abstraction has 2893 states and 4945 transitions. [2025-02-05 21:56:06,637 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 4945 transitions. [2025-02-05 21:56:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-02-05 21:56:06,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:06,644 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:06,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:56:06,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:06,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:06,645 INFO L85 PathProgramCache]: Analyzing trace with hash -252673470, now seen corresponding path program 1 times [2025-02-05 21:56:06,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:06,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769367657] [2025-02-05 21:56:06,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:06,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:06,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 21:56:06,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 21:56:06,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:06,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-02-05 21:56:06,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:06,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769367657] [2025-02-05 21:56:06,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769367657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:06,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:06,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:06,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019467036] [2025-02-05 21:56:06,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:06,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:06,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:06,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:06,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:06,881 INFO L87 Difference]: Start difference. First operand 2893 states and 4945 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:07,112 INFO L93 Difference]: Finished difference Result 8649 states and 14787 transitions. [2025-02-05 21:56:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:07,113 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-02-05 21:56:07,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:07,146 INFO L225 Difference]: With dead ends: 8649 [2025-02-05 21:56:07,146 INFO L226 Difference]: Without dead ends: 5759 [2025-02-05 21:56:07,156 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:56:07,158 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 608 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:07,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1665 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2025-02-05 21:56:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 5757. [2025-02-05 21:56:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5757 states, 4496 states have (on average 1.6343416370106763) internal successors, (7348), 4514 states have internal predecessors, (7348), 1236 states have call successors, (1236), 24 states have call predecessors, (1236), 24 states have return successors, (1236), 1218 states have call predecessors, (1236), 1236 states have call successors, (1236) [2025-02-05 21:56:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 9820 transitions. [2025-02-05 21:56:07,604 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 9820 transitions. Word has length 777 [2025-02-05 21:56:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:07,606 INFO L471 AbstractCegarLoop]: Abstraction has 5757 states and 9820 transitions. [2025-02-05 21:56:07,607 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 9820 transitions. [2025-02-05 21:56:07,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-02-05 21:56:07,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:07,616 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:07,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:56:07,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:07,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -241357343, now seen corresponding path program 1 times [2025-02-05 21:56:07,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:07,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733333748] [2025-02-05 21:56:07,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:07,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:07,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 21:56:07,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 21:56:07,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:07,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-02-05 21:56:08,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:08,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733333748] [2025-02-05 21:56:08,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733333748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:08,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:08,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:08,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156310730] [2025-02-05 21:56:08,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:08,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:08,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:08,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:08,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:08,082 INFO L87 Difference]: Start difference. First operand 5757 states and 9820 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 2 states have call predecessors, (123), 2 states have call successors, (123) [2025-02-05 21:56:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:08,638 INFO L93 Difference]: Finished difference Result 17265 states and 29454 transitions. [2025-02-05 21:56:08,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:08,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 2 states have call predecessors, (123), 2 states have call successors, (123) Word has length 777 [2025-02-05 21:56:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:08,708 INFO L225 Difference]: With dead ends: 17265 [2025-02-05 21:56:08,711 INFO L226 Difference]: Without dead ends: 11511 [2025-02-05 21:56:08,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:08,733 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 556 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:08,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1844 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:56:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11511 states. [2025-02-05 21:56:09,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11511 to 11499. [2025-02-05 21:56:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11499 states, 8978 states have (on average 1.6319893071953664) internal successors, (14652), 9014 states have internal predecessors, (14652), 2472 states have call successors, (2472), 48 states have call predecessors, (2472), 48 states have return successors, (2472), 2436 states have call predecessors, (2472), 2472 states have call successors, (2472) [2025-02-05 21:56:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11499 states to 11499 states and 19596 transitions. [2025-02-05 21:56:09,527 INFO L78 Accepts]: Start accepts. Automaton has 11499 states and 19596 transitions. Word has length 777 [2025-02-05 21:56:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:09,529 INFO L471 AbstractCegarLoop]: Abstraction has 11499 states and 19596 transitions. [2025-02-05 21:56:09,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 2 states have call predecessors, (123), 2 states have call successors, (123) [2025-02-05 21:56:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 11499 states and 19596 transitions. [2025-02-05 21:56:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-02-05 21:56:09,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:09,547 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:09,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:56:09,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:09,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:09,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1944576704, now seen corresponding path program 1 times [2025-02-05 21:56:09,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:09,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708465400] [2025-02-05 21:56:09,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:09,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:09,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 21:56:09,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 21:56:09,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:09,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-02-05 21:56:10,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:10,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708465400] [2025-02-05 21:56:10,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708465400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:10,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:10,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:56:10,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400528763] [2025-02-05 21:56:10,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:10,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:56:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:10,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:56:10,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:10,102 INFO L87 Difference]: Start difference. First operand 11499 states and 19596 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:11,749 INFO L93 Difference]: Finished difference Result 40001 states and 67695 transitions. [2025-02-05 21:56:11,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:56:11,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-02-05 21:56:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:11,866 INFO L225 Difference]: With dead ends: 40001 [2025-02-05 21:56:11,866 INFO L226 Difference]: Without dead ends: 28505 [2025-02-05 21:56:11,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 21:56:11,905 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 1315 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:11,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 1741 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:56:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28505 states. [2025-02-05 21:56:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28505 to 19395. [2025-02-05 21:56:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19395 states, 14678 states have (on average 1.6094835808693282) internal successors, (23624), 14762 states have internal predecessors, (23624), 4620 states have call successors, (4620), 96 states have call predecessors, (4620), 96 states have return successors, (4620), 4536 states have call predecessors, (4620), 4620 states have call successors, (4620) [2025-02-05 21:56:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19395 states to 19395 states and 32864 transitions. [2025-02-05 21:56:13,610 INFO L78 Accepts]: Start accepts. Automaton has 19395 states and 32864 transitions. Word has length 777 [2025-02-05 21:56:13,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:13,611 INFO L471 AbstractCegarLoop]: Abstraction has 19395 states and 32864 transitions. [2025-02-05 21:56:13,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 19395 states and 32864 transitions. [2025-02-05 21:56:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-02-05 21:56:13,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:13,631 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:13,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:56:13,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:13,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1936817345, now seen corresponding path program 1 times [2025-02-05 21:56:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:13,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584625703] [2025-02-05 21:56:13,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:13,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:13,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 21:56:13,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 21:56:13,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:13,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-02-05 21:56:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584625703] [2025-02-05 21:56:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584625703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:14,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:14,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:56:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225408615] [2025-02-05 21:56:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:14,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:56:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:14,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:56:14,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:14,353 INFO L87 Difference]: Start difference. First operand 19395 states and 32864 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:15,697 INFO L93 Difference]: Finished difference Result 46689 states and 79157 transitions. [2025-02-05 21:56:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:56:15,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-02-05 21:56:15,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:15,801 INFO L225 Difference]: With dead ends: 46689 [2025-02-05 21:56:15,801 INFO L226 Difference]: Without dead ends: 27297 [2025-02-05 21:56:15,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:56:15,852 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 1328 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:15,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 2146 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:56:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27297 states. [2025-02-05 21:56:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27297 to 27259. [2025-02-05 21:56:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27259 states, 21198 states have (on average 1.6217567695065571) internal successors, (34378), 21330 states have internal predecessors, (34378), 5916 states have call successors, (5916), 144 states have call predecessors, (5916), 144 states have return successors, (5916), 5784 states have call predecessors, (5916), 5916 states have call successors, (5916) [2025-02-05 21:56:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27259 states to 27259 states and 46210 transitions. [2025-02-05 21:56:17,620 INFO L78 Accepts]: Start accepts. Automaton has 27259 states and 46210 transitions. Word has length 777 [2025-02-05 21:56:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:17,621 INFO L471 AbstractCegarLoop]: Abstraction has 27259 states and 46210 transitions. [2025-02-05 21:56:17,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 27259 states and 46210 transitions. [2025-02-05 21:56:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-02-05 21:56:17,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:17,658 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:17,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:56:17,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:17,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:17,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1690504258, now seen corresponding path program 1 times [2025-02-05 21:56:17,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:17,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354088176] [2025-02-05 21:56:17,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:17,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:17,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-05 21:56:17,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-05 21:56:17,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:17,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-02-05 21:56:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354088176] [2025-02-05 21:56:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354088176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:18,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:18,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582480654] [2025-02-05 21:56:18,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:18,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:18,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:18,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:18,192 INFO L87 Difference]: Start difference. First operand 27259 states and 46210 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:19,332 INFO L93 Difference]: Finished difference Result 68180 states and 115638 transitions. [2025-02-05 21:56:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:19,333 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-02-05 21:56:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:19,508 INFO L225 Difference]: With dead ends: 68180 [2025-02-05 21:56:19,508 INFO L226 Difference]: Without dead ends: 40924 [2025-02-05 21:56:19,569 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:56:19,571 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 435 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:19,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1465 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:19,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40924 states. [2025-02-05 21:56:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40924 to 40898. [2025-02-05 21:56:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40898 states, 31807 states have (on average 1.6190146823026377) internal successors, (51496), 32005 states have internal predecessors, (51496), 8874 states have call successors, (8874), 216 states have call predecessors, (8874), 216 states have return successors, (8874), 8676 states have call predecessors, (8874), 8874 states have call successors, (8874) [2025-02-05 21:56:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 69244 transitions. [2025-02-05 21:56:22,731 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 69244 transitions. Word has length 777 [2025-02-05 21:56:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:22,732 INFO L471 AbstractCegarLoop]: Abstraction has 40898 states and 69244 transitions. [2025-02-05 21:56:22,732 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 69244 transitions. [2025-02-05 21:56:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2025-02-05 21:56:22,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:22,761 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:22,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:56:22,761 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:22,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:22,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1740228223, now seen corresponding path program 1 times [2025-02-05 21:56:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:22,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890734229] [2025-02-05 21:56:22,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:22,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 778 statements into 1 equivalence classes. [2025-02-05 21:56:22,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 778 of 778 statements. [2025-02-05 21:56:22,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:22,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-02-05 21:56:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890734229] [2025-02-05 21:56:23,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890734229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:23,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:23,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:23,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567443059] [2025-02-05 21:56:23,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:23,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:23,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:23,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:23,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:23,265 INFO L87 Difference]: Start difference. First operand 40898 states and 69244 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:26,030 INFO L93 Difference]: Finished difference Result 122364 states and 207078 transitions. [2025-02-05 21:56:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:26,030 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 778 [2025-02-05 21:56:26,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:26,371 INFO L225 Difference]: With dead ends: 122364 [2025-02-05 21:56:26,372 INFO L226 Difference]: Without dead ends: 81469 [2025-02-05 21:56:26,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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:56:26,471 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 396 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:26,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1252 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81469 states. [2025-02-05 21:56:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81469 to 81287. [2025-02-05 21:56:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81287 states, 63106 states have (on average 1.6035559217823978) internal successors, (101194), 63502 states have internal predecessors, (101194), 17748 states have call successors, (17748), 432 states have call predecessors, (17748), 432 states have return successors, (17748), 17352 states have call predecessors, (17748), 17748 states have call successors, (17748) [2025-02-05 21:56:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81287 states to 81287 states and 136690 transitions. [2025-02-05 21:56:31,390 INFO L78 Accepts]: Start accepts. Automaton has 81287 states and 136690 transitions. Word has length 778 [2025-02-05 21:56:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:31,392 INFO L471 AbstractCegarLoop]: Abstraction has 81287 states and 136690 transitions. [2025-02-05 21:56:31,392 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, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 81287 states and 136690 transitions. [2025-02-05 21:56:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2025-02-05 21:56:31,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:31,445 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:56:31,445 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:31,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1947882335, now seen corresponding path program 1 times [2025-02-05 21:56:31,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:31,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188835483] [2025-02-05 21:56:31,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:31,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 778 statements into 1 equivalence classes. [2025-02-05 21:56:31,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 778 of 778 statements. [2025-02-05 21:56:31,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:31,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-02-05 21:56:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188835483] [2025-02-05 21:56:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188835483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:32,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:32,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:56:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754420116] [2025-02-05 21:56:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:32,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:56:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:32,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:56:32,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:32,156 INFO L87 Difference]: Start difference. First operand 81287 states and 136690 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-05 21:56:38,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:38,719 INFO L93 Difference]: Finished difference Result 299926 states and 503674 transitions. [2025-02-05 21:56:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:56:38,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 778 [2025-02-05 21:56:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:39,748 INFO L225 Difference]: With dead ends: 299926 [2025-02-05 21:56:39,748 INFO L226 Difference]: Without dead ends: 218642 [2025-02-05 21:56:39,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:56:39,932 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 985 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 2530 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:39,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 2530 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:56:40,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218642 states.