./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/toy.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:03:32,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:03:33,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:03:33,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:03:33,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:03:33,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:03:33,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:03:33,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:03:33,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:03:33,065 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:03:33,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:03:33,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:03:33,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:03:33,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:03:33,066 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:03:33,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:03:33,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:03:33,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:03:33,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:03:33,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:03:33,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:03:33,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:03:33,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:03:33,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:03:33,067 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:03:33,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:03:33,067 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:03:33,067 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:03:33,067 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:03:33,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:03:33,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:03:33,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:03:33,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:03:33,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:03:33,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:03:33,068 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:03:33,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:03:33,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:03:33,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:03:33,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:03:33,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:03:33,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:03:33,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:03:33,069 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/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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2025-03-16 19:03:33,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:03:33,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:03:33,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:03:33,329 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:03:33,330 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:03:33,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2025-03-16 19:03:34,520 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d0b4cb46/3eb254eb5bcd489e92c8a6e5d92f7f97/FLAG405a506ff [2025-03-16 19:03:34,767 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:03:34,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2025-03-16 19:03:34,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d0b4cb46/3eb254eb5bcd489e92c8a6e5d92f7f97/FLAG405a506ff [2025-03-16 19:03:34,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d0b4cb46/3eb254eb5bcd489e92c8a6e5d92f7f97 [2025-03-16 19:03:34,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:03:34,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:03:34,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:03:34,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:03:34,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:03:34,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:03:34" (1/1) ... [2025-03-16 19:03:34,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ac6f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:34, skipping insertion in model container [2025-03-16 19:03:34,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:03:34" (1/1) ... [2025-03-16 19:03:34,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:03:34,931 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2025-03-16 19:03:34,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:03:35,005 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:03:35,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2025-03-16 19:03:35,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:03:35,071 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:03:35,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35 WrapperNode [2025-03-16 19:03:35,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:03:35,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:03:35,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:03:35,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:03:35,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (1/1) ... [2025-03-16 19:03:35,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (1/1) ... [2025-03-16 19:03:35,110 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 348 [2025-03-16 19:03:35,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:03:35,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:03:35,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:03:35,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:03:35,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (1/1) ... [2025-03-16 19:03:35,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (1/1) ... [2025-03-16 19:03:35,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (1/1) ... [2025-03-16 19:03:35,142 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-03-16 19:03:35,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (1/1) ... [2025-03-16 19:03:35,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (1/1) ... [2025-03-16 19:03:35,149 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (1/1) ... [2025-03-16 19:03:35,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (1/1) ... [2025-03-16 19:03:35,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (1/1) ... [2025-03-16 19:03:35,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (1/1) ... [2025-03-16 19:03:35,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:03:35,158 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:03:35,158 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:03:35,158 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:03:35,163 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (1/1) ... [2025-03-16 19:03:35,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:03:35,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:03:35,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:03:35,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:03:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:03:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:03:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:03:35,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:03:35,268 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:03:35,269 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:03:35,572 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-16 19:03:35,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:03:35,583 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:03:35,583 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:03:35,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:03:35 BoogieIcfgContainer [2025-03-16 19:03:35,584 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:03:35,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:03:35,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:03:35,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:03:35,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:03:34" (1/3) ... [2025-03-16 19:03:35,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b7ff70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:03:35, skipping insertion in model container [2025-03-16 19:03:35,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:35" (2/3) ... [2025-03-16 19:03:35,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b7ff70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:03:35, skipping insertion in model container [2025-03-16 19:03:35,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:03:35" (3/3) ... [2025-03-16 19:03:35,590 INFO L128 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2025-03-16 19:03:35,600 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:03:35,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG toy.cil.c that has 1 procedures, 122 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-16 19:03:35,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:03:35,653 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;@3b0bd83d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:03:35,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:03:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 120 states have (on average 1.8583333333333334) internal successors, (223), 121 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 19:03:35,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:35,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:35,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:35,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash 405381833, now seen corresponding path program 1 times [2025-03-16 19:03:35,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:35,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252332926] [2025-03-16 19:03:35,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:35,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:03:35,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:03:35,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:35,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:35,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:35,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252332926] [2025-03-16 19:03:35,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252332926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:35,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:35,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:03:35,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769040128] [2025-03-16 19:03:35,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:35,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:35,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:35,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:35,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:35,908 INFO L87 Difference]: Start difference. First operand has 122 states, 120 states have (on average 1.8583333333333334) internal successors, (223), 121 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:35,935 INFO L93 Difference]: Finished difference Result 235 states and 430 transitions. [2025-03-16 19:03:35,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:35,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 19:03:35,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:35,943 INFO L225 Difference]: With dead ends: 235 [2025-03-16 19:03:35,943 INFO L226 Difference]: Without dead ends: 119 [2025-03-16 19:03:35,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 19:03:35,947 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:35,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-16 19:03:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-16 19:03:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7966101694915255) internal successors, (212), 118 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 212 transitions. [2025-03-16 19:03:35,973 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 212 transitions. Word has length 33 [2025-03-16 19:03:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:35,973 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 212 transitions. [2025-03-16 19:03:35,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:35,973 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 212 transitions. [2025-03-16 19:03:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 19:03:35,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:35,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:35,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:03:35,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:35,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1366995850, now seen corresponding path program 1 times [2025-03-16 19:03:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167698208] [2025-03-16 19:03:35,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:35,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:03:36,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:03:36,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:36,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:36,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167698208] [2025-03-16 19:03:36,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167698208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:36,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:36,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:36,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943055798] [2025-03-16 19:03:36,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:36,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:36,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:36,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:36,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:36,093 INFO L87 Difference]: Start difference. First operand 119 states and 212 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:36,195 INFO L93 Difference]: Finished difference Result 311 states and 552 transitions. [2025-03-16 19:03:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:36,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 19:03:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:36,200 INFO L225 Difference]: With dead ends: 311 [2025-03-16 19:03:36,200 INFO L226 Difference]: Without dead ends: 202 [2025-03-16 19:03:36,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03-16 19:03:36,201 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 379 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:36,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 458 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:03:36,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-16 19:03:36,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 196. [2025-03-16 19:03:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.7692307692307692) internal successors, (345), 195 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 345 transitions. [2025-03-16 19:03:36,219 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 345 transitions. Word has length 33 [2025-03-16 19:03:36,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:36,219 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 345 transitions. [2025-03-16 19:03:36,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 345 transitions. [2025-03-16 19:03:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 19:03:36,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:36,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:36,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:03:36,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:36,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:36,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1299989097, now seen corresponding path program 1 times [2025-03-16 19:03:36,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:36,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719164776] [2025-03-16 19:03:36,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:36,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:36,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:03:36,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:03:36,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:36,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:36,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:36,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719164776] [2025-03-16 19:03:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719164776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:36,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:03:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630569434] [2025-03-16 19:03:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:36,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:36,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:36,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:36,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:36,300 INFO L87 Difference]: Start difference. First operand 196 states and 345 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:36,339 INFO L93 Difference]: Finished difference Result 572 states and 1009 transitions. [2025-03-16 19:03:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:36,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 19:03:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:36,341 INFO L225 Difference]: With dead ends: 572 [2025-03-16 19:03:36,342 INFO L226 Difference]: Without dead ends: 389 [2025-03-16 19:03:36,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 19:03:36,347 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 191 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:36,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 396 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-16 19:03:36,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 387. [2025-03-16 19:03:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.7461139896373057) internal successors, (674), 386 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 674 transitions. [2025-03-16 19:03:36,371 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 674 transitions. Word has length 33 [2025-03-16 19:03:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:36,371 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 674 transitions. [2025-03-16 19:03:36,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 674 transitions. [2025-03-16 19:03:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 19:03:36,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:36,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:36,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:03:36,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:36,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:36,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2131665176, now seen corresponding path program 1 times [2025-03-16 19:03:36,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:36,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051105794] [2025-03-16 19:03:36,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:36,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:36,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:03:36,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:03:36,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:36,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:36,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:36,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051105794] [2025-03-16 19:03:36,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051105794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:36,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:36,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:03:36,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475035387] [2025-03-16 19:03:36,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:36,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:36,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:36,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:36,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:36,434 INFO L87 Difference]: Start difference. First operand 387 states and 674 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:36,471 INFO L93 Difference]: Finished difference Result 1069 states and 1863 transitions. [2025-03-16 19:03:36,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:36,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 19:03:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:36,475 INFO L225 Difference]: With dead ends: 1069 [2025-03-16 19:03:36,475 INFO L226 Difference]: Without dead ends: 707 [2025-03-16 19:03:36,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 19:03:36,478 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 190 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:36,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 345 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-16 19:03:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 701. [2025-03-16 19:03:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 1.717142857142857) internal successors, (1202), 700 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1202 transitions. [2025-03-16 19:03:36,508 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1202 transitions. Word has length 33 [2025-03-16 19:03:36,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:36,508 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 1202 transitions. [2025-03-16 19:03:36,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,508 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1202 transitions. [2025-03-16 19:03:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 19:03:36,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:36,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:36,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:03:36,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:36,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:36,510 INFO L85 PathProgramCache]: Analyzing trace with hash 381667331, now seen corresponding path program 1 times [2025-03-16 19:03:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:36,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401830073] [2025-03-16 19:03:36,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:36,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:36,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:03:36,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:03:36,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:36,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:36,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:36,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401830073] [2025-03-16 19:03:36,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401830073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:36,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:36,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:36,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525174722] [2025-03-16 19:03:36,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:36,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:36,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:36,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:36,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:36,593 INFO L87 Difference]: Start difference. First operand 701 states and 1202 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:36,699 INFO L93 Difference]: Finished difference Result 1947 states and 3341 transitions. [2025-03-16 19:03:36,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:36,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 19:03:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:36,704 INFO L225 Difference]: With dead ends: 1947 [2025-03-16 19:03:36,704 INFO L226 Difference]: Without dead ends: 1279 [2025-03-16 19:03:36,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03-16 19:03:36,706 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 388 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:36,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 422 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2025-03-16 19:03:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 699. [2025-03-16 19:03:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.6876790830945558) internal successors, (1178), 698 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1178 transitions. [2025-03-16 19:03:36,735 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1178 transitions. Word has length 33 [2025-03-16 19:03:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:36,735 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1178 transitions. [2025-03-16 19:03:36,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1178 transitions. [2025-03-16 19:03:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 19:03:36,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:36,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:36,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:03:36,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:36,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1889219140, now seen corresponding path program 1 times [2025-03-16 19:03:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900796195] [2025-03-16 19:03:36,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:36,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:03:36,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:03:36,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:36,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:36,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:36,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900796195] [2025-03-16 19:03:36,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900796195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:36,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:36,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810994089] [2025-03-16 19:03:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:36,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:36,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:36,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:36,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:36,791 INFO L87 Difference]: Start difference. First operand 699 states and 1178 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:36,867 INFO L93 Difference]: Finished difference Result 1453 states and 2450 transitions. [2025-03-16 19:03:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:36,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 19:03:36,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:36,871 INFO L225 Difference]: With dead ends: 1453 [2025-03-16 19:03:36,871 INFO L226 Difference]: Without dead ends: 791 [2025-03-16 19:03:36,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03-16 19:03:36,874 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 468 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:36,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 371 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-03-16 19:03:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 769. [2025-03-16 19:03:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 768 states have (on average 1.6497395833333333) internal successors, (1267), 768 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1267 transitions. [2025-03-16 19:03:36,903 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1267 transitions. Word has length 33 [2025-03-16 19:03:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:36,904 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1267 transitions. [2025-03-16 19:03:36,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1267 transitions. [2025-03-16 19:03:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 19:03:36,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:36,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:36,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:03:36,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:36,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1383660515, now seen corresponding path program 1 times [2025-03-16 19:03:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:36,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396759608] [2025-03-16 19:03:36,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:36,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:03:36,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:03:36,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:36,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:36,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:36,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396759608] [2025-03-16 19:03:36,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396759608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:36,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:36,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:03:36,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446395155] [2025-03-16 19:03:36,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:36,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:36,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:36,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:36,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:36,945 INFO L87 Difference]: Start difference. First operand 769 states and 1267 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:37,007 INFO L93 Difference]: Finished difference Result 1815 states and 2998 transitions. [2025-03-16 19:03:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:37,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 19:03:37,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:37,011 INFO L225 Difference]: With dead ends: 1815 [2025-03-16 19:03:37,011 INFO L226 Difference]: Without dead ends: 1073 [2025-03-16 19:03:37,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 19:03:37,012 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 132 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:37,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 324 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2025-03-16 19:03:37,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1069. [2025-03-16 19:03:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1068 states have (on average 1.6338951310861423) internal successors, (1745), 1068 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1745 transitions. [2025-03-16 19:03:37,042 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1745 transitions. Word has length 33 [2025-03-16 19:03:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:37,042 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1745 transitions. [2025-03-16 19:03:37,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1745 transitions. [2025-03-16 19:03:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 19:03:37,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:37,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:37,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:03:37,043 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:37,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:37,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1238799287, now seen corresponding path program 1 times [2025-03-16 19:03:37,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:37,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021450957] [2025-03-16 19:03:37,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:37,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:37,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 19:03:37,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 19:03:37,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:37,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021450957] [2025-03-16 19:03:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021450957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:37,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:37,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220087423] [2025-03-16 19:03:37,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:37,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:37,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:37,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:37,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:37,090 INFO L87 Difference]: Start difference. First operand 1069 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:37,139 INFO L93 Difference]: Finished difference Result 2641 states and 4339 transitions. [2025-03-16 19:03:37,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:37,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-16 19:03:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:37,146 INFO L225 Difference]: With dead ends: 2641 [2025-03-16 19:03:37,146 INFO L226 Difference]: Without dead ends: 1625 [2025-03-16 19:03:37,148 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-03-16 19:03:37,148 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 109 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:37,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 450 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2025-03-16 19:03:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1623. [2025-03-16 19:03:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1622 states have (on average 1.628236744759556) internal successors, (2641), 1622 states have internal predecessors, (2641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2641 transitions. [2025-03-16 19:03:37,221 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2641 transitions. Word has length 43 [2025-03-16 19:03:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:37,222 INFO L471 AbstractCegarLoop]: Abstraction has 1623 states and 2641 transitions. [2025-03-16 19:03:37,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2641 transitions. [2025-03-16 19:03:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 19:03:37,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:37,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:37,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:03:37,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:37,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:37,227 INFO L85 PathProgramCache]: Analyzing trace with hash 222780712, now seen corresponding path program 1 times [2025-03-16 19:03:37,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:37,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449709151] [2025-03-16 19:03:37,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:37,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 19:03:37,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 19:03:37,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:37,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:03:37,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:37,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449709151] [2025-03-16 19:03:37,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449709151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:37,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:37,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:03:37,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594587086] [2025-03-16 19:03:37,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:37,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:37,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:37,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:37,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:37,264 INFO L87 Difference]: Start difference. First operand 1623 states and 2641 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:37,308 INFO L93 Difference]: Finished difference Result 3149 states and 5141 transitions. [2025-03-16 19:03:37,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:37,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-16 19:03:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:37,315 INFO L225 Difference]: With dead ends: 3149 [2025-03-16 19:03:37,315 INFO L226 Difference]: Without dead ends: 1579 [2025-03-16 19:03:37,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 19:03:37,318 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:37,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 193 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-03-16 19:03:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1579. [2025-03-16 19:03:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1578 states have (on average 1.632446134347275) internal successors, (2576), 1578 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2576 transitions. [2025-03-16 19:03:37,373 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2576 transitions. Word has length 43 [2025-03-16 19:03:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:37,373 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2576 transitions. [2025-03-16 19:03:37,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2576 transitions. [2025-03-16 19:03:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:03:37,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:37,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:37,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:03:37,388 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:37,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1348993230, now seen corresponding path program 1 times [2025-03-16 19:03:37,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:37,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409576298] [2025-03-16 19:03:37,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:37,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:03:37,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:03:37,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:37,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:37,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:37,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409576298] [2025-03-16 19:03:37,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409576298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:37,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:37,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:37,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425111303] [2025-03-16 19:03:37,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:37,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:37,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:37,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:37,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:37,417 INFO L87 Difference]: Start difference. First operand 1579 states and 2576 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:37,508 INFO L93 Difference]: Finished difference Result 3991 states and 6546 transitions. [2025-03-16 19:03:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:37,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 19:03:37,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:37,517 INFO L225 Difference]: With dead ends: 3991 [2025-03-16 19:03:37,517 INFO L226 Difference]: Without dead ends: 2465 [2025-03-16 19:03:37,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:37,520 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 106 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:37,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 431 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:37,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2025-03-16 19:03:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2463. [2025-03-16 19:03:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 2462 states have (on average 1.6259138911454103) internal successors, (4003), 2462 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 4003 transitions. [2025-03-16 19:03:37,627 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 4003 transitions. Word has length 44 [2025-03-16 19:03:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:37,627 INFO L471 AbstractCegarLoop]: Abstraction has 2463 states and 4003 transitions. [2025-03-16 19:03:37,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 4003 transitions. [2025-03-16 19:03:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:03:37,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:37,630 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:37,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:03:37,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:37,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1484394067, now seen corresponding path program 1 times [2025-03-16 19:03:37,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:37,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710602061] [2025-03-16 19:03:37,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:37,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:37,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:03:37,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:03:37,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:37,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:03:37,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:37,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710602061] [2025-03-16 19:03:37,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710602061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:37,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:37,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:03:37,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117131407] [2025-03-16 19:03:37,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:37,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:37,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:37,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:37,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:37,682 INFO L87 Difference]: Start difference. First operand 2463 states and 4003 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:37,777 INFO L93 Difference]: Finished difference Result 4829 states and 7869 transitions. [2025-03-16 19:03:37,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:37,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 19:03:37,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:37,788 INFO L225 Difference]: With dead ends: 4829 [2025-03-16 19:03:37,789 INFO L226 Difference]: Without dead ends: 2421 [2025-03-16 19:03:37,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 19:03:37,794 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:37,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-03-16 19:03:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2421. [2025-03-16 19:03:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2420 states have (on average 1.6289256198347108) internal successors, (3942), 2420 states have internal predecessors, (3942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 3942 transitions. [2025-03-16 19:03:37,895 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 3942 transitions. Word has length 44 [2025-03-16 19:03:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:37,896 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 3942 transitions. [2025-03-16 19:03:37,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 3942 transitions. [2025-03-16 19:03:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 19:03:37,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:37,897 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:37,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:03:37,898 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:37,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash 775551414, now seen corresponding path program 1 times [2025-03-16 19:03:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:37,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815760394] [2025-03-16 19:03:37,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:37,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 19:03:37,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 19:03:37,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:37,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:37,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:37,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815760394] [2025-03-16 19:03:37,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815760394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:37,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:37,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:37,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800921656] [2025-03-16 19:03:37,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:37,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:37,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:37,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:37,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:37,930 INFO L87 Difference]: Start difference. First operand 2421 states and 3942 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:38,031 INFO L93 Difference]: Finished difference Result 6511 states and 10654 transitions. [2025-03-16 19:03:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:38,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-16 19:03:38,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:38,045 INFO L225 Difference]: With dead ends: 6511 [2025-03-16 19:03:38,045 INFO L226 Difference]: Without dead ends: 4145 [2025-03-16 19:03:38,049 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-03-16 19:03:38,050 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 108 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:38,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 416 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2025-03-16 19:03:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 4143. [2025-03-16 19:03:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 1.6211974891356833) internal successors, (6715), 4142 states have internal predecessors, (6715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 6715 transitions. [2025-03-16 19:03:38,196 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 6715 transitions. Word has length 45 [2025-03-16 19:03:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:38,196 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 6715 transitions. [2025-03-16 19:03:38,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 6715 transitions. [2025-03-16 19:03:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 19:03:38,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:38,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:38,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:03:38,199 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:38,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2057835883, now seen corresponding path program 1 times [2025-03-16 19:03:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:38,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329371421] [2025-03-16 19:03:38,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:38,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:38,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 19:03:38,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 19:03:38,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:38,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:03:38,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:38,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329371421] [2025-03-16 19:03:38,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329371421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:38,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:38,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:03:38,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499282385] [2025-03-16 19:03:38,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:38,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:38,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:38,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:38,237 INFO L87 Difference]: Start difference. First operand 4143 states and 6715 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:38,340 INFO L93 Difference]: Finished difference Result 8203 states and 13315 transitions. [2025-03-16 19:03:38,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:38,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-16 19:03:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:38,355 INFO L225 Difference]: With dead ends: 8203 [2025-03-16 19:03:38,356 INFO L226 Difference]: Without dead ends: 4101 [2025-03-16 19:03:38,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 19:03:38,362 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:38,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 191 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4101 states. [2025-03-16 19:03:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4101 to 4101. [2025-03-16 19:03:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.6234146341463416) internal successors, (6656), 4100 states have internal predecessors, (6656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6656 transitions. [2025-03-16 19:03:38,499 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6656 transitions. Word has length 45 [2025-03-16 19:03:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:38,500 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 6656 transitions. [2025-03-16 19:03:38,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6656 transitions. [2025-03-16 19:03:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 19:03:38,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:38,502 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:38,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:03:38,502 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:38,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:38,505 INFO L85 PathProgramCache]: Analyzing trace with hash 897569633, now seen corresponding path program 1 times [2025-03-16 19:03:38,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:38,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648730800] [2025-03-16 19:03:38,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:38,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:38,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 19:03:38,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 19:03:38,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:38,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:38,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:38,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648730800] [2025-03-16 19:03:38,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648730800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:38,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:38,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:03:38,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480899562] [2025-03-16 19:03:38,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:38,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:38,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:38,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:38,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:38,558 INFO L87 Difference]: Start difference. First operand 4101 states and 6656 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:38,783 INFO L93 Difference]: Finished difference Result 10539 states and 17173 transitions. [2025-03-16 19:03:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:03:38,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-16 19:03:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:38,803 INFO L225 Difference]: With dead ends: 10539 [2025-03-16 19:03:38,803 INFO L226 Difference]: Without dead ends: 5377 [2025-03-16 19:03:38,809 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-03-16 19:03:38,809 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 461 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:38,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 489 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5377 states. [2025-03-16 19:03:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5377 to 5345. [2025-03-16 19:03:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5345 states, 5344 states have (on average 1.6046032934131738) internal successors, (8575), 5344 states have internal predecessors, (8575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5345 states to 5345 states and 8575 transitions. [2025-03-16 19:03:39,013 INFO L78 Accepts]: Start accepts. Automaton has 5345 states and 8575 transitions. Word has length 46 [2025-03-16 19:03:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:39,013 INFO L471 AbstractCegarLoop]: Abstraction has 5345 states and 8575 transitions. [2025-03-16 19:03:39,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 5345 states and 8575 transitions. [2025-03-16 19:03:39,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:03:39,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:39,015 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:39,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:03:39,016 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:39,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash 149042565, now seen corresponding path program 1 times [2025-03-16 19:03:39,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:39,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910976828] [2025-03-16 19:03:39,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:39,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:39,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:03:39,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:03:39,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:39,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:39,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910976828] [2025-03-16 19:03:39,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910976828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:39,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:39,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:03:39,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134674163] [2025-03-16 19:03:39,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:39,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:03:39,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:39,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:03:39,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:03:39,065 INFO L87 Difference]: Start difference. First operand 5345 states and 8575 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:39,322 INFO L93 Difference]: Finished difference Result 14929 states and 23873 transitions. [2025-03-16 19:03:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:03:39,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 19:03:39,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:39,345 INFO L225 Difference]: With dead ends: 14929 [2025-03-16 19:03:39,345 INFO L226 Difference]: Without dead ends: 9631 [2025-03-16 19:03:39,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:03:39,356 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 408 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:39,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 485 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9631 states. [2025-03-16 19:03:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9631 to 9205. [2025-03-16 19:03:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9205 states, 9204 states have (on average 1.5846371142981313) internal successors, (14585), 9204 states have internal predecessors, (14585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:39,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9205 states to 9205 states and 14585 transitions. [2025-03-16 19:03:39,620 INFO L78 Accepts]: Start accepts. Automaton has 9205 states and 14585 transitions. Word has length 50 [2025-03-16 19:03:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:39,620 INFO L471 AbstractCegarLoop]: Abstraction has 9205 states and 14585 transitions. [2025-03-16 19:03:39,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 9205 states and 14585 transitions. [2025-03-16 19:03:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:03:39,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:39,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:39,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:03:39,625 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:39,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:39,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1441110498, now seen corresponding path program 1 times [2025-03-16 19:03:39,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:39,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141865579] [2025-03-16 19:03:39,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:39,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:39,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:03:39,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:03:39,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:39,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:03:39,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:39,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141865579] [2025-03-16 19:03:39,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141865579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:39,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:39,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:03:39,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632072882] [2025-03-16 19:03:39,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:39,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:39,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:39,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:39,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:39,662 INFO L87 Difference]: Start difference. First operand 9205 states and 14585 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:40,073 INFO L93 Difference]: Finished difference Result 25770 states and 41006 transitions. [2025-03-16 19:03:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:40,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 19:03:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:40,111 INFO L225 Difference]: With dead ends: 25770 [2025-03-16 19:03:40,112 INFO L226 Difference]: Without dead ends: 16567 [2025-03-16 19:03:40,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 19:03:40,125 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 178 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:40,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 330 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16567 states. [2025-03-16 19:03:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16567 to 16433. [2025-03-16 19:03:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16433 states, 16432 states have (on average 1.5994401168451802) internal successors, (26282), 16432 states have internal predecessors, (26282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16433 states to 16433 states and 26282 transitions. [2025-03-16 19:03:40,788 INFO L78 Accepts]: Start accepts. Automaton has 16433 states and 26282 transitions. Word has length 52 [2025-03-16 19:03:40,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:40,789 INFO L471 AbstractCegarLoop]: Abstraction has 16433 states and 26282 transitions. [2025-03-16 19:03:40,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:40,789 INFO L276 IsEmpty]: Start isEmpty. Operand 16433 states and 26282 transitions. [2025-03-16 19:03:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:03:40,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:40,793 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:40,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:03:40,793 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:40,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash -225974397, now seen corresponding path program 1 times [2025-03-16 19:03:40,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:40,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023327886] [2025-03-16 19:03:40,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:40,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:03:40,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:03:40,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:40,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 19:03:40,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:40,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023327886] [2025-03-16 19:03:40,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023327886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:40,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:40,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:03:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459318196] [2025-03-16 19:03:40,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:40,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:40,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:40,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:40,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:40,845 INFO L87 Difference]: Start difference. First operand 16433 states and 26282 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:41,169 INFO L93 Difference]: Finished difference Result 32985 states and 52682 transitions. [2025-03-16 19:03:41,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:41,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-16 19:03:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:41,208 INFO L225 Difference]: With dead ends: 32985 [2025-03-16 19:03:41,208 INFO L226 Difference]: Without dead ends: 16561 [2025-03-16 19:03:41,227 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-03-16 19:03:41,228 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 239 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:41,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 291 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:41,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16561 states. [2025-03-16 19:03:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16561 to 16433. [2025-03-16 19:03:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16433 states, 16432 states have (on average 1.5979186952288218) internal successors, (26257), 16432 states have internal predecessors, (26257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16433 states to 16433 states and 26257 transitions. [2025-03-16 19:03:41,768 INFO L78 Accepts]: Start accepts. Automaton has 16433 states and 26257 transitions. Word has length 81 [2025-03-16 19:03:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:41,768 INFO L471 AbstractCegarLoop]: Abstraction has 16433 states and 26257 transitions. [2025-03-16 19:03:41,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:41,769 INFO L276 IsEmpty]: Start isEmpty. Operand 16433 states and 26257 transitions. [2025-03-16 19:03:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:03:41,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:41,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:41,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:03:41,773 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:41,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1150475869, now seen corresponding path program 1 times [2025-03-16 19:03:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:41,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64713441] [2025-03-16 19:03:41,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:41,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:03:41,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:03:41,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:41,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:41,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:41,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64713441] [2025-03-16 19:03:41,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64713441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:41,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:41,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:41,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185321803] [2025-03-16 19:03:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:41,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:41,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:41,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:41,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:41,811 INFO L87 Difference]: Start difference. First operand 16433 states and 26257 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:42,144 INFO L93 Difference]: Finished difference Result 32494 states and 51833 transitions. [2025-03-16 19:03:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:42,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-16 19:03:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:42,172 INFO L225 Difference]: With dead ends: 32494 [2025-03-16 19:03:42,172 INFO L226 Difference]: Without dead ends: 16088 [2025-03-16 19:03:42,181 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-03-16 19:03:42,182 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 133 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:42,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 306 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16088 states. [2025-03-16 19:03:42,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16088 to 16072. [2025-03-16 19:03:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16072 states, 16071 states have (on average 1.5493746499906664) internal successors, (24900), 16071 states have internal predecessors, (24900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16072 states to 16072 states and 24900 transitions. [2025-03-16 19:03:42,812 INFO L78 Accepts]: Start accepts. Automaton has 16072 states and 24900 transitions. Word has length 81 [2025-03-16 19:03:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:42,812 INFO L471 AbstractCegarLoop]: Abstraction has 16072 states and 24900 transitions. [2025-03-16 19:03:42,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 16072 states and 24900 transitions. [2025-03-16 19:03:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:03:42,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:42,816 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:42,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:03:42,817 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:42,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1400279379, now seen corresponding path program 1 times [2025-03-16 19:03:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:42,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352844276] [2025-03-16 19:03:42,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:42,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:42,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:03:42,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:03:42,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:42,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:42,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352844276] [2025-03-16 19:03:42,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352844276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:42,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:42,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:42,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338180408] [2025-03-16 19:03:42,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:42,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:42,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:42,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:42,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:42,859 INFO L87 Difference]: Start difference. First operand 16072 states and 24900 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:43,472 INFO L93 Difference]: Finished difference Result 32470 states and 50251 transitions. [2025-03-16 19:03:43,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:43,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 19:03:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:43,513 INFO L225 Difference]: With dead ends: 32470 [2025-03-16 19:03:43,513 INFO L226 Difference]: Without dead ends: 16436 [2025-03-16 19:03:43,533 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-03-16 19:03:43,534 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 131 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:43,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 305 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16436 states. [2025-03-16 19:03:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16436 to 16412. [2025-03-16 19:03:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16412 states, 16411 states have (on average 1.4991164462860276) internal successors, (24602), 16411 states have internal predecessors, (24602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16412 states to 16412 states and 24602 transitions. [2025-03-16 19:03:44,012 INFO L78 Accepts]: Start accepts. Automaton has 16412 states and 24602 transitions. Word has length 82 [2025-03-16 19:03:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:44,012 INFO L471 AbstractCegarLoop]: Abstraction has 16412 states and 24602 transitions. [2025-03-16 19:03:44,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 16412 states and 24602 transitions. [2025-03-16 19:03:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:03:44,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:44,016 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:44,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:03:44,016 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:44,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:44,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1996080773, now seen corresponding path program 1 times [2025-03-16 19:03:44,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:44,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656439715] [2025-03-16 19:03:44,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:44,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:44,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:03:44,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:03:44,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:44,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:44,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:44,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656439715] [2025-03-16 19:03:44,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656439715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:44,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:44,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:44,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462102003] [2025-03-16 19:03:44,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:44,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:44,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:44,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:44,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:44,043 INFO L87 Difference]: Start difference. First operand 16412 states and 24602 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:44,406 INFO L93 Difference]: Finished difference Result 32891 states and 49411 transitions. [2025-03-16 19:03:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:44,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:03:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:44,442 INFO L225 Difference]: With dead ends: 32891 [2025-03-16 19:03:44,442 INFO L226 Difference]: Without dead ends: 16535 [2025-03-16 19:03:44,455 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-03-16 19:03:44,456 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 126 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:44,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 300 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16535 states. [2025-03-16 19:03:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16535 to 12539. [2025-03-16 19:03:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12539 states, 12538 states have (on average 1.4381081512202902) internal successors, (18031), 12538 states have internal predecessors, (18031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12539 states to 12539 states and 18031 transitions. [2025-03-16 19:03:44,781 INFO L78 Accepts]: Start accepts. Automaton has 12539 states and 18031 transitions. Word has length 83 [2025-03-16 19:03:44,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:44,782 INFO L471 AbstractCegarLoop]: Abstraction has 12539 states and 18031 transitions. [2025-03-16 19:03:44,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 12539 states and 18031 transitions. [2025-03-16 19:03:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:03:44,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:44,786 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:44,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:03:44,786 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:44,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:44,786 INFO L85 PathProgramCache]: Analyzing trace with hash -188071342, now seen corresponding path program 1 times [2025-03-16 19:03:44,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:44,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746872765] [2025-03-16 19:03:44,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:44,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:44,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:03:44,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:03:44,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:44,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 19:03:44,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:44,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746872765] [2025-03-16 19:03:44,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746872765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:44,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:44,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:44,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408158717] [2025-03-16 19:03:44,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:44,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:44,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:44,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:44,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:44,829 INFO L87 Difference]: Start difference. First operand 12539 states and 18031 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:45,073 INFO L93 Difference]: Finished difference Result 24626 states and 35418 transitions. [2025-03-16 19:03:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:45,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:03:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:45,095 INFO L225 Difference]: With dead ends: 24626 [2025-03-16 19:03:45,095 INFO L226 Difference]: Without dead ends: 12131 [2025-03-16 19:03:45,107 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-03-16 19:03:45,107 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 115 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:45,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 171 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:45,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12131 states. [2025-03-16 19:03:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12131 to 12131. [2025-03-16 19:03:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12131 states, 12130 states have (on average 1.4273701566364385) internal successors, (17314), 12130 states have internal predecessors, (17314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12131 states to 12131 states and 17314 transitions. [2025-03-16 19:03:45,434 INFO L78 Accepts]: Start accepts. Automaton has 12131 states and 17314 transitions. Word has length 84 [2025-03-16 19:03:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:45,434 INFO L471 AbstractCegarLoop]: Abstraction has 12131 states and 17314 transitions. [2025-03-16 19:03:45,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 12131 states and 17314 transitions. [2025-03-16 19:03:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:03:45,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:45,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:03:45,438 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:45,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash 429584879, now seen corresponding path program 1 times [2025-03-16 19:03:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:45,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961455128] [2025-03-16 19:03:45,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:45,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:03:45,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:03:45,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:45,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 19:03:45,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:45,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961455128] [2025-03-16 19:03:45,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961455128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:45,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:45,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:45,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384454990] [2025-03-16 19:03:45,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:45,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:45,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:45,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:45,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:45,472 INFO L87 Difference]: Start difference. First operand 12131 states and 17314 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:45,808 INFO L93 Difference]: Finished difference Result 26817 states and 38165 transitions. [2025-03-16 19:03:45,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:45,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:03:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:45,834 INFO L225 Difference]: With dead ends: 26817 [2025-03-16 19:03:45,834 INFO L226 Difference]: Without dead ends: 13455 [2025-03-16 19:03:45,848 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-03-16 19:03:45,850 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 76 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:45,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 366 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13455 states. [2025-03-16 19:03:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13455 to 11927. [2025-03-16 19:03:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11927 states, 11926 states have (on average 1.3622337749454971) internal successors, (16246), 11926 states have internal predecessors, (16246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 16246 transitions. [2025-03-16 19:03:46,323 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 16246 transitions. Word has length 84 [2025-03-16 19:03:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:46,323 INFO L471 AbstractCegarLoop]: Abstraction has 11927 states and 16246 transitions. [2025-03-16 19:03:46,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 16246 transitions. [2025-03-16 19:03:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:03:46,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:46,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:46,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:03:46,337 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:46,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:46,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1520528663, now seen corresponding path program 1 times [2025-03-16 19:03:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:46,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438992472] [2025-03-16 19:03:46,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:46,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:46,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:03:46,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:03:46,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:46,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:03:46,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:46,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438992472] [2025-03-16 19:03:46,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438992472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:46,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:46,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:03:46,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459556535] [2025-03-16 19:03:46,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:46,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:46,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:46,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:46,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:46,372 INFO L87 Difference]: Start difference. First operand 11927 states and 16246 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:46,825 INFO L93 Difference]: Finished difference Result 23427 states and 31907 transitions. [2025-03-16 19:03:46,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:46,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:03:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:46,845 INFO L225 Difference]: With dead ends: 23427 [2025-03-16 19:03:46,845 INFO L226 Difference]: Without dead ends: 11877 [2025-03-16 19:03:46,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 19:03:46,856 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 33 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:46,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 300 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2025-03-16 19:03:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 11877. [2025-03-16 19:03:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11877 states, 11876 states have (on average 1.3593802627147187) internal successors, (16144), 11876 states have internal predecessors, (16144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11877 states to 11877 states and 16144 transitions. [2025-03-16 19:03:47,373 INFO L78 Accepts]: Start accepts. Automaton has 11877 states and 16144 transitions. Word has length 110 [2025-03-16 19:03:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:47,373 INFO L471 AbstractCegarLoop]: Abstraction has 11877 states and 16144 transitions. [2025-03-16 19:03:47,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 11877 states and 16144 transitions. [2025-03-16 19:03:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:03:47,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:47,388 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:47,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:03:47,388 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:47,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash -339736239, now seen corresponding path program 1 times [2025-03-16 19:03:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894073276] [2025-03-16 19:03:47,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:47,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:03:47,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:03:47,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:47,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:03:47,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:47,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894073276] [2025-03-16 19:03:47,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894073276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:47,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:47,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:03:47,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060278971] [2025-03-16 19:03:47,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:47,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:47,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:47,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:47,445 INFO L87 Difference]: Start difference. First operand 11877 states and 16144 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:47,942 INFO L93 Difference]: Finished difference Result 23047 states and 31352 transitions. [2025-03-16 19:03:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:03:47,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-03-16 19:03:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:47,965 INFO L225 Difference]: With dead ends: 23047 [2025-03-16 19:03:47,965 INFO L226 Difference]: Without dead ends: 11809 [2025-03-16 19:03:47,977 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-03-16 19:03:47,977 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 228 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:47,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 461 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11809 states. [2025-03-16 19:03:48,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11809 to 11783. [2025-03-16 19:03:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11783 states, 11782 states have (on average 1.3303344084196231) internal successors, (15674), 11782 states have internal predecessors, (15674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11783 states to 11783 states and 15674 transitions. [2025-03-16 19:03:48,400 INFO L78 Accepts]: Start accepts. Automaton has 11783 states and 15674 transitions. Word has length 121 [2025-03-16 19:03:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:48,400 INFO L471 AbstractCegarLoop]: Abstraction has 11783 states and 15674 transitions. [2025-03-16 19:03:48,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 11783 states and 15674 transitions. [2025-03-16 19:03:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 19:03:48,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:48,410 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:48,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:03:48,410 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:48,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash 165609865, now seen corresponding path program 1 times [2025-03-16 19:03:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:48,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319313332] [2025-03-16 19:03:48,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:48,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:48,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 19:03:48,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 19:03:48,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:48,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 19:03:48,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319313332] [2025-03-16 19:03:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319313332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:48,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:48,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:03:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251789589] [2025-03-16 19:03:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:48,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:48,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:48,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:48,443 INFO L87 Difference]: Start difference. First operand 11783 states and 15674 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:48,712 INFO L93 Difference]: Finished difference Result 23174 states and 30831 transitions. [2025-03-16 19:03:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:48,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-03-16 19:03:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:48,736 INFO L225 Difference]: With dead ends: 23174 [2025-03-16 19:03:48,736 INFO L226 Difference]: Without dead ends: 11764 [2025-03-16 19:03:48,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 19:03:48,748 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 21 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:48,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 299 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11764 states. [2025-03-16 19:03:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11764 to 11744. [2025-03-16 19:03:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11744 states, 11743 states have (on average 1.3278548922762496) internal successors, (15593), 11743 states have internal predecessors, (15593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11744 states to 11744 states and 15593 transitions. [2025-03-16 19:03:49,049 INFO L78 Accepts]: Start accepts. Automaton has 11744 states and 15593 transitions. Word has length 127 [2025-03-16 19:03:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:49,049 INFO L471 AbstractCegarLoop]: Abstraction has 11744 states and 15593 transitions. [2025-03-16 19:03:49,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 11744 states and 15593 transitions. [2025-03-16 19:03:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 19:03:49,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:49,059 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:49,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:03:49,060 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:49,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1016438675, now seen corresponding path program 1 times [2025-03-16 19:03:49,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:49,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827006425] [2025-03-16 19:03:49,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:49,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:49,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 19:03:49,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 19:03:49,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:49,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 19:03:49,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:49,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827006425] [2025-03-16 19:03:49,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827006425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:49,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:49,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:03:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230499053] [2025-03-16 19:03:49,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:49,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:49,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:49,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:49,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:49,097 INFO L87 Difference]: Start difference. First operand 11744 states and 15593 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:49,338 INFO L93 Difference]: Finished difference Result 23115 states and 30694 transitions. [2025-03-16 19:03:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:49,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-03-16 19:03:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:49,362 INFO L225 Difference]: With dead ends: 23115 [2025-03-16 19:03:49,362 INFO L226 Difference]: Without dead ends: 11735 [2025-03-16 19:03:49,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 19:03:49,374 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 21 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:49,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 295 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11735 states. [2025-03-16 19:03:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11735 to 11715. [2025-03-16 19:03:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11715 states, 11714 states have (on average 1.3251664674748165) internal successors, (15523), 11714 states have internal predecessors, (15523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11715 states to 11715 states and 15523 transitions. [2025-03-16 19:03:49,666 INFO L78 Accepts]: Start accepts. Automaton has 11715 states and 15523 transitions. Word has length 127 [2025-03-16 19:03:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:49,667 INFO L471 AbstractCegarLoop]: Abstraction has 11715 states and 15523 transitions. [2025-03-16 19:03:49,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 11715 states and 15523 transitions. [2025-03-16 19:03:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 19:03:49,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:49,675 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:49,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:03:49,676 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:49,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash -198948938, now seen corresponding path program 1 times [2025-03-16 19:03:49,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:49,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929440011] [2025-03-16 19:03:49,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:49,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 19:03:49,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 19:03:49,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:49,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 19:03:49,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:49,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929440011] [2025-03-16 19:03:49,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929440011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:49,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:03:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48678777] [2025-03-16 19:03:49,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:49,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:49,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:49,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:49,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:49,719 INFO L87 Difference]: Start difference. First operand 11715 states and 15523 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:49,952 INFO L93 Difference]: Finished difference Result 21543 states and 28598 transitions. [2025-03-16 19:03:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:03:49,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-03-16 19:03:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:49,970 INFO L225 Difference]: With dead ends: 21543 [2025-03-16 19:03:49,971 INFO L226 Difference]: Without dead ends: 10188 [2025-03-16 19:03:49,979 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-03-16 19:03:49,979 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 189 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:49,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 450 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10188 states. [2025-03-16 19:03:50,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10188 to 10162. [2025-03-16 19:03:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10162 states, 10161 states have (on average 1.2937702981989962) internal successors, (13146), 10161 states have internal predecessors, (13146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10162 states to 10162 states and 13146 transitions. [2025-03-16 19:03:50,295 INFO L78 Accepts]: Start accepts. Automaton has 10162 states and 13146 transitions. Word has length 130 [2025-03-16 19:03:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:50,295 INFO L471 AbstractCegarLoop]: Abstraction has 10162 states and 13146 transitions. [2025-03-16 19:03:50,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 10162 states and 13146 transitions. [2025-03-16 19:03:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 19:03:50,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:50,301 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:50,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:03:50,301 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:50,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash 3269059, now seen corresponding path program 1 times [2025-03-16 19:03:50,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:50,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842712213] [2025-03-16 19:03:50,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:50,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:50,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 19:03:50,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 19:03:50,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:50,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:03:50,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:50,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842712213] [2025-03-16 19:03:50,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842712213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:50,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:50,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:03:50,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698375145] [2025-03-16 19:03:50,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:50,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:50,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:50,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:50,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:50,345 INFO L87 Difference]: Start difference. First operand 10162 states and 13146 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:50,552 INFO L93 Difference]: Finished difference Result 18673 states and 24177 transitions. [2025-03-16 19:03:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:03:50,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-03-16 19:03:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:50,568 INFO L225 Difference]: With dead ends: 18673 [2025-03-16 19:03:50,568 INFO L226 Difference]: Without dead ends: 8479 [2025-03-16 19:03:50,576 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-03-16 19:03:50,576 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 164 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:50,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 426 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8479 states. [2025-03-16 19:03:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8479 to 8443. [2025-03-16 19:03:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8443 states, 8442 states have (on average 1.2723288320303245) internal successors, (10741), 8442 states have internal predecessors, (10741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8443 states to 8443 states and 10741 transitions. [2025-03-16 19:03:50,782 INFO L78 Accepts]: Start accepts. Automaton has 8443 states and 10741 transitions. Word has length 130 [2025-03-16 19:03:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:50,782 INFO L471 AbstractCegarLoop]: Abstraction has 8443 states and 10741 transitions. [2025-03-16 19:03:50,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 8443 states and 10741 transitions. [2025-03-16 19:03:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 19:03:50,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:50,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:50,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:03:50,788 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:50,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1785492024, now seen corresponding path program 1 times [2025-03-16 19:03:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:50,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718836970] [2025-03-16 19:03:50,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:50,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:50,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 19:03:50,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 19:03:50,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:50,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 19:03:50,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:50,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718836970] [2025-03-16 19:03:50,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718836970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:50,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:50,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:50,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191348150] [2025-03-16 19:03:50,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:50,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:50,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:50,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:50,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:50,827 INFO L87 Difference]: Start difference. First operand 8443 states and 10741 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:50,998 INFO L93 Difference]: Finished difference Result 15985 states and 20496 transitions. [2025-03-16 19:03:50,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:50,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2025-03-16 19:03:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:51,015 INFO L225 Difference]: With dead ends: 15985 [2025-03-16 19:03:51,015 INFO L226 Difference]: Without dead ends: 7835 [2025-03-16 19:03:51,022 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-03-16 19:03:51,025 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 23 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:51,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 307 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:51,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2025-03-16 19:03:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 7277. [2025-03-16 19:03:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7277 states, 7276 states have (on average 1.2733644859813085) internal successors, (9265), 7276 states have internal predecessors, (9265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7277 states to 7277 states and 9265 transitions. [2025-03-16 19:03:51,218 INFO L78 Accepts]: Start accepts. Automaton has 7277 states and 9265 transitions. Word has length 161 [2025-03-16 19:03:51,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:51,218 INFO L471 AbstractCegarLoop]: Abstraction has 7277 states and 9265 transitions. [2025-03-16 19:03:51,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7277 states and 9265 transitions. [2025-03-16 19:03:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:03:51,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:51,223 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:51,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:03:51,223 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:51,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2088883064, now seen corresponding path program 1 times [2025-03-16 19:03:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:51,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193176968] [2025-03-16 19:03:51,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:51,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:03:51,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:03:51,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:51,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 19:03:51,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:51,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193176968] [2025-03-16 19:03:51,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193176968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:51,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:51,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:51,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75282283] [2025-03-16 19:03:51,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:51,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:51,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:51,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:51,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:51,272 INFO L87 Difference]: Start difference. First operand 7277 states and 9265 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:51,509 INFO L93 Difference]: Finished difference Result 18275 states and 23365 transitions. [2025-03-16 19:03:51,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:51,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-03-16 19:03:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:51,531 INFO L225 Difference]: With dead ends: 18275 [2025-03-16 19:03:51,531 INFO L226 Difference]: Without dead ends: 11291 [2025-03-16 19:03:51,538 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-03-16 19:03:51,538 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 133 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:51,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 295 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2025-03-16 19:03:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 11077. [2025-03-16 19:03:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11077 states, 11076 states have (on average 1.2561394005055977) internal successors, (13913), 11076 states have internal predecessors, (13913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11077 states to 11077 states and 13913 transitions. [2025-03-16 19:03:51,856 INFO L78 Accepts]: Start accepts. Automaton has 11077 states and 13913 transitions. Word has length 168 [2025-03-16 19:03:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:51,857 INFO L471 AbstractCegarLoop]: Abstraction has 11077 states and 13913 transitions. [2025-03-16 19:03:51,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 11077 states and 13913 transitions. [2025-03-16 19:03:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-16 19:03:51,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:51,863 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:51,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:03:51,863 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:51,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:51,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1476804179, now seen corresponding path program 1 times [2025-03-16 19:03:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879168549] [2025-03-16 19:03:51,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:51,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 19:03:51,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 19:03:51,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:51,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:03:51,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:51,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879168549] [2025-03-16 19:03:51,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879168549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:51,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:51,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:03:51,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775566175] [2025-03-16 19:03:51,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:51,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:51,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:51,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:51,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:51,907 INFO L87 Difference]: Start difference. First operand 11077 states and 13913 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:52,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:52,076 INFO L93 Difference]: Finished difference Result 17043 states and 21364 transitions. [2025-03-16 19:03:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:52,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-03-16 19:03:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:52,095 INFO L225 Difference]: With dead ends: 17043 [2025-03-16 19:03:52,095 INFO L226 Difference]: Without dead ends: 6219 [2025-03-16 19:03:52,104 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-03-16 19:03:52,104 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 165 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:52,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 250 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:52,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6219 states. [2025-03-16 19:03:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6219 to 5273. [2025-03-16 19:03:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 5272 states have (on average 1.2435508345978756) internal successors, (6556), 5272 states have internal predecessors, (6556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 6556 transitions. [2025-03-16 19:03:52,244 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 6556 transitions. Word has length 171 [2025-03-16 19:03:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:52,244 INFO L471 AbstractCegarLoop]: Abstraction has 5273 states and 6556 transitions. [2025-03-16 19:03:52,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 6556 transitions. [2025-03-16 19:03:52,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 19:03:52,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:52,245 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:52,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:03:52,246 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:52,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1201076017, now seen corresponding path program 1 times [2025-03-16 19:03:52,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:52,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172253660] [2025-03-16 19:03:52,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:52,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:52,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:03:52,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:03:52,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:52,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 19:03:52,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172253660] [2025-03-16 19:03:52,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172253660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:52,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:52,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:52,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794890540] [2025-03-16 19:03:52,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:52,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:52,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:52,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:52,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:52,271 INFO L87 Difference]: Start difference. First operand 5273 states and 6556 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:52,381 INFO L93 Difference]: Finished difference Result 10317 states and 12854 transitions. [2025-03-16 19:03:52,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:52,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2025-03-16 19:03:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:52,398 INFO L225 Difference]: With dead ends: 10317 [2025-03-16 19:03:52,398 INFO L226 Difference]: Without dead ends: 5291 [2025-03-16 19:03:52,403 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-03-16 19:03:52,405 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:52,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2025-03-16 19:03:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 5291. [2025-03-16 19:03:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 5290 states have (on average 1.2427221172022684) internal successors, (6574), 5290 states have internal predecessors, (6574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 6574 transitions. [2025-03-16 19:03:52,546 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 6574 transitions. Word has length 175 [2025-03-16 19:03:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:52,546 INFO L471 AbstractCegarLoop]: Abstraction has 5291 states and 6574 transitions. [2025-03-16 19:03:52,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:52,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 6574 transitions. [2025-03-16 19:03:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 19:03:52,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:52,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:52,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:03:52,548 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:52,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1910543982, now seen corresponding path program 1 times [2025-03-16 19:03:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:52,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022441704] [2025-03-16 19:03:52,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:52,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:03:52,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:03:52,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:52,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:03:52,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:52,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022441704] [2025-03-16 19:03:52,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022441704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:52,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:52,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:52,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632230096] [2025-03-16 19:03:52,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:52,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:52,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:52,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:52,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:52,582 INFO L87 Difference]: Start difference. First operand 5291 states and 6574 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:52,649 INFO L93 Difference]: Finished difference Result 6705 states and 8221 transitions. [2025-03-16 19:03:52,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:52,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2025-03-16 19:03:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:52,661 INFO L225 Difference]: With dead ends: 6705 [2025-03-16 19:03:52,661 INFO L226 Difference]: Without dead ends: 1628 [2025-03-16 19:03:52,664 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-03-16 19:03:52,664 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 66 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:52,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 288 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2025-03-16 19:03:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1616. [2025-03-16 19:03:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1615 states have (on average 1.1374613003095975) internal successors, (1837), 1615 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1837 transitions. [2025-03-16 19:03:52,715 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1837 transitions. Word has length 175 [2025-03-16 19:03:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:52,715 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 1837 transitions. [2025-03-16 19:03:52,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1837 transitions. [2025-03-16 19:03:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 19:03:52,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:52,716 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:52,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:03:52,716 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:52,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1264554337, now seen corresponding path program 1 times [2025-03-16 19:03:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:52,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649055534] [2025-03-16 19:03:52,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:52,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:52,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 19:03:52,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 19:03:52,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:52,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:03:52,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:52,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649055534] [2025-03-16 19:03:52,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649055534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:03:52,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042891822] [2025-03-16 19:03:53,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:53,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:03:53,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:03:53,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:03:53,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:03:53,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 19:03:53,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 19:03:53,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:53,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:53,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:03:53,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:03:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 71 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:03:53,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:03:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 71 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:03:53,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042891822] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:03:53,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:03:53,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-03-16 19:03:53,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438600362] [2025-03-16 19:03:53,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:03:53,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 19:03:53,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:53,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 19:03:53,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:03:53,750 INFO L87 Difference]: Start difference. First operand 1616 states and 1837 transitions. Second operand has 27 states, 27 states have (on average 16.14814814814815) internal successors, (436), 27 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:54,910 INFO L93 Difference]: Finished difference Result 6340 states and 7222 transitions. [2025-03-16 19:03:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-16 19:03:54,911 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 16.14814814814815) internal successors, (436), 27 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2025-03-16 19:03:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:54,924 INFO L225 Difference]: With dead ends: 6340 [2025-03-16 19:03:54,924 INFO L226 Difference]: Without dead ends: 5032 [2025-03-16 19:03:54,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=543, Invalid=3489, Unknown=0, NotChecked=0, Total=4032 [2025-03-16 19:03:54,926 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 2318 mSDsluCounter, 6893 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 7335 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:54,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2318 Valid, 7335 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:03:54,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2025-03-16 19:03:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 2496. [2025-03-16 19:03:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.1450901803607214) internal successors, (2857), 2495 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2857 transitions. [2025-03-16 19:03:55,020 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2857 transitions. Word has length 176 [2025-03-16 19:03:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:55,021 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2857 transitions. [2025-03-16 19:03:55,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.14814814814815) internal successors, (436), 27 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2857 transitions. [2025-03-16 19:03:55,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-16 19:03:55,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:55,023 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:55,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:03:55,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-16 19:03:55,228 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:55,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:55,229 INFO L85 PathProgramCache]: Analyzing trace with hash -744457353, now seen corresponding path program 1 times [2025-03-16 19:03:55,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:55,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322635143] [2025-03-16 19:03:55,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:55,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:55,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-16 19:03:55,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-16 19:03:55,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:55,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 19:03:55,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322635143] [2025-03-16 19:03:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322635143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:55,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:55,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:03:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045606581] [2025-03-16 19:03:55,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:55,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:03:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:55,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:03:55,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:03:55,271 INFO L87 Difference]: Start difference. First operand 2496 states and 2857 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:55,311 INFO L93 Difference]: Finished difference Result 3070 states and 3487 transitions. [2025-03-16 19:03:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:03:55,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2025-03-16 19:03:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:55,319 INFO L225 Difference]: With dead ends: 3070 [2025-03-16 19:03:55,319 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 19:03:55,322 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-03-16 19:03:55,322 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:55,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 279 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 19:03:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 19:03:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 19:03:55,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 262 [2025-03-16 19:03:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:55,329 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 19:03:55,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:03:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 19:03:55,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 19:03:55,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 19:03:55,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:03:55,333 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:03:55,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 19:04:02,621 WARN L286 SmtUtils]: Spent 5.89s on a formula simplification. DAG size of input: 514 DAG size of output: 516 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-16 19:04:18,003 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 19:04:18,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 07:04:18 BoogieIcfgContainer [2025-03-16 19:04:18,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 19:04:18,084 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 19:04:18,084 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 19:04:18,085 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 19:04:18,085 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:03:35" (3/4) ... [2025-03-16 19:04:18,087 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 19:04:18,110 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-16 19:04:18,111 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 19:04:18,111 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 19:04:18,112 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 19:04:18,244 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 19:04:18,244 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 19:04:18,244 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 19:04:18,245 INFO L158 Benchmark]: Toolchain (without parser) took 43443.27ms. Allocated memory was 142.6MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 110.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-03-16 19:04:18,245 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:04:18,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.11ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 96.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 19:04:18,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.72ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:04:18,247 INFO L158 Benchmark]: Boogie Preprocessor took 44.46ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:04:18,247 INFO L158 Benchmark]: IcfgBuilder took 425.89ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 67.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 19:04:18,247 INFO L158 Benchmark]: TraceAbstraction took 42498.23ms. Allocated memory was 142.6MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 67.1MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-03-16 19:04:18,247 INFO L158 Benchmark]: Witness Printer took 159.70ms. Allocated memory is still 3.4GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 19:04:18,247 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.11ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 96.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.72ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.46ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 425.89ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 67.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42498.23ms. Allocated memory was 142.6MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 67.1MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 159.70ms. Allocated memory is still 3.4GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 122 locations, 223 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 35, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8076 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8076 mSDsluCounter, 18729 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11419 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1238 IncrementalHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 7310 mSDtfsCounter, 1238 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 532 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16433occurred in iteration=16, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 11304 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3347 NumberOfCodeBlocks, 3347 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3486 ConstructedInterpolants, 0 QuantifiedInterpolants, 7334 SizeOfPredicates, 5 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 37 InterpolantComputations, 34 PerfectInterpolantSequences, 1206/1313 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 185]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((0 != wl_st) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (data == ((long long) t_b + 1))) && (c1_st == 0)) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0)) || ((((((((((((((((((((((0 != wl_st) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (r_st != 0)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((d == 0) && (c2_st != 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (r_st != 0)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (2 == wl_pc)) && (wb_st == 0)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((c1_st != 0) && (d == 0)) && (c2_st != 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (processed == 0)) && (e_e == e_f)) && (0 == wl_pc)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (data == ((long long) t_b + 1))) && (c1_st == 0)) && (2 == wl_pc)) && (wb_st == 0)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((0 != wl_st) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((0 != wl_st) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c1_i == 1)) && (c2_i == 1)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (r_i <= 0))) || ((((((((((((((((((((((d == 0) && (c2_st != 0)) && (wb_pc == 1)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || ((((d == 0) && (t_b == 0)) && (data == 0)) && (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0)) || (((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((0 != wl_st) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (c2_pc == 1)) && (wl_pc == 1)) && (wb_i == 1)) && (2 <= e_wl)) && (r_i <= 0))) || ((((((((((((((((((((((c1_st != 0) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (processed == 0)) && (e_e == e_f)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) - InvariantResult [Line: 545]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((d == 0) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (r_st == 2)) && (c1_i == 1)) && (c2_i == 1)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0)) || ((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_e != 0)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((0 != wl_st) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c1_i == 1)) && (c2_i == 1)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (r_i <= 0))) || ((((((((((((((((((((((c1_st != 0) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (wl_pc == 1)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((0 != wl_st) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (c2_pc == 1)) && (wl_pc == 1)) && (wb_i == 1)) && (2 <= e_wl)) && (r_i <= 0))) || ((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) - InvariantResult [Line: 298]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0)) || (((((((((((((((((((((0 != wl_st) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (data == ((long long) t_b + 1))) && (c1_st == 0)) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (2 == wl_pc)) && (wb_st == 0)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((0 != wl_st) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((c1_st != 0) && (d == 0)) && (c2_st != 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (0 == wl_pc)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((c1_st != 0) && ((((long long) t_b + 1) == d) || (((long long) t_b + 2) == d))) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((0 != wl_st) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (r_st != 0)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((0 != wl_st) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (data == ((long long) t_b + 1))) && (c1_st == 0)) && (2 == wl_pc)) && (wb_st == 0)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((c1_st != 0) && ((((long long) t_b + 1) == d) || (((long long) t_b + 2) == d))) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_e != 0)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((c1_st != 0) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (processed == 0)) && (e_e == e_f)) && (0 == wl_pc)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (wb_pc == 1)) && (c2_st == 0)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (wb_st == 0)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((d == 0) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (r_st != 0)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((c1_st != 0) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (processed == 0)) && (e_e == e_f)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((d == 0) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((d == 0) && (c2_st != 0)) && (wb_pc == 1)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((0 != wl_st) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_e != 0)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((0 != wl_st) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c1_i == 1)) && (c2_i == 1)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (r_i <= 0))) || ((((((((((((((((((((((c1_st != 0) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (wl_pc == 1)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((0 != wl_st) && (wb_pc == 1)) && (c2_st == 0)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (data == t_b)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (c1_st == 0)) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((d == 0) && (c2_st != 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((c1_st != 0) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((0 != wl_st) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (c2_pc == 1)) && (wl_pc == 1)) && (wb_i == 1)) && (2 <= e_wl)) && (r_i <= 0))) || ((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((0 != wl_st) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (r_st != 0)) && (c2_pc == 1)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) - InvariantResult [Line: 65]: Location Invariant Derived location invariant: (((((((((((((((((((((((0 != wl_st) && ((((long long) t_b + 1) == d) || (((long long) t_b + 2) == d))) && (wb_pc == 1)) && (e_e != 0)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (data == ((long long) t_b + 1))) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0)) || ((((((((((((((((((0 != wl_st) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((0 != wl_st) && (d == 0)) && (wb_pc == 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) - InvariantResult [Line: 140]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0)) || ((((((((((((((((((((((c1_st != 0) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (processed == 0)) && (e_e == e_f)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (2 == wl_pc)) && (wb_st == 0)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((c1_st != 0) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((c1_st != 0) && (d == 0)) && (c2_st != 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (0 == wl_pc)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (r_st != 0)) && (c2_pc == 1)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (wb_pc == 1)) && (c2_st == 0)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (wb_st == 0)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (r_st != 0)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((((((((((c1_st != 0) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (r_st != 0)) && (processed == 0)) && (e_e == e_f)) && (0 == wl_pc)) && (wb_st == 0)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((0 != wl_st) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c1_i == 1)) && (c2_i == 1)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (r_i <= 0))) || ((((d == 0) && (t_b == 0)) && (data == 0)) && (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0)) || (((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((((((0 != wl_st) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (c2_pc == 1)) && (wl_pc == 1)) && (wb_i == 1)) && (2 <= e_wl)) && (r_i <= 0))) - InvariantResult [Line: 230]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((c1_st != 0) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (processed == 0)) && (e_e == e_f)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0)) || (((((((((((((((((((((((d == 0) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c2_st != 0)) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (data == ((long long) t_b + 1))) && (c1_st == 0)) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (((long long) t_b + 2) == c_t)) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((d == 0) && (c2_st != 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (wb_pc == 1)) && (c2_st == 0)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (e_f != 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((0 != wl_st) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((0 != wl_st) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (wb_st != 0)) && (r_st != 0)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (c1_st == 0)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((c1_st != 0) && (d == 0)) && (c2_st != 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (2 <= e_c)) && (r_i <= 0))) || (((((((((((((((((((((((0 != wl_st) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (e_e != 1)) && (c_req_up == 0)) && (e_g == 2)) && (wb_pc == 0)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (wl_pc == 1)) && (processed == 0)) && (e_e == e_f)) && (wb_i == 1)) && (2 <= e_c)) && (r_i <= 0))) || ((((((((((0 != wl_st) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (c1_i == 1)) && (c2_i == 1)) && (0 == wl_pc)) && (wb_i == 1)) && (2 <= e_wl)) && (r_i <= 0))) || ((((((((((((((0 != wl_st) && (wb_pc == 1)) && (e_e != 0)) && (e_e != 1)) && (e_f != 1)) && (e_g == 2)) && (c1_i == 1)) && (c2_i == 1)) && (c1_pc == 1)) && (c2_pc == 1)) && (wl_pc == 1)) && (wb_i == 1)) && (2 <= e_wl)) && (r_i <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-16 19:04:18,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE