./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/eca-rers2012/Problem11_label53.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 536fb035d928713a90d5c84a48f9ef94bf2f10bc408883dd0d7e11d670c7e07b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:33:52,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:33:52,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:33:52,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:33:52,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:33:52,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:33:52,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:33:52,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:33:52,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:33:52,736 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:33:52,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:33:52,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:33:52,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:33:52,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:33:52,736 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:33:52,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:33:52,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:33:52,737 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:33:52,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:33:52,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:33:52,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:33:52,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:33:52,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:33:52,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:33:52,737 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:33:52,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:33:52,737 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:33:52,737 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:33:52,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:33:52,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:33:52,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:33:52,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:33:52,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:33:52,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:33:52,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:33:52,738 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:33:52,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:33:52,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:33:52,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:33:52,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:33:52,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:33:52,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:33:52,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:33:52,739 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 -> 536fb035d928713a90d5c84a48f9ef94bf2f10bc408883dd0d7e11d670c7e07b [2025-03-03 10:33:52,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:33:52,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:33:52,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:33:52,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:33:52,984 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:33:52,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label53.c [2025-03-03 10:33:54,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a64fb13/7eb90cd93ff3424c91dbad8447b26196/FLAGe284f70a4 [2025-03-03 10:33:54,320 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:33:54,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label53.c [2025-03-03 10:33:54,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a64fb13/7eb90cd93ff3424c91dbad8447b26196/FLAGe284f70a4 [2025-03-03 10:33:54,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a64fb13/7eb90cd93ff3424c91dbad8447b26196 [2025-03-03 10:33:54,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:33:54,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:33:54,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:33:54,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:33:54,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:33:54,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:33:54" (1/1) ... [2025-03-03 10:33:54,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8c171b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:54, skipping insertion in model container [2025-03-03 10:33:54,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:33:54" (1/1) ... [2025-03-03 10:33:54,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:33:54,785 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/eca-rers2012/Problem11_label53.c[6841,6854] [2025-03-03 10:33:54,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:33:54,940 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:33:54,961 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/eca-rers2012/Problem11_label53.c[6841,6854] [2025-03-03 10:33:55,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:33:55,043 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:33:55,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55 WrapperNode [2025-03-03 10:33:55,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:33:55,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:33:55,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:33:55,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:33:55,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (1/1) ... [2025-03-03 10:33:55,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (1/1) ... [2025-03-03 10:33:55,132 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-03 10:33:55,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:33:55,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:33:55,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:33:55,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:33:55,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (1/1) ... [2025-03-03 10:33:55,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (1/1) ... [2025-03-03 10:33:55,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (1/1) ... [2025-03-03 10:33:55,207 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-03 10:33:55,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (1/1) ... [2025-03-03 10:33:55,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (1/1) ... [2025-03-03 10:33:55,247 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (1/1) ... [2025-03-03 10:33:55,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (1/1) ... [2025-03-03 10:33:55,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (1/1) ... [2025-03-03 10:33:55,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (1/1) ... [2025-03-03 10:33:55,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:33:55,276 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:33:55,277 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:33:55,277 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:33:55,278 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (1/1) ... [2025-03-03 10:33:55,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:33:55,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:55,301 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-03 10:33:55,306 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-03 10:33:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:33:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:33:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:33:55,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:33:55,368 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:33:55,369 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:33:56,488 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-03 10:33:56,488 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:33:56,502 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:33:56,504 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:33:56,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:33:56 BoogieIcfgContainer [2025-03-03 10:33:56,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:33:56,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:33:56,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:33:56,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:33:56,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:33:54" (1/3) ... [2025-03-03 10:33:56,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d016031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:33:56, skipping insertion in model container [2025-03-03 10:33:56,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:55" (2/3) ... [2025-03-03 10:33:56,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d016031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:33:56, skipping insertion in model container [2025-03-03 10:33:56,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:33:56" (3/3) ... [2025-03-03 10:33:56,513 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label53.c [2025-03-03 10:33:56,524 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:33:56,525 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label53.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:33:56,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:33:56,587 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;@c35bb3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:33:56,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:33:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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-03 10:33:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 10:33:56,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:56,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:56,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:56,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:56,601 INFO L85 PathProgramCache]: Analyzing trace with hash 50820504, now seen corresponding path program 1 times [2025-03-03 10:33:56,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:56,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969692836] [2025-03-03 10:33:56,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:56,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:56,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 10:33:56,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 10:33:56,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:56,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:56,868 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-03 10:33:56,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:56,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969692836] [2025-03-03 10:33:56,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969692836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:56,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:56,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:33:56,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831823501] [2025-03-03 10:33:56,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:56,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:56,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:56,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:56,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:56,890 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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-03 10:33:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:57,745 INFO L93 Difference]: Finished difference Result 776 states and 1360 transitions. [2025-03-03 10:33:57,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:57,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 47 [2025-03-03 10:33:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:57,754 INFO L225 Difference]: With dead ends: 776 [2025-03-03 10:33:57,755 INFO L226 Difference]: Without dead ends: 413 [2025-03-03 10:33:57,757 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-03 10:33:57,759 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 180 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:57,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:33:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-03 10:33:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2025-03-03 10:33:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 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-03 10:33:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2025-03-03 10:33:57,795 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 47 [2025-03-03 10:33:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:57,796 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2025-03-03 10:33:57,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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-03 10:33:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2025-03-03 10:33:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 10:33:57,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:57,798 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:33:57,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:33:57,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:57,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:57,799 INFO L85 PathProgramCache]: Analyzing trace with hash 991446562, now seen corresponding path program 1 times [2025-03-03 10:33:57,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:57,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361748841] [2025-03-03 10:33:57,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:57,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:57,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 10:33:57,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 10:33:57,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:57,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:58,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:58,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361748841] [2025-03-03 10:33:58,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361748841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:58,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:58,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:33:58,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646955316] [2025-03-03 10:33:58,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:58,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:58,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:58,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:58,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:58,010 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-03 10:33:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:58,602 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2025-03-03 10:33:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:58,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 115 [2025-03-03 10:33:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:58,605 INFO L225 Difference]: With dead ends: 1209 [2025-03-03 10:33:58,606 INFO L226 Difference]: Without dead ends: 800 [2025-03-03 10:33:58,607 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-03 10:33:58,607 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:58,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:33:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-03 10:33:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2025-03-03 10:33:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 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-03 10:33:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2025-03-03 10:33:58,632 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 115 [2025-03-03 10:33:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:58,632 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2025-03-03 10:33:58,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-03 10:33:58,632 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2025-03-03 10:33:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 10:33:58,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:58,635 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:33:58,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:33:58,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:58,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:58,636 INFO L85 PathProgramCache]: Analyzing trace with hash -940705209, now seen corresponding path program 1 times [2025-03-03 10:33:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:58,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131604413] [2025-03-03 10:33:58,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:58,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 10:33:58,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 10:33:58,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:58,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:58,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:58,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131604413] [2025-03-03 10:33:58,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131604413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:58,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:58,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:33:58,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221660597] [2025-03-03 10:33:58,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:58,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:58,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:58,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:58,864 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 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-03 10:33:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:59,325 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2025-03-03 10:33:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:59,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 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 117 [2025-03-03 10:33:59,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:59,329 INFO L225 Difference]: With dead ends: 1941 [2025-03-03 10:33:59,329 INFO L226 Difference]: Without dead ends: 1156 [2025-03-03 10:33:59,331 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-03 10:33:59,331 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:59,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:59,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-03-03 10:33:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2025-03-03 10:33:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 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-03 10:33:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2025-03-03 10:33:59,350 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 117 [2025-03-03 10:33:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:59,350 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2025-03-03 10:33:59,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 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-03 10:33:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2025-03-03 10:33:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 10:33:59,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:59,353 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:59,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:33:59,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:59,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1236061478, now seen corresponding path program 1 times [2025-03-03 10:33:59,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:59,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693158139] [2025-03-03 10:33:59,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:59,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 10:33:59,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 10:33:59,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:59,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:59,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:59,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693158139] [2025-03-03 10:33:59,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693158139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:59,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:59,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:59,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443347099] [2025-03-03 10:33:59,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:59,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:59,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:59,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:59,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:59,558 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-03 10:34:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:00,158 INFO L93 Difference]: Finished difference Result 2877 states and 3705 transitions. [2025-03-03 10:34:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:00,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 159 [2025-03-03 10:34:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:00,164 INFO L225 Difference]: With dead ends: 2877 [2025-03-03 10:34:00,164 INFO L226 Difference]: Without dead ends: 1723 [2025-03-03 10:34:00,166 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-03 10:34:00,167 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:00,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 335 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2025-03-03 10:34:00,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1529. [2025-03-03 10:34:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1528 states have (on average 1.2604712041884816) internal successors, (1926), 1528 states have internal predecessors, (1926), 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-03 10:34:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1926 transitions. [2025-03-03 10:34:00,190 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1926 transitions. Word has length 159 [2025-03-03 10:34:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:00,191 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 1926 transitions. [2025-03-03 10:34:00,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-03 10:34:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1926 transitions. [2025-03-03 10:34:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 10:34:00,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:00,194 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:34:00,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:34:00,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:00,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:00,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1819005431, now seen corresponding path program 1 times [2025-03-03 10:34:00,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:00,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836028745] [2025-03-03 10:34:00,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:00,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:00,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 10:34:00,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 10:34:00,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:00,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 10:34:00,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:00,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836028745] [2025-03-03 10:34:00,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836028745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:00,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:00,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:00,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439455613] [2025-03-03 10:34:00,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:00,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:00,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:00,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:00,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:00,397 INFO L87 Difference]: Start difference. First operand 1529 states and 1926 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-03 10:34:01,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:01,009 INFO L93 Difference]: Finished difference Result 3616 states and 4598 transitions. [2025-03-03 10:34:01,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:01,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 229 [2025-03-03 10:34:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:01,014 INFO L225 Difference]: With dead ends: 3616 [2025-03-03 10:34:01,014 INFO L226 Difference]: Without dead ends: 2089 [2025-03-03 10:34:01,015 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-03 10:34:01,016 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 150 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:01,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 387 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2025-03-03 10:34:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1896. [2025-03-03 10:34:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1895 states have (on average 1.2480211081794195) internal successors, (2365), 1895 states have internal predecessors, (2365), 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-03 10:34:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2365 transitions. [2025-03-03 10:34:01,041 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2365 transitions. Word has length 229 [2025-03-03 10:34:01,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:01,041 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2365 transitions. [2025-03-03 10:34:01,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-03 10:34:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2365 transitions. [2025-03-03 10:34:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-03 10:34:01,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:01,044 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 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-03 10:34:01,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:34:01,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:01,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:01,045 INFO L85 PathProgramCache]: Analyzing trace with hash 406571734, now seen corresponding path program 1 times [2025-03-03 10:34:01,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:01,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065576234] [2025-03-03 10:34:01,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:01,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:01,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-03 10:34:01,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-03 10:34:01,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:01,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-03 10:34:01,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:01,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065576234] [2025-03-03 10:34:01,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065576234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:01,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:01,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:34:01,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506305489] [2025-03-03 10:34:01,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:01,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:01,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:01,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:01,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:01,213 INFO L87 Difference]: Start difference. First operand 1896 states and 2365 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 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-03 10:34:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:01,794 INFO L93 Difference]: Finished difference Result 4903 states and 6169 transitions. [2025-03-03 10:34:01,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:01,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 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 247 [2025-03-03 10:34:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:01,801 INFO L225 Difference]: With dead ends: 4903 [2025-03-03 10:34:01,802 INFO L226 Difference]: Without dead ends: 3009 [2025-03-03 10:34:01,803 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-03 10:34:01,804 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:01,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2025-03-03 10:34:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 3008. [2025-03-03 10:34:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.2048553375457267) internal successors, (3623), 3007 states have internal predecessors, (3623), 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-03 10:34:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 3623 transitions. [2025-03-03 10:34:01,839 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 3623 transitions. Word has length 247 [2025-03-03 10:34:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:01,839 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 3623 transitions. [2025-03-03 10:34:01,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 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-03 10:34:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 3623 transitions. [2025-03-03 10:34:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-03 10:34:01,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:01,842 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:34:01,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:34:01,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:01,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:01,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1450107950, now seen corresponding path program 1 times [2025-03-03 10:34:01,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:01,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506153219] [2025-03-03 10:34:01,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:01,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:01,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-03 10:34:01,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-03 10:34:01,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:01,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:02,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:02,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506153219] [2025-03-03 10:34:02,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506153219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:02,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:02,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29083822] [2025-03-03 10:34:02,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:02,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:02,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:02,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:02,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:02,092 INFO L87 Difference]: Start difference. First operand 3008 states and 3623 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-03 10:34:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:02,722 INFO L93 Difference]: Finished difference Result 7501 states and 9171 transitions. [2025-03-03 10:34:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:02,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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 256 [2025-03-03 10:34:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:02,734 INFO L225 Difference]: With dead ends: 7501 [2025-03-03 10:34:02,734 INFO L226 Difference]: Without dead ends: 4495 [2025-03-03 10:34:02,737 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-03 10:34:02,738 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 116 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:02,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 180 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:02,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2025-03-03 10:34:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 4493. [2025-03-03 10:34:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4493 states, 4492 states have (on average 1.2050311665182547) internal successors, (5413), 4492 states have internal predecessors, (5413), 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-03 10:34:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4493 states to 4493 states and 5413 transitions. [2025-03-03 10:34:02,796 INFO L78 Accepts]: Start accepts. Automaton has 4493 states and 5413 transitions. Word has length 256 [2025-03-03 10:34:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:02,796 INFO L471 AbstractCegarLoop]: Abstraction has 4493 states and 5413 transitions. [2025-03-03 10:34:02,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-03 10:34:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4493 states and 5413 transitions. [2025-03-03 10:34:02,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-03 10:34:02,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:02,799 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:34:02,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:34:02,799 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:02,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2024108549, now seen corresponding path program 1 times [2025-03-03 10:34:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:02,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205350862] [2025-03-03 10:34:02,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:02,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 10:34:02,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 10:34:02,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:02,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:34:02,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:02,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205350862] [2025-03-03 10:34:02,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205350862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:02,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:02,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:02,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598616139] [2025-03-03 10:34:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:02,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:02,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:02,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:02,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:02,932 INFO L87 Difference]: Start difference. First operand 4493 states and 5413 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-03 10:34:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:03,538 INFO L93 Difference]: Finished difference Result 10273 states and 12522 transitions. [2025-03-03 10:34:03,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:03,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 266 [2025-03-03 10:34:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:03,551 INFO L225 Difference]: With dead ends: 10273 [2025-03-03 10:34:03,551 INFO L226 Difference]: Without dead ends: 5782 [2025-03-03 10:34:03,555 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-03 10:34:03,556 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 162 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:03,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 158 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5782 states. [2025-03-03 10:34:03,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5782 to 4481. [2025-03-03 10:34:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4481 states, 4480 states have (on average 1.2044642857142858) internal successors, (5396), 4480 states have internal predecessors, (5396), 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-03 10:34:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4481 states to 4481 states and 5396 transitions. [2025-03-03 10:34:03,615 INFO L78 Accepts]: Start accepts. Automaton has 4481 states and 5396 transitions. Word has length 266 [2025-03-03 10:34:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:03,615 INFO L471 AbstractCegarLoop]: Abstraction has 4481 states and 5396 transitions. [2025-03-03 10:34:03,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-03 10:34:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4481 states and 5396 transitions. [2025-03-03 10:34:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-03 10:34:03,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:03,618 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:34:03,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:34:03,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:03,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:03,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1516625351, now seen corresponding path program 1 times [2025-03-03 10:34:03,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:03,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235040172] [2025-03-03 10:34:03,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:03,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:03,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 10:34:03,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 10:34:03,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:03,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:04,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235040172] [2025-03-03 10:34:04,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235040172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:04,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:04,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:34:04,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52565024] [2025-03-03 10:34:04,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:04,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:34:04,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:04,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:34:04,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:34:04,067 INFO L87 Difference]: Start difference. First operand 4481 states and 5396 transitions. Second operand has 5 states, 5 states have (on average 53.2) internal successors, (266), 4 states have internal predecessors, (266), 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-03 10:34:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:05,539 INFO L93 Difference]: Finished difference Result 13583 states and 16769 transitions. [2025-03-03 10:34:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:34:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 4 states have internal predecessors, (266), 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 266 [2025-03-03 10:34:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:05,567 INFO L225 Difference]: With dead ends: 13583 [2025-03-03 10:34:05,570 INFO L226 Difference]: Without dead ends: 9104 [2025-03-03 10:34:05,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:34:05,578 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 374 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1802 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:05,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 107 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1802 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:34:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9104 states. [2025-03-03 10:34:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9104 to 8905. [2025-03-03 10:34:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8905 states, 8904 states have (on average 1.2004716981132075) internal successors, (10689), 8904 states have internal predecessors, (10689), 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-03 10:34:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8905 states to 8905 states and 10689 transitions. [2025-03-03 10:34:05,682 INFO L78 Accepts]: Start accepts. Automaton has 8905 states and 10689 transitions. Word has length 266 [2025-03-03 10:34:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:05,683 INFO L471 AbstractCegarLoop]: Abstraction has 8905 states and 10689 transitions. [2025-03-03 10:34:05,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 4 states have internal predecessors, (266), 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-03 10:34:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 8905 states and 10689 transitions. [2025-03-03 10:34:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 10:34:05,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:05,687 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:34:05,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:34:05,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:05,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:05,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2144428054, now seen corresponding path program 1 times [2025-03-03 10:34:05,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:05,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361105683] [2025-03-03 10:34:05,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:05,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:05,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 10:34:05,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 10:34:05,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:05,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:05,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:05,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361105683] [2025-03-03 10:34:05,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361105683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:05,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:05,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:05,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133822055] [2025-03-03 10:34:05,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:05,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:05,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:05,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:05,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:05,866 INFO L87 Difference]: Start difference. First operand 8905 states and 10689 transitions. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 3 states have internal predecessors, (271), 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-03 10:34:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:06,865 INFO L93 Difference]: Finished difference Result 25565 states and 31092 transitions. [2025-03-03 10:34:06,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:06,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 3 states have internal predecessors, (271), 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 271 [2025-03-03 10:34:06,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:06,894 INFO L225 Difference]: With dead ends: 25565 [2025-03-03 10:34:06,895 INFO L226 Difference]: Without dead ends: 17030 [2025-03-03 10:34:06,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:06,905 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 265 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:06,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 93 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:34:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17030 states. [2025-03-03 10:34:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17030 to 16845. [2025-03-03 10:34:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16845 states, 16844 states have (on average 1.1982308240322963) internal successors, (20183), 16844 states have internal predecessors, (20183), 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-03 10:34:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16845 states to 16845 states and 20183 transitions. [2025-03-03 10:34:07,102 INFO L78 Accepts]: Start accepts. Automaton has 16845 states and 20183 transitions. Word has length 271 [2025-03-03 10:34:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:07,102 INFO L471 AbstractCegarLoop]: Abstraction has 16845 states and 20183 transitions. [2025-03-03 10:34:07,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 3 states have internal predecessors, (271), 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-03 10:34:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 16845 states and 20183 transitions. [2025-03-03 10:34:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-03 10:34:07,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:07,107 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:34:07,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:34:07,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:07,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:07,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1452376517, now seen corresponding path program 1 times [2025-03-03 10:34:07,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:07,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803779559] [2025-03-03 10:34:07,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:07,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:07,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-03 10:34:07,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-03 10:34:07,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:07,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 10:34:07,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:07,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803779559] [2025-03-03 10:34:07,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803779559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:07,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:07,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:07,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19145185] [2025-03-03 10:34:07,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:07,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:07,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:07,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:07,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:07,219 INFO L87 Difference]: Start difference. First operand 16845 states and 20183 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-03 10:34:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:07,891 INFO L93 Difference]: Finished difference Result 37733 states and 45424 transitions. [2025-03-03 10:34:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:07,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 277 [2025-03-03 10:34:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:07,924 INFO L225 Difference]: With dead ends: 37733 [2025-03-03 10:34:07,924 INFO L226 Difference]: Without dead ends: 21258 [2025-03-03 10:34:07,939 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-03 10:34:07,940 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 172 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:07,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 354 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21258 states. [2025-03-03 10:34:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21258 to 20889. [2025-03-03 10:34:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20889 states, 20888 states have (on average 1.1862792033703562) internal successors, (24779), 20888 states have internal predecessors, (24779), 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-03 10:34:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20889 states to 20889 states and 24779 transitions. [2025-03-03 10:34:08,140 INFO L78 Accepts]: Start accepts. Automaton has 20889 states and 24779 transitions. Word has length 277 [2025-03-03 10:34:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:08,140 INFO L471 AbstractCegarLoop]: Abstraction has 20889 states and 24779 transitions. [2025-03-03 10:34:08,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-03 10:34:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 20889 states and 24779 transitions. [2025-03-03 10:34:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-03 10:34:08,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:08,162 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-03 10:34:08,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:34:08,162 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:08,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1590197186, now seen corresponding path program 1 times [2025-03-03 10:34:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152660421] [2025-03-03 10:34:08,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:08,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-03 10:34:08,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-03 10:34:08,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:08,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 462 proven. 78 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-03 10:34:08,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:08,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152660421] [2025-03-03 10:34:08,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152660421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:34:08,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121029520] [2025-03-03 10:34:08,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:08,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:08,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:08,923 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-03 10:34:08,925 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-03 10:34:08,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-03 10:34:09,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-03 10:34:09,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:09,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:09,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:34:09,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:34:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-03 10:34:09,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:34:09,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121029520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:09,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:34:09,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:34:09,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164819834] [2025-03-03 10:34:09,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:09,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:09,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:09,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:34:09,285 INFO L87 Difference]: Start difference. First operand 20889 states and 24779 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-03 10:34:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:09,851 INFO L93 Difference]: Finished difference Result 40672 states and 48340 transitions. [2025-03-03 10:34:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:09,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 416 [2025-03-03 10:34:09,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:09,884 INFO L225 Difference]: With dead ends: 40672 [2025-03-03 10:34:09,884 INFO L226 Difference]: Without dead ends: 21446 [2025-03-03 10:34:09,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:34:09,898 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 127 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:09,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 173 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:34:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21446 states. [2025-03-03 10:34:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21446 to 20889. [2025-03-03 10:34:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20889 states, 20888 states have (on average 1.1578896974339334) internal successors, (24186), 20888 states have internal predecessors, (24186), 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-03 10:34:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20889 states to 20889 states and 24186 transitions. [2025-03-03 10:34:10,081 INFO L78 Accepts]: Start accepts. Automaton has 20889 states and 24186 transitions. Word has length 416 [2025-03-03 10:34:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:10,082 INFO L471 AbstractCegarLoop]: Abstraction has 20889 states and 24186 transitions. [2025-03-03 10:34:10,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-03 10:34:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 20889 states and 24186 transitions. [2025-03-03 10:34:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-03 10:34:10,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:10,101 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:34:10,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:34:10,302 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,SelfDestructingSolverStorable11 [2025-03-03 10:34:10,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:10,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1639804673, now seen corresponding path program 1 times [2025-03-03 10:34:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:10,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559859677] [2025-03-03 10:34:10,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:10,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:10,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-03 10:34:10,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-03 10:34:10,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:10,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 10:34:11,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:11,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559859677] [2025-03-03 10:34:11,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559859677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:11,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:11,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:34:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895902288] [2025-03-03 10:34:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:11,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:34:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:11,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:34:11,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:34:11,126 INFO L87 Difference]: Start difference. First operand 20889 states and 24186 transitions. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 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-03 10:34:12,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:12,307 INFO L93 Difference]: Finished difference Result 43992 states and 50890 transitions. [2025-03-03 10:34:12,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:34:12,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 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 417 [2025-03-03 10:34:12,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:12,336 INFO L225 Difference]: With dead ends: 43992 [2025-03-03 10:34:12,336 INFO L226 Difference]: Without dead ends: 23473 [2025-03-03 10:34:12,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:34:12,353 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 251 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:12,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 230 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:34:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23473 states. [2025-03-03 10:34:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23473 to 23096. [2025-03-03 10:34:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23096 states, 23095 states have (on average 1.1551851050010824) internal successors, (26679), 23095 states have internal predecessors, (26679), 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-03 10:34:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23096 states to 23096 states and 26679 transitions. [2025-03-03 10:34:12,572 INFO L78 Accepts]: Start accepts. Automaton has 23096 states and 26679 transitions. Word has length 417 [2025-03-03 10:34:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:12,572 INFO L471 AbstractCegarLoop]: Abstraction has 23096 states and 26679 transitions. [2025-03-03 10:34:12,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 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-03 10:34:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 23096 states and 26679 transitions. [2025-03-03 10:34:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-03-03 10:34:12,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:12,587 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:34:12,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:34:12,587 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:12,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1190740541, now seen corresponding path program 1 times [2025-03-03 10:34:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:12,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582477537] [2025-03-03 10:34:12,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:12,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-03 10:34:12,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-03 10:34:12,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:12,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-03 10:34:12,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:12,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582477537] [2025-03-03 10:34:12,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582477537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:12,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:12,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:12,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039347061] [2025-03-03 10:34:12,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:12,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:12,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:12,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:12,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:12,846 INFO L87 Difference]: Start difference. First operand 23096 states and 26679 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-03 10:34:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:13,433 INFO L93 Difference]: Finished difference Result 47476 states and 54921 transitions. [2025-03-03 10:34:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:13,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 418 [2025-03-03 10:34:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:13,462 INFO L225 Difference]: With dead ends: 47476 [2025-03-03 10:34:13,462 INFO L226 Difference]: Without dead ends: 24934 [2025-03-03 10:34:13,478 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-03 10:34:13,478 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 116 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:13,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 327 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:34:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24934 states. [2025-03-03 10:34:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24934 to 24198. [2025-03-03 10:34:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24198 states, 24197 states have (on average 1.139686738025375) internal successors, (27577), 24197 states have internal predecessors, (27577), 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-03 10:34:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24198 states to 24198 states and 27577 transitions. [2025-03-03 10:34:13,689 INFO L78 Accepts]: Start accepts. Automaton has 24198 states and 27577 transitions. Word has length 418 [2025-03-03 10:34:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:13,690 INFO L471 AbstractCegarLoop]: Abstraction has 24198 states and 27577 transitions. [2025-03-03 10:34:13,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-03 10:34:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 24198 states and 27577 transitions. [2025-03-03 10:34:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-03 10:34:13,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:13,705 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:34:13,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:34:13,706 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:13,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1725539192, now seen corresponding path program 1 times [2025-03-03 10:34:13,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:13,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307245559] [2025-03-03 10:34:13,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:13,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:13,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-03 10:34:13,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-03 10:34:13,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:13,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 395 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 10:34:14,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:14,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307245559] [2025-03-03 10:34:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307245559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:34:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058702305] [2025-03-03 10:34:14,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:14,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:14,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:14,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:34:14,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:34:14,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-03 10:34:14,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-03 10:34:14,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:14,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:14,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:34:14,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:34:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 282 proven. 121 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 10:34:15,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:34:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 282 proven. 121 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 10:34:17,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058702305] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:34:17,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:34:17,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-03-03 10:34:17,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268749651] [2025-03-03 10:34:17,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:34:17,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 10:34:17,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:17,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 10:34:17,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:34:17,615 INFO L87 Difference]: Start difference. First operand 24198 states and 27577 transitions. Second operand has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 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-03 10:34:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:20,639 INFO L93 Difference]: Finished difference Result 58728 states and 66791 transitions. [2025-03-03 10:34:20,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 10:34:20,639 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 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 427 [2025-03-03 10:34:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:20,674 INFO L225 Difference]: With dead ends: 58728 [2025-03-03 10:34:20,674 INFO L226 Difference]: Without dead ends: 34347 [2025-03-03 10:34:20,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2025-03-03 10:34:20,693 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1595 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3798 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 4535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 3798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:20,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 174 Invalid, 4535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 3798 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:34:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34347 states. [2025-03-03 10:34:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34347 to 22171. [2025-03-03 10:34:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22171 states, 22170 states have (on average 1.1117726657645466) internal successors, (24648), 22170 states have internal predecessors, (24648), 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-03 10:34:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22171 states to 22171 states and 24648 transitions. [2025-03-03 10:34:20,922 INFO L78 Accepts]: Start accepts. Automaton has 22171 states and 24648 transitions. Word has length 427 [2025-03-03 10:34:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:20,922 INFO L471 AbstractCegarLoop]: Abstraction has 22171 states and 24648 transitions. [2025-03-03 10:34:20,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 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-03 10:34:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 22171 states and 24648 transitions. [2025-03-03 10:34:20,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-03 10:34:20,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:20,932 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:34:20,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:34:21,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 10:34:21,132 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:21,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1994475306, now seen corresponding path program 1 times [2025-03-03 10:34:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:21,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475289364] [2025-03-03 10:34:21,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:21,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:21,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-03 10:34:21,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-03 10:34:21,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:21,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-03-03 10:34:21,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:21,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475289364] [2025-03-03 10:34:21,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475289364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:21,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:21,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:21,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488583972] [2025-03-03 10:34:21,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:21,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:21,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:21,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:21,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:21,273 INFO L87 Difference]: Start difference. First operand 22171 states and 24648 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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-03 10:34:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:21,776 INFO L93 Difference]: Finished difference Result 45073 states and 50164 transitions. [2025-03-03 10:34:21,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:21,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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 438 [2025-03-03 10:34:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:21,798 INFO L225 Difference]: With dead ends: 45073 [2025-03-03 10:34:21,798 INFO L226 Difference]: Without dead ends: 24561 [2025-03-03 10:34:21,807 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-03 10:34:21,808 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 176 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:21,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 139 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:34:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24561 states. [2025-03-03 10:34:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24561 to 19955. [2025-03-03 10:34:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19955 states, 19954 states have (on average 1.107497243660419) internal successors, (22099), 19954 states have internal predecessors, (22099), 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-03 10:34:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19955 states to 19955 states and 22099 transitions. [2025-03-03 10:34:21,981 INFO L78 Accepts]: Start accepts. Automaton has 19955 states and 22099 transitions. Word has length 438 [2025-03-03 10:34:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:21,982 INFO L471 AbstractCegarLoop]: Abstraction has 19955 states and 22099 transitions. [2025-03-03 10:34:21,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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-03 10:34:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 19955 states and 22099 transitions. [2025-03-03 10:34:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-03 10:34:21,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:21,991 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 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-03 10:34:21,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:34:21,991 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:21,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash 216494880, now seen corresponding path program 1 times [2025-03-03 10:34:21,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:21,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145031285] [2025-03-03 10:34:21,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:21,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:22,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-03 10:34:22,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-03 10:34:22,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:22,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:22,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:22,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145031285] [2025-03-03 10:34:22,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145031285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:22,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:22,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:34:22,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355139993] [2025-03-03 10:34:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:22,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:22,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:22,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:22,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:22,230 INFO L87 Difference]: Start difference. First operand 19955 states and 22099 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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-03 10:34:23,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:23,061 INFO L93 Difference]: Finished difference Result 41020 states and 45487 transitions. [2025-03-03 10:34:23,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:23,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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 449 [2025-03-03 10:34:23,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:23,082 INFO L225 Difference]: With dead ends: 41020 [2025-03-03 10:34:23,082 INFO L226 Difference]: Without dead ends: 22909 [2025-03-03 10:34:23,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:23,095 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 184 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:23,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 61 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:34:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22909 states. [2025-03-03 10:34:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22909 to 20875. [2025-03-03 10:34:23,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20875 states, 20874 states have (on average 1.1002203698380761) internal successors, (22966), 20874 states have internal predecessors, (22966), 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-03 10:34:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20875 states to 20875 states and 22966 transitions. [2025-03-03 10:34:23,329 INFO L78 Accepts]: Start accepts. Automaton has 20875 states and 22966 transitions. Word has length 449 [2025-03-03 10:34:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:23,329 INFO L471 AbstractCegarLoop]: Abstraction has 20875 states and 22966 transitions. [2025-03-03 10:34:23,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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-03 10:34:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 20875 states and 22966 transitions. [2025-03-03 10:34:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-03 10:34:23,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:23,339 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:34:23,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:34:23,340 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:23,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1085064909, now seen corresponding path program 1 times [2025-03-03 10:34:23,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:23,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536608338] [2025-03-03 10:34:23,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:23,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-03 10:34:23,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-03 10:34:23,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:23,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-03 10:34:23,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:23,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536608338] [2025-03-03 10:34:23,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536608338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:23,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:23,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:23,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940929149] [2025-03-03 10:34:23,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:23,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:23,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:23,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:23,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:23,551 INFO L87 Difference]: Start difference. First operand 20875 states and 22966 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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-03 10:34:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:24,071 INFO L93 Difference]: Finished difference Result 42298 states and 46540 transitions. [2025-03-03 10:34:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:24,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 464 [2025-03-03 10:34:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:24,093 INFO L225 Difference]: With dead ends: 42298 [2025-03-03 10:34:24,093 INFO L226 Difference]: Without dead ends: 22162 [2025-03-03 10:34:24,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-03 10:34:24,107 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 120 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:24,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 299 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:34:24,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22162 states. [2025-03-03 10:34:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22162 to 20322. [2025-03-03 10:34:24,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20322 states, 20321 states have (on average 1.0942866984892476) internal successors, (22237), 20321 states have internal predecessors, (22237), 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-03 10:34:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20322 states to 20322 states and 22237 transitions. [2025-03-03 10:34:24,266 INFO L78 Accepts]: Start accepts. Automaton has 20322 states and 22237 transitions. Word has length 464 [2025-03-03 10:34:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:24,266 INFO L471 AbstractCegarLoop]: Abstraction has 20322 states and 22237 transitions. [2025-03-03 10:34:24,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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-03 10:34:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 20322 states and 22237 transitions. [2025-03-03 10:34:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-03 10:34:24,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:24,278 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:24,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:34:24,279 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:24,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:24,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1522083759, now seen corresponding path program 1 times [2025-03-03 10:34:24,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:24,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007531753] [2025-03-03 10:34:24,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:24,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:24,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-03 10:34:24,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-03 10:34:24,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:24,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 535 proven. 162 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:34:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007531753] [2025-03-03 10:34:25,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007531753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:34:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861022509] [2025-03-03 10:34:25,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:25,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:25,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:25,034 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:34:25,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:34:25,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-03 10:34:25,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-03 10:34:25,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:25,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:25,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:34:25,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:34:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-03 10:34:25,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:34:25,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861022509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:25,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:34:25,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-03 10:34:25,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566868031] [2025-03-03 10:34:25,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:25,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:25,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:25,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:25,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:34:25,254 INFO L87 Difference]: Start difference. First operand 20322 states and 22237 transitions. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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-03 10:34:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:25,720 INFO L93 Difference]: Finished difference Result 40282 states and 44076 transitions. [2025-03-03 10:34:25,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:25,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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 502 [2025-03-03 10:34:25,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:25,738 INFO L225 Difference]: With dead ends: 40282 [2025-03-03 10:34:25,738 INFO L226 Difference]: Without dead ends: 20146 [2025-03-03 10:34:25,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:34:25,751 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 78 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:25,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 339 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:34:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20146 states. [2025-03-03 10:34:25,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20146 to 19953. [2025-03-03 10:34:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19953 states, 19952 states have (on average 1.072674418604651) internal successors, (21402), 19952 states have internal predecessors, (21402), 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-03 10:34:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19953 states to 19953 states and 21402 transitions. [2025-03-03 10:34:25,968 INFO L78 Accepts]: Start accepts. Automaton has 19953 states and 21402 transitions. Word has length 502 [2025-03-03 10:34:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:25,968 INFO L471 AbstractCegarLoop]: Abstraction has 19953 states and 21402 transitions. [2025-03-03 10:34:25,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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-03 10:34:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 19953 states and 21402 transitions. [2025-03-03 10:34:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-03 10:34:25,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:25,980 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:34:25,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:34:26,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:26,180 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:26,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash 529886483, now seen corresponding path program 1 times [2025-03-03 10:34:26,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:26,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641375642] [2025-03-03 10:34:26,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:26,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-03 10:34:26,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-03 10:34:26,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:26,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-03 10:34:26,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:26,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641375642] [2025-03-03 10:34:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641375642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:26,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:26,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:26,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956341739] [2025-03-03 10:34:26,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:26,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:26,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:26,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:26,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:26,490 INFO L87 Difference]: Start difference. First operand 19953 states and 21402 transitions. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 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-03 10:34:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:27,229 INFO L93 Difference]: Finished difference Result 38808 states and 41703 transitions. [2025-03-03 10:34:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:27,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 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 530 [2025-03-03 10:34:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:27,250 INFO L225 Difference]: With dead ends: 38808 [2025-03-03 10:34:27,250 INFO L226 Difference]: Without dead ends: 20699 [2025-03-03 10:34:27,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:27,263 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 206 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:27,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 110 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:27,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20699 states. [2025-03-03 10:34:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20699 to 20141. [2025-03-03 10:34:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20141 states, 20140 states have (on average 1.0722939424031777) internal successors, (21596), 20140 states have internal predecessors, (21596), 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-03 10:34:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20141 states to 20141 states and 21596 transitions. [2025-03-03 10:34:27,413 INFO L78 Accepts]: Start accepts. Automaton has 20141 states and 21596 transitions. Word has length 530 [2025-03-03 10:34:27,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:27,414 INFO L471 AbstractCegarLoop]: Abstraction has 20141 states and 21596 transitions. [2025-03-03 10:34:27,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 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-03 10:34:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand 20141 states and 21596 transitions. [2025-03-03 10:34:27,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2025-03-03 10:34:27,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:27,424 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:27,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:34:27,424 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:27,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:27,425 INFO L85 PathProgramCache]: Analyzing trace with hash 712868576, now seen corresponding path program 1 times [2025-03-03 10:34:27,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:27,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769952678] [2025-03-03 10:34:27,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:27,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:27,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 583 statements into 1 equivalence classes. [2025-03-03 10:34:27,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 583 of 583 statements. [2025-03-03 10:34:27,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:27,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1165 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2025-03-03 10:34:27,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:27,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769952678] [2025-03-03 10:34:27,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769952678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:27,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:27,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:27,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469544449] [2025-03-03 10:34:27,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:27,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:27,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:27,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:27,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:27,632 INFO L87 Difference]: Start difference. First operand 20141 states and 21596 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-03 10:34:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:28,040 INFO L93 Difference]: Finished difference Result 38989 states and 41830 transitions. [2025-03-03 10:34:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:28,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 583 [2025-03-03 10:34:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:28,058 INFO L225 Difference]: With dead ends: 38989 [2025-03-03 10:34:28,058 INFO L226 Difference]: Without dead ends: 20692 [2025-03-03 10:34:28,069 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-03 10:34:28,069 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 194 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:28,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 341 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:34:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20692 states. [2025-03-03 10:34:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20692 to 20140. [2025-03-03 10:34:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20140 states, 20139 states have (on average 1.0721485674561795) internal successors, (21592), 20139 states have internal predecessors, (21592), 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-03 10:34:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20140 states to 20140 states and 21592 transitions. [2025-03-03 10:34:28,211 INFO L78 Accepts]: Start accepts. Automaton has 20140 states and 21592 transitions. Word has length 583 [2025-03-03 10:34:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:28,211 INFO L471 AbstractCegarLoop]: Abstraction has 20140 states and 21592 transitions. [2025-03-03 10:34:28,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-03 10:34:28,211 INFO L276 IsEmpty]: Start isEmpty. Operand 20140 states and 21592 transitions. [2025-03-03 10:34:28,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-03-03 10:34:28,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:28,221 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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] [2025-03-03 10:34:28,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:34:28,221 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:28,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:28,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1240520486, now seen corresponding path program 1 times [2025-03-03 10:34:28,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:28,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007392301] [2025-03-03 10:34:28,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:28,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:28,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-03 10:34:28,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-03 10:34:28,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:28,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2025-03-03 10:34:28,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007392301] [2025-03-03 10:34:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007392301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:28,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:28,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:28,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954183212] [2025-03-03 10:34:28,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:28,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:28,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:28,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:28,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:28,376 INFO L87 Difference]: Start difference. First operand 20140 states and 21592 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-03 10:34:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:28,771 INFO L93 Difference]: Finished difference Result 38988 states and 41828 transitions. [2025-03-03 10:34:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:28,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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 586 [2025-03-03 10:34:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:28,788 INFO L225 Difference]: With dead ends: 38988 [2025-03-03 10:34:28,788 INFO L226 Difference]: Without dead ends: 18846 [2025-03-03 10:34:28,800 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-03 10:34:28,802 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 130 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:28,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 133 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:34:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18846 states. [2025-03-03 10:34:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18846 to 17189. [2025-03-03 10:34:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17189 states, 17188 states have (on average 1.057947405166395) internal successors, (18184), 17188 states have internal predecessors, (18184), 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-03 10:34:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17189 states to 17189 states and 18184 transitions. [2025-03-03 10:34:28,942 INFO L78 Accepts]: Start accepts. Automaton has 17189 states and 18184 transitions. Word has length 586 [2025-03-03 10:34:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:28,943 INFO L471 AbstractCegarLoop]: Abstraction has 17189 states and 18184 transitions. [2025-03-03 10:34:28,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-03 10:34:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 17189 states and 18184 transitions. [2025-03-03 10:34:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-03-03 10:34:28,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:28,951 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:34:28,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:34:28,952 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:28,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:28,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1148231204, now seen corresponding path program 1 times [2025-03-03 10:34:28,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:28,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306881080] [2025-03-03 10:34:28,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:28,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:28,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-03-03 10:34:29,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-03-03 10:34:29,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:29,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 721 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-03-03 10:34:29,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:29,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306881080] [2025-03-03 10:34:29,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306881080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:29,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:29,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:29,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354068105] [2025-03-03 10:34:29,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:29,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:29,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:29,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:29,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:29,227 INFO L87 Difference]: Start difference. First operand 17189 states and 18184 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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-03 10:34:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:29,646 INFO L93 Difference]: Finished difference Result 34369 states and 36369 transitions. [2025-03-03 10:34:29,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:29,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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 609 [2025-03-03 10:34:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:29,660 INFO L225 Difference]: With dead ends: 34369 [2025-03-03 10:34:29,661 INFO L226 Difference]: Without dead ends: 19024 [2025-03-03 10:34:29,669 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-03 10:34:29,669 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 143 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:29,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 62 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:34:29,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19024 states. [2025-03-03 10:34:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19024 to 17179. [2025-03-03 10:34:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17179 states, 17178 states have (on average 1.053265805099546) internal successors, (18093), 17178 states have internal predecessors, (18093), 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-03 10:34:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17179 states to 17179 states and 18093 transitions. [2025-03-03 10:34:29,790 INFO L78 Accepts]: Start accepts. Automaton has 17179 states and 18093 transitions. Word has length 609 [2025-03-03 10:34:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:29,790 INFO L471 AbstractCegarLoop]: Abstraction has 17179 states and 18093 transitions. [2025-03-03 10:34:29,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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-03 10:34:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 17179 states and 18093 transitions. [2025-03-03 10:34:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-03-03 10:34:29,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:29,798 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:29,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 10:34:29,798 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:29,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash -755119569, now seen corresponding path program 1 times [2025-03-03 10:34:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:29,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611959185] [2025-03-03 10:34:29,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:29,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-03-03 10:34:29,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-03-03 10:34:29,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:29,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 852 proven. 34 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-03-03 10:34:30,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:30,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611959185] [2025-03-03 10:34:30,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611959185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:34:30,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429705101] [2025-03-03 10:34:30,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:30,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:30,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:30,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:34:30,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:34:30,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-03-03 10:34:30,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-03-03 10:34:30,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:30,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:30,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:34:30,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:34:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-03-03 10:34:30,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:34:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429705101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:30,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:34:30,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:34:30,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274520186] [2025-03-03 10:34:30,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:30,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:30,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:30,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:30,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:34:30,647 INFO L87 Difference]: Start difference. First operand 17179 states and 18093 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-03 10:34:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:31,120 INFO L93 Difference]: Finished difference Result 35472 states and 37398 transitions. [2025-03-03 10:34:31,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:31,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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 613 [2025-03-03 10:34:31,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:31,141 INFO L225 Difference]: With dead ends: 35472 [2025-03-03 10:34:31,141 INFO L226 Difference]: Without dead ends: 20137 [2025-03-03 10:34:31,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 612 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:34:31,154 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:31,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 64 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:34:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20137 states. [2025-03-03 10:34:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20137 to 17731. [2025-03-03 10:34:31,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17731 states, 17730 states have (on average 1.052791878172589) internal successors, (18666), 17730 states have internal predecessors, (18666), 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-03 10:34:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17731 states to 17731 states and 18666 transitions. [2025-03-03 10:34:31,342 INFO L78 Accepts]: Start accepts. Automaton has 17731 states and 18666 transitions. Word has length 613 [2025-03-03 10:34:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:31,343 INFO L471 AbstractCegarLoop]: Abstraction has 17731 states and 18666 transitions. [2025-03-03 10:34:31,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-03 10:34:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 17731 states and 18666 transitions. [2025-03-03 10:34:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-03-03 10:34:31,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:31,351 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:31,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:34:31,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:31,551 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:31,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash 301135936, now seen corresponding path program 1 times [2025-03-03 10:34:31,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:31,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798101692] [2025-03-03 10:34:31,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:31,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:31,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-03 10:34:31,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-03 10:34:31,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:31,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 946 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-03-03 10:34:31,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:31,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798101692] [2025-03-03 10:34:31,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798101692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:31,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:31,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144183417] [2025-03-03 10:34:31,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:31,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:31,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:31,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:31,878 INFO L87 Difference]: Start difference. First operand 17731 states and 18666 transitions. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 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-03 10:34:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:32,491 INFO L93 Difference]: Finished difference Result 35465 states and 37402 transitions. [2025-03-03 10:34:32,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:32,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 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 614 [2025-03-03 10:34:32,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:32,510 INFO L225 Difference]: With dead ends: 35465 [2025-03-03 10:34:32,510 INFO L226 Difference]: Without dead ends: 19394 [2025-03-03 10:34:32,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:32,520 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 181 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:32,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 73 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:34:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19394 states. [2025-03-03 10:34:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19394 to 17362. [2025-03-03 10:34:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17362 states, 17361 states have (on average 1.0521859339899775) internal successors, (18267), 17361 states have internal predecessors, (18267), 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-03 10:34:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17362 states to 17362 states and 18267 transitions. [2025-03-03 10:34:32,653 INFO L78 Accepts]: Start accepts. Automaton has 17362 states and 18267 transitions. Word has length 614 [2025-03-03 10:34:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:32,654 INFO L471 AbstractCegarLoop]: Abstraction has 17362 states and 18267 transitions. [2025-03-03 10:34:32,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 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-03 10:34:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 17362 states and 18267 transitions. [2025-03-03 10:34:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2025-03-03 10:34:32,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:32,661 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:32,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 10:34:32,661 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:32,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1965860965, now seen corresponding path program 1 times [2025-03-03 10:34:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:32,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441583054] [2025-03-03 10:34:32,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:32,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:32,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-03-03 10:34:32,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-03-03 10:34:32,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:32,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 1140 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-03 10:34:33,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:33,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441583054] [2025-03-03 10:34:33,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441583054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:33,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:33,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:34:33,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867810116] [2025-03-03 10:34:33,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:33,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:33,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:33,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:33,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:33,086 INFO L87 Difference]: Start difference. First operand 17362 states and 18267 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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-03 10:34:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:33,736 INFO L93 Difference]: Finished difference Result 36385 states and 38366 transitions. [2025-03-03 10:34:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:33,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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 620 [2025-03-03 10:34:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:33,753 INFO L225 Difference]: With dead ends: 36385 [2025-03-03 10:34:33,753 INFO L226 Difference]: Without dead ends: 19211 [2025-03-03 10:34:33,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:33,761 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 186 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:33,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 78 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19211 states. [2025-03-03 10:34:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19211 to 19206. [2025-03-03 10:34:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19206 states, 19205 states have (on average 1.0530590991929185) internal successors, (20224), 19205 states have internal predecessors, (20224), 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-03 10:34:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19206 states to 19206 states and 20224 transitions. [2025-03-03 10:34:33,898 INFO L78 Accepts]: Start accepts. Automaton has 19206 states and 20224 transitions. Word has length 620 [2025-03-03 10:34:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:33,898 INFO L471 AbstractCegarLoop]: Abstraction has 19206 states and 20224 transitions. [2025-03-03 10:34:33,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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-03 10:34:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 19206 states and 20224 transitions. [2025-03-03 10:34:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2025-03-03 10:34:33,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:33,906 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:33,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 10:34:33,906 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:33,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:33,907 INFO L85 PathProgramCache]: Analyzing trace with hash -642341636, now seen corresponding path program 1 times [2025-03-03 10:34:33,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:33,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227937949] [2025-03-03 10:34:33,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:33,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:33,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes. [2025-03-03 10:34:33,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements. [2025-03-03 10:34:33,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:33,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2025-03-03 10:34:34,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:34,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227937949] [2025-03-03 10:34:34,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227937949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:34,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:34,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:34,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059893002] [2025-03-03 10:34:34,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:34,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:34,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:34,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:34,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:34,312 INFO L87 Difference]: Start difference. First operand 19206 states and 20224 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-03 10:34:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:34,659 INFO L93 Difference]: Finished difference Result 19209 states and 20229 transitions. [2025-03-03 10:34:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:34,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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 627 [2025-03-03 10:34:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:34,661 INFO L225 Difference]: With dead ends: 19209 [2025-03-03 10:34:34,661 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:34:34,666 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-03 10:34:34,667 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 143 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:34,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 322 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:34:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:34:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:34:34,667 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-03 10:34:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:34:34,668 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 627 [2025-03-03 10:34:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:34,668 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:34:34,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-03 10:34:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:34:34,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:34:34,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:34:34,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 10:34:34,673 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] [2025-03-03 10:34:34,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:34:39,806 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:34:39,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:34:39 BoogieIcfgContainer [2025-03-03 10:34:39,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:34:39,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:34:39,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:34:39,827 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:34:39,829 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:33:56" (3/4) ... [2025-03-03 10:34:39,831 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:34:39,863 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:34:39,865 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:34:39,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:34:39,870 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:34:40,034 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:34:40,035 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:34:40,035 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:34:40,036 INFO L158 Benchmark]: Toolchain (without parser) took 45405.97ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 103.4MB in the beginning and 193.7MB in the end (delta: -90.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-03 10:34:40,036 INFO L158 Benchmark]: CDTParser took 1.31ms. Allocated memory is still 201.3MB. Free memory was 129.2MB in the beginning and 128.9MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:34:40,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.30ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 60.1MB in the end (delta: 43.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 10:34:40,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.35ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 43.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:34:40,036 INFO L158 Benchmark]: Boogie Preprocessor took 140.17ms. Allocated memory is still 142.6MB. Free memory was 43.3MB in the beginning and 81.9MB in the end (delta: -38.6MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2025-03-03 10:34:40,037 INFO L158 Benchmark]: IcfgBuilder took 1228.66ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 81.9MB in the beginning and 319.9MB in the end (delta: -238.0MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2025-03-03 10:34:40,037 INFO L158 Benchmark]: TraceAbstraction took 43319.64ms. Allocated memory was 427.8MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 319.0MB in the beginning and 672.4MB in the end (delta: -353.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-03 10:34:40,037 INFO L158 Benchmark]: Witness Printer took 207.90ms. Allocated memory was 1.8GB in the beginning and 285.2MB in the end (delta: -1.5GB). Free memory was 668.4MB in the beginning and 193.7MB in the end (delta: 474.7MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2025-03-03 10:34:40,039 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.31ms. Allocated memory is still 201.3MB. Free memory was 129.2MB in the beginning and 128.9MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.30ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 60.1MB in the end (delta: 43.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.35ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 43.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.17ms. Allocated memory is still 142.6MB. Free memory was 43.3MB in the beginning and 81.9MB in the end (delta: -38.6MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1228.66ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 81.9MB in the beginning and 319.9MB in the end (delta: -238.0MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * TraceAbstraction took 43319.64ms. Allocated memory was 427.8MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 319.0MB in the beginning and 672.4MB in the end (delta: -353.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 207.90ms. Allocated memory was 1.8GB in the beginning and 285.2MB in the end (delta: -1.5GB). Free memory was 668.4MB in the beginning and 193.7MB in the end (delta: 474.7MB). Peak memory consumption was 9.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: 157]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.1s, OverallIterations: 27, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5855 SdHoareTripleChecker+Valid, 17.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5855 mSDsluCounter, 5208 SdHoareTripleChecker+Invalid, 14.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 873 mSDsCounter, 3423 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22759 IncrementalHoareTripleChecker+Invalid, 26182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3423 mSolverCounterUnsat, 4335 mSDtfsCounter, 22759 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2497 GetRequests, 2421 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24198occurred in iteration=14, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 34033 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 12521 NumberOfCodeBlocks, 12521 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 12916 ConstructedInterpolants, 0 QuantifiedInterpolants, 48683 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2614 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 32 InterpolantComputations, 26 PerfectInterpolantSequences, 17825/18349 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: 1044]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((a25 == 11) && (a29 <= 599998)) && (a4 == 1)) && (130 <= a29)) || ((((a23 <= 278) && (a29 <= 599998)) && (99915 <= a29)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 == 13) && (a23 <= 278)) && (99912 <= a29)) && (a29 <= 599998)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || (((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a3 == 1)) && (312 <= a23)) && (a8 == 15))) || ((((a25 == 11) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 12) && (307 <= a23)) && (a29 <= 274)) && (130 <= a29))) || (((a25 == 11) && (a23 <= 138)) && (0 <= ((long long) a23 + 42)))) || ((((a29 <= 220) && ((((a25 == 12) && (a4 == 1)) && (a29 <= 130)) || ((a25 == 11) && (a4 == 1)))) || ((a25 <= 10) && (a4 == 1))) && (a23 <= 138))) || ((((a25 == 12) && (261 <= a29)) && (a29 <= 274)) && (((long long) a23 + 599772) <= 0))) || ((((a25 == 12) && (a29 <= 274)) && (a4 != 1)) && (130 <= a29))) || (((((long long) a29 + 22) <= 0) && (0 <= ((long long) a29 + 28553))) && (a25 == 10))) || ((((261 <= a29) && (a25 <= 10)) && (a29 <= 599998)) && (a23 <= 138))) || ((((261 <= a29) && (a25 == 11)) && (a29 <= 599998)) && (((long long) 119992 + a23) <= 0))) || ((((a25 == 13) && (307 <= a23)) && (a29 <= 599998)) && (a4 == 1))) || ((a4 == 1) && (a25 == 10))) || ((((a25 == 13) && (((long long) a29 + 22) <= 0)) && (((long long) a23 + 599772) <= 0)) && (a4 != 1))) || (((((long long) a29 + 22) <= 0) && (a25 <= 10)) && (a23 <= 138))) || ((((a25 == 13) && (a29 <= 245)) && (a4 == 1)) && (130 <= a29))) || (((a25 <= 10) && (a4 == 1)) && (130 <= a29))) || ((((a29 <= 274) && (a23 <= 138)) && (a4 != 1)) && (0 <= ((long long) a23 + 42)))) || ((((307 <= a23) && (a25 <= 10)) && (a29 <= 245)) && (130 <= a29))) || (((((a25 == 13) && (a29 <= 274)) && (a23 <= 138)) && (a4 != 1)) && (130 <= a29))) || ((((a25 == 12) && (261 <= a29)) && (307 <= a23)) && (a29 <= 277))) || (((((a25 == 12) && (261 <= a29)) && (a23 < 307)) && (a29 <= 599998)) && (a4 != 1))) || (((((((307 <= a23) && (a25 != 12)) && (a23 <= 312)) && (99915 <= a29)) || (((a23 < 307) && (99915 <= a29)) && (0 <= ((long long) a23 + 42)))) && (a29 <= 599998)) && (a4 == 1))) || ((((a23 <= 278) && (a25 == 12)) && (a29 <= 274)) && (0 <= ((long long) a23 + 42)))) || ((((a23 <= 278) && (a25 == 12)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || (((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a4 != 1))) || ((((a23 <= 278) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || ((((261 <= a29) && (a25 == 11)) && (a4 == 1)) && (312 <= a23))) || (((a25 == 11) && (a29 <= 245)) && (((long long) 119992 + a23) <= 0))) || (((a25 == 11) && (((long long) a29 + 22) <= 0)) && (a23 <= 138))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:34:40,055 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