./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label30.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/Problem14_label30.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 46305506117a7249be58d8d8d8c60453578281c1cbb0dca593851bdc92c5fe11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:47:45,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:47:45,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:47:45,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:47:45,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:47:45,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:47:45,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:47:45,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:47:45,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:47:45,281 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:47:45,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:47:45,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:47:45,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:47:45,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:47:45,282 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:47:45,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:47:45,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:47:45,283 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:47:45,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:47:45,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:47:45,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:47:45,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:47:45,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:47:45,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:47:45,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:47:45,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:47:45,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:47:45,284 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:47:45,284 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:47:45,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:47:45,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:47:45,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:47:45,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:47:45,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:47:45,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:47:45,285 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:47:45,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:47:45,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:47:45,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:47:45,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:47:45,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:47:45,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:47:45,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:47:45,285 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 -> 46305506117a7249be58d8d8d8c60453578281c1cbb0dca593851bdc92c5fe11 [2025-03-03 10:47:45,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:47:45,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:47:45,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:47:45,501 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:47:45,501 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:47:45,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label30.c [2025-03-03 10:47:46,652 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/809d6e2d7/e9a775421e2548209610deb2b1c8f47c/FLAG7d3f2de98 [2025-03-03 10:47:46,908 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:47:46,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label30.c [2025-03-03 10:47:46,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/809d6e2d7/e9a775421e2548209610deb2b1c8f47c/FLAG7d3f2de98 [2025-03-03 10:47:46,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/809d6e2d7/e9a775421e2548209610deb2b1c8f47c [2025-03-03 10:47:46,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:47:46,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:47:46,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:47:46,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:47:46,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:47:46,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:46" (1/1) ... [2025-03-03 10:47:46,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d4770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:46, skipping insertion in model container [2025-03-03 10:47:46,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:46" (1/1) ... [2025-03-03 10:47:46,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:47:47,132 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/Problem14_label30.c[4533,4546] [2025-03-03 10:47:47,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:47:47,287 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:47:47,302 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/Problem14_label30.c[4533,4546] [2025-03-03 10:47:47,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:47:47,365 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:47:47,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:47 WrapperNode [2025-03-03 10:47:47,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:47:47,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:47:47,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:47:47,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:47:47,371 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:47:47" (1/1) ... [2025-03-03 10:47:47,388 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:47:47" (1/1) ... [2025-03-03 10:47:47,443 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-03 10:47:47,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:47:47,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:47:47,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:47:47,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:47:47,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:47" (1/1) ... [2025-03-03 10:47:47,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:47" (1/1) ... [2025-03-03 10:47:47,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:47" (1/1) ... [2025-03-03 10:47:47,486 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:47:47,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:47" (1/1) ... [2025-03-03 10:47:47,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:47" (1/1) ... [2025-03-03 10:47:47,507 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:47" (1/1) ... [2025-03-03 10:47:47,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:47" (1/1) ... [2025-03-03 10:47:47,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:47" (1/1) ... [2025-03-03 10:47:47,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:47" (1/1) ... [2025-03-03 10:47:47,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:47:47,530 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:47:47,530 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:47:47,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:47:47,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:47" (1/1) ... [2025-03-03 10:47:47,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:47:47,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:47,560 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:47:47,562 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:47:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:47:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:47:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:47:47,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:47:47,631 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:47:47,632 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:47:48,555 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-03 10:47:48,555 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:47:48,563 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:47:48,564 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:47:48,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:48 BoogieIcfgContainer [2025-03-03 10:47:48,564 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:47:48,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:47:48,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:47:48,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:47:48,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:47:46" (1/3) ... [2025-03-03 10:47:48,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbbfd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:47:48, skipping insertion in model container [2025-03-03 10:47:48,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:47" (2/3) ... [2025-03-03 10:47:48,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbbfd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:47:48, skipping insertion in model container [2025-03-03 10:47:48,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:48" (3/3) ... [2025-03-03 10:47:48,575 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label30.c [2025-03-03 10:47:48,586 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:47:48,588 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label30.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:47:48,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:47:48,645 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;@16dca42d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:47:48,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:47:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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:47:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 10:47:48,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:48,657 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] [2025-03-03 10:47:48,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:48,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:48,660 INFO L85 PathProgramCache]: Analyzing trace with hash -456735524, now seen corresponding path program 1 times [2025-03-03 10:47:48,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:48,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311269035] [2025-03-03 10:47:48,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:48,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 10:47:48,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 10:47:48,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:48,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:48,940 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:47:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311269035] [2025-03-03 10:47:48,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311269035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:48,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:48,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:47:48,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363818012] [2025-03-03 10:47:48,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:48,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:48,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:48,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:48,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:48,964 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:47:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:49,716 INFO L93 Difference]: Finished difference Result 685 states and 1213 transitions. [2025-03-03 10:47:49,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:49,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-03 10:47:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:49,726 INFO L225 Difference]: With dead ends: 685 [2025-03-03 10:47:49,726 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 10:47:49,729 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:47:49,730 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:49,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 139 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:47:49,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 10:47:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-03 10:47:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.4206128133704736) internal successors, (510), 359 states have internal predecessors, (510), 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:47:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2025-03-03 10:47:49,777 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 43 [2025-03-03 10:47:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:49,778 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2025-03-03 10:47:49,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:47:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2025-03-03 10:47:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 10:47:49,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:49,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:49,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:47:49,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:49,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:49,785 INFO L85 PathProgramCache]: Analyzing trace with hash 159377643, now seen corresponding path program 1 times [2025-03-03 10:47:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:49,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251452600] [2025-03-03 10:47:49,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:49,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:49,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 10:47:49,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 10:47:49,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:49,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:47:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251452600] [2025-03-03 10:47:50,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251452600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:50,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:50,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:50,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082903602] [2025-03-03 10:47:50,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:50,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:50,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:50,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:50,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:47:50,167 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 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:47:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:50,946 INFO L93 Difference]: Finished difference Result 1074 states and 1446 transitions. [2025-03-03 10:47:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:50,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 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 122 [2025-03-03 10:47:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:50,950 INFO L225 Difference]: With dead ends: 1074 [2025-03-03 10:47:50,950 INFO L226 Difference]: Without dead ends: 716 [2025-03-03 10:47:50,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:47:50,952 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:50,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 121 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:47:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-03-03 10:47:50,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-03-03 10:47:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.2615384615384615) internal successors, (902), 715 states have internal predecessors, (902), 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:47:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 902 transitions. [2025-03-03 10:47:50,990 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 902 transitions. Word has length 122 [2025-03-03 10:47:50,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:50,991 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 902 transitions. [2025-03-03 10:47:50,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 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:47:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 902 transitions. [2025-03-03 10:47:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 10:47:50,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:50,995 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:50,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:47:50,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:50,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash 784675756, now seen corresponding path program 1 times [2025-03-03 10:47:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:50,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678055726] [2025-03-03 10:47:50,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:50,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:51,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 10:47:51,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 10:47:51,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:51,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:47:51,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:51,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678055726] [2025-03-03 10:47:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678055726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:51,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565824890] [2025-03-03 10:47:51,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:51,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:51,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:51,241 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:47:51,242 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:47:51,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 10:47:51,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 10:47:51,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:51,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:51,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:47:51,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 10:47:51,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:51,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565824890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:51,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:51,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:47:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409804737] [2025-03-03 10:47:51,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:51,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:51,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:51,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:47:51,501 INFO L87 Difference]: Start difference. First operand 716 states and 902 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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:47:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:51,954 INFO L93 Difference]: Finished difference Result 1252 states and 1612 transitions. [2025-03-03 10:47:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 148 [2025-03-03 10:47:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:51,958 INFO L225 Difference]: With dead ends: 1252 [2025-03-03 10:47:51,958 INFO L226 Difference]: Without dead ends: 1250 [2025-03-03 10:47:51,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:47:51,959 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 91 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:51,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 36 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-03 10:47:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 894. [2025-03-03 10:47:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.3370660694288914) internal successors, (1194), 893 states have internal predecessors, (1194), 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:47:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1194 transitions. [2025-03-03 10:47:51,982 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1194 transitions. Word has length 148 [2025-03-03 10:47:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:51,983 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1194 transitions. [2025-03-03 10:47:51,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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:47:51,984 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1194 transitions. [2025-03-03 10:47:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 10:47:51,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:51,987 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:47:51,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:47:52,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:52,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:52,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash 618256515, now seen corresponding path program 1 times [2025-03-03 10:47:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:52,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527184592] [2025-03-03 10:47:52,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:52,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 10:47:52,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 10:47:52,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:52,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 10:47:52,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:52,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527184592] [2025-03-03 10:47:52,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527184592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:52,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:52,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:52,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307813313] [2025-03-03 10:47:52,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:52,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:52,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:52,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:52,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:47:52,386 INFO L87 Difference]: Start difference. First operand 894 states and 1194 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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:47:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:52,968 INFO L93 Difference]: Finished difference Result 1993 states and 2629 transitions. [2025-03-03 10:47:52,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:52,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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 202 [2025-03-03 10:47:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:52,971 INFO L225 Difference]: With dead ends: 1993 [2025-03-03 10:47:52,972 INFO L226 Difference]: Without dead ends: 1072 [2025-03-03 10:47:52,973 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:47:52,974 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 116 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:52,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 119 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:47:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-03-03 10:47:53,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2025-03-03 10:47:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.1802054154995332) internal successors, (1264), 1071 states have internal predecessors, (1264), 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:47:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2025-03-03 10:47:53,006 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 202 [2025-03-03 10:47:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:53,006 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2025-03-03 10:47:53,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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:47:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2025-03-03 10:47:53,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 10:47:53,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:53,008 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, 2, 2, 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] [2025-03-03 10:47:53,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:47:53,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:53,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:53,009 INFO L85 PathProgramCache]: Analyzing trace with hash 986059473, now seen corresponding path program 1 times [2025-03-03 10:47:53,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:53,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668735705] [2025-03-03 10:47:53,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:53,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:53,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 10:47:53,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 10:47:53,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:53,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 81 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:47:53,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:53,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668735705] [2025-03-03 10:47:53,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668735705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:53,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587768021] [2025-03-03 10:47:53,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:53,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:53,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:53,306 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:47:53,308 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:47:53,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 10:47:53,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 10:47:53,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:53,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:53,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:47:53,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-03 10:47:53,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587768021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:53,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:53,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 10:47:53,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655899382] [2025-03-03 10:47:53,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:53,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:53,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:53,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:53,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:47:53,568 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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:47:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:54,006 INFO L93 Difference]: Finished difference Result 2320 states and 2779 transitions. [2025-03-03 10:47:54,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:54,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 214 [2025-03-03 10:47:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:54,010 INFO L225 Difference]: With dead ends: 2320 [2025-03-03 10:47:54,011 INFO L226 Difference]: Without dead ends: 1250 [2025-03-03 10:47:54,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:47:54,012 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:54,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 47 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-03 10:47:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1072. [2025-03-03 10:47:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.1671335200746966) internal successors, (1250), 1071 states have internal predecessors, (1250), 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:47:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1250 transitions. [2025-03-03 10:47:54,028 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1250 transitions. Word has length 214 [2025-03-03 10:47:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:54,028 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1250 transitions. [2025-03-03 10:47:54,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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:47:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1250 transitions. [2025-03-03 10:47:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 10:47:54,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:54,030 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, 2, 2, 2, 2, 2, 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] [2025-03-03 10:47:54,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:47:54,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:54,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:54,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:54,231 INFO L85 PathProgramCache]: Analyzing trace with hash 909209986, now seen corresponding path program 1 times [2025-03-03 10:47:54,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:54,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328960694] [2025-03-03 10:47:54,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:54,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:54,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 10:47:54,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 10:47:54,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:54,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:47:54,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328960694] [2025-03-03 10:47:54,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328960694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:54,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:54,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:54,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555094024] [2025-03-03 10:47:54,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:54,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:54,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:54,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:54,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:54,405 INFO L87 Difference]: Start difference. First operand 1072 states and 1250 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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:47:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:54,817 INFO L93 Difference]: Finished difference Result 2854 states and 3362 transitions. [2025-03-03 10:47:54,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:54,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 217 [2025-03-03 10:47:54,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:54,823 INFO L225 Difference]: With dead ends: 2854 [2025-03-03 10:47:54,823 INFO L226 Difference]: Without dead ends: 1784 [2025-03-03 10:47:54,824 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:47:54,825 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 112 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:54,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 76 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-03-03 10:47:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784. [2025-03-03 10:47:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1289960740325296) internal successors, (2013), 1783 states have internal predecessors, (2013), 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:47:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2013 transitions. [2025-03-03 10:47:54,869 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2013 transitions. Word has length 217 [2025-03-03 10:47:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:54,869 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2013 transitions. [2025-03-03 10:47:54,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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:47:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2013 transitions. [2025-03-03 10:47:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-03 10:47:54,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:54,873 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:47:54,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:47:54,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:54,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash -602299861, now seen corresponding path program 1 times [2025-03-03 10:47:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:54,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594425846] [2025-03-03 10:47:54,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:54,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-03 10:47:54,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-03 10:47:54,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:54,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-03-03 10:47:55,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:55,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594425846] [2025-03-03 10:47:55,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594425846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:55,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:55,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:55,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733819975] [2025-03-03 10:47:55,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:55,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:55,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:55,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:55,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:47:55,086 INFO L87 Difference]: Start difference. First operand 1784 states and 2013 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 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:47:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:55,573 INFO L93 Difference]: Finished difference Result 3624 states and 4105 transitions. [2025-03-03 10:47:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:55,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 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 334 [2025-03-03 10:47:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:55,578 INFO L225 Difference]: With dead ends: 3624 [2025-03-03 10:47:55,578 INFO L226 Difference]: Without dead ends: 1962 [2025-03-03 10:47:55,580 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:47:55,580 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:55,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:47:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-03-03 10:47:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2025-03-03 10:47:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.0846887268648346) internal successors, (1934), 1783 states have internal predecessors, (1934), 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:47:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1934 transitions. [2025-03-03 10:47:55,604 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1934 transitions. Word has length 334 [2025-03-03 10:47:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:55,605 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 1934 transitions. [2025-03-03 10:47:55,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 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:47:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1934 transitions. [2025-03-03 10:47:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-03 10:47:55,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:55,608 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, 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, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:55,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:47:55,609 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:55,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:55,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1518071774, now seen corresponding path program 1 times [2025-03-03 10:47:55,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:55,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611988198] [2025-03-03 10:47:55,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:55,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:55,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-03 10:47:55,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-03 10:47:55,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:55,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:55,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:55,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611988198] [2025-03-03 10:47:55,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611988198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:55,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:55,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:55,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890252216] [2025-03-03 10:47:55,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:55,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:55,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:55,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:55,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:55,961 INFO L87 Difference]: Start difference. First operand 1784 states and 1934 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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:47:56,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:56,352 INFO L93 Difference]: Finished difference Result 4278 states and 4675 transitions. [2025-03-03 10:47:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:56,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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 429 [2025-03-03 10:47:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:56,360 INFO L225 Difference]: With dead ends: 4278 [2025-03-03 10:47:56,360 INFO L226 Difference]: Without dead ends: 2674 [2025-03-03 10:47:56,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:56,362 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:56,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 245 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2025-03-03 10:47:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2140. [2025-03-03 10:47:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.071996259934549) internal successors, (2293), 2139 states have internal predecessors, (2293), 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:47:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2293 transitions. [2025-03-03 10:47:56,395 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2293 transitions. Word has length 429 [2025-03-03 10:47:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:56,396 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2293 transitions. [2025-03-03 10:47:56,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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:47:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2293 transitions. [2025-03-03 10:47:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-03 10:47:56,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:56,400 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:56,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:47:56,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:56,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:56,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1734819989, now seen corresponding path program 1 times [2025-03-03 10:47:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:56,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198369693] [2025-03-03 10:47:56,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:56,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:56,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-03 10:47:56,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-03 10:47:56,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:56,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:56,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:56,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198369693] [2025-03-03 10:47:56,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198369693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:56,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:56,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:56,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763823038] [2025-03-03 10:47:56,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:56,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:56,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:56,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:56,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:56,817 INFO L87 Difference]: Start difference. First operand 2140 states and 2293 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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:47:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:57,199 INFO L93 Difference]: Finished difference Result 4634 states and 5045 transitions. [2025-03-03 10:47:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:57,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 436 [2025-03-03 10:47:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:57,209 INFO L225 Difference]: With dead ends: 4634 [2025-03-03 10:47:57,209 INFO L226 Difference]: Without dead ends: 2674 [2025-03-03 10:47:57,212 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:47:57,213 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:57,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 220 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2025-03-03 10:47:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2025-03-03 10:47:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.081570996978852) internal successors, (2506), 2317 states have internal predecessors, (2506), 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:47:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2506 transitions. [2025-03-03 10:47:57,273 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2506 transitions. Word has length 436 [2025-03-03 10:47:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:57,273 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2506 transitions. [2025-03-03 10:47:57,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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:47:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2506 transitions. [2025-03-03 10:47:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-03 10:47:57,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:57,279 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:57,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:47:57,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:57,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1109252300, now seen corresponding path program 1 times [2025-03-03 10:47:57,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:57,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465974743] [2025-03-03 10:47:57,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:57,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-03 10:47:57,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-03 10:47:57,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:57,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:57,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:57,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465974743] [2025-03-03 10:47:57,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465974743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:57,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:57,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707037363] [2025-03-03 10:47:57,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:57,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:57,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:57,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:57,451 INFO L87 Difference]: Start difference. First operand 2318 states and 2506 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:47:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:57,873 INFO L93 Difference]: Finished difference Result 5168 states and 5658 transitions. [2025-03-03 10:47:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:57,874 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 477 [2025-03-03 10:47:57,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:57,881 INFO L225 Difference]: With dead ends: 5168 [2025-03-03 10:47:57,882 INFO L226 Difference]: Without dead ends: 3030 [2025-03-03 10:47:57,884 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:47:57,884 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:57,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 52 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:57,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2025-03-03 10:47:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2852. [2025-03-03 10:47:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.0810242020343739) internal successors, (3082), 2851 states have internal predecessors, (3082), 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:47:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3082 transitions. [2025-03-03 10:47:57,930 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3082 transitions. Word has length 477 [2025-03-03 10:47:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:57,930 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3082 transitions. [2025-03-03 10:47:57,931 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:47:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3082 transitions. [2025-03-03 10:47:57,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-03 10:47:57,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:57,934 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, 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, 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, 1, 1, 1, 1, 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:47:57,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:47:57,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:57,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:57,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1171888510, now seen corresponding path program 1 times [2025-03-03 10:47:57,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:57,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040149916] [2025-03-03 10:47:57,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:57,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:57,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-03 10:47:57,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-03 10:47:57,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:57,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-03 10:47:58,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:58,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040149916] [2025-03-03 10:47:58,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040149916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:58,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:58,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:58,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449607251] [2025-03-03 10:47:58,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:58,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:58,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:58,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:58,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:58,292 INFO L87 Difference]: Start difference. First operand 2852 states and 3082 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) 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:47:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:58,684 INFO L93 Difference]: Finished difference Result 6236 states and 6826 transitions. [2025-03-03 10:47:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:58,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) 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 591 [2025-03-03 10:47:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:58,695 INFO L225 Difference]: With dead ends: 6236 [2025-03-03 10:47:58,695 INFO L226 Difference]: Without dead ends: 3564 [2025-03-03 10:47:58,698 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:47:58,699 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:58,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 240 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2025-03-03 10:47:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3386. [2025-03-03 10:47:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.0782865583456425) internal successors, (3650), 3385 states have internal predecessors, (3650), 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:47:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3650 transitions. [2025-03-03 10:47:58,740 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3650 transitions. Word has length 591 [2025-03-03 10:47:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:58,741 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3650 transitions. [2025-03-03 10:47:58,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) 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:47:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3650 transitions. [2025-03-03 10:47:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-03 10:47:58,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:58,745 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:58,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:47:58,745 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:58,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:58,746 INFO L85 PathProgramCache]: Analyzing trace with hash -491754298, now seen corresponding path program 1 times [2025-03-03 10:47:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:58,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295262724] [2025-03-03 10:47:58,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:58,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:58,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 10:47:58,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 10:47:58,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:58,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 1074 proven. 104 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2025-03-03 10:47:59,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295262724] [2025-03-03 10:47:59,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295262724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302375511] [2025-03-03 10:47:59,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:59,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:59,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:59,239 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:47:59,241 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:47:59,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 10:47:59,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 10:47:59,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:59,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:59,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:47:59,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2025-03-03 10:47:59,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302375511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:59,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:59,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:47:59,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442108769] [2025-03-03 10:47:59,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:59,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:59,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:59,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:59,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:47:59,451 INFO L87 Difference]: Start difference. First operand 3386 states and 3650 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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:47:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:59,851 INFO L93 Difference]: Finished difference Result 7304 states and 7953 transitions. [2025-03-03 10:47:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:59,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 622 [2025-03-03 10:47:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:59,861 INFO L225 Difference]: With dead ends: 7304 [2025-03-03 10:47:59,861 INFO L226 Difference]: Without dead ends: 4098 [2025-03-03 10:47:59,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:47:59,865 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 138 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:59,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 247 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2025-03-03 10:47:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3920. [2025-03-03 10:47:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.079612145955601) internal successors, (4231), 3919 states have internal predecessors, (4231), 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:47:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4231 transitions. [2025-03-03 10:47:59,920 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4231 transitions. Word has length 622 [2025-03-03 10:47:59,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:59,921 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 4231 transitions. [2025-03-03 10:47:59,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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:47:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4231 transitions. [2025-03-03 10:47:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2025-03-03 10:47:59,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:59,926 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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:47:59,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:48:00,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:00,127 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:00,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:00,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1043518769, now seen corresponding path program 1 times [2025-03-03 10:48:00,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:00,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334282708] [2025-03-03 10:48:00,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:00,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:00,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 652 statements into 1 equivalence classes. [2025-03-03 10:48:00,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 652 of 652 statements. [2025-03-03 10:48:00,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:00,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 1238 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2025-03-03 10:48:00,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:00,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334282708] [2025-03-03 10:48:00,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334282708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:00,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:00,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:48:00,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378435775] [2025-03-03 10:48:00,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:00,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:48:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:00,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:48:00,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:48:00,595 INFO L87 Difference]: Start difference. First operand 3920 states and 4231 transitions. Second operand has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 5 states have internal predecessors, (404), 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:48:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:01,515 INFO L93 Difference]: Finished difference Result 8728 states and 9399 transitions. [2025-03-03 10:48:01,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:48:01,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 5 states have internal predecessors, (404), 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 652 [2025-03-03 10:48:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:01,527 INFO L225 Difference]: With dead ends: 8728 [2025-03-03 10:48:01,527 INFO L226 Difference]: Without dead ends: 4988 [2025-03-03 10:48:01,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:48:01,531 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 283 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:01,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 75 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:48:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-03-03 10:48:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4454. [2025-03-03 10:48:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0707388277565686) internal successors, (4768), 4453 states have internal predecessors, (4768), 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:48:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4768 transitions. [2025-03-03 10:48:01,598 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4768 transitions. Word has length 652 [2025-03-03 10:48:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:01,599 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4768 transitions. [2025-03-03 10:48:01,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 5 states have internal predecessors, (404), 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:48:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4768 transitions. [2025-03-03 10:48:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 10:48:01,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:01,609 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 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] [2025-03-03 10:48:01,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:48:01,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:01,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash 431047320, now seen corresponding path program 1 times [2025-03-03 10:48:01,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:01,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191417108] [2025-03-03 10:48:01,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:01,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 10:48:01,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 10:48:01,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:01,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 1259 proven. 155 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2025-03-03 10:48:01,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:01,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191417108] [2025-03-03 10:48:01,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191417108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:01,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632294517] [2025-03-03 10:48:01,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:01,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:01,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:01,999 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:48:02,001 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:48:02,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 10:48:02,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 10:48:02,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:02,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:02,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:48:02,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:48:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-03-03 10:48:02,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:48:02,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632294517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:02,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:48:02,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:48:02,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090545898] [2025-03-03 10:48:02,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:02,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:02,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:02,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:02,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:48:02,222 INFO L87 Difference]: Start difference. First operand 4454 states and 4768 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:48:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:02,546 INFO L93 Difference]: Finished difference Result 5702 states and 6088 transitions. [2025-03-03 10:48:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:02,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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 779 [2025-03-03 10:48:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:02,560 INFO L225 Difference]: With dead ends: 5702 [2025-03-03 10:48:02,563 INFO L226 Difference]: Without dead ends: 5700 [2025-03-03 10:48:02,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 779 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:48:02,565 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 158 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:02,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 22 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:48:02,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-03-03 10:48:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 4810. [2025-03-03 10:48:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0713245997088792) internal successors, (5152), 4809 states have internal predecessors, (5152), 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:48:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5152 transitions. [2025-03-03 10:48:02,614 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5152 transitions. Word has length 779 [2025-03-03 10:48:02,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:02,614 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 5152 transitions. [2025-03-03 10:48:02,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:48:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5152 transitions. [2025-03-03 10:48:02,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2025-03-03 10:48:02,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:02,620 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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] [2025-03-03 10:48:02,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:48:02,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:02,821 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:02,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:02,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1294304997, now seen corresponding path program 1 times [2025-03-03 10:48:02,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:02,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704515837] [2025-03-03 10:48:02,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:02,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:02,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-03-03 10:48:02,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-03-03 10:48:02,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:02,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 1349 proven. 155 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2025-03-03 10:48:03,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:03,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704515837] [2025-03-03 10:48:03,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704515837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:03,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435512466] [2025-03-03 10:48:03,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:03,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:03,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:03,136 INFO L229 MonitoredProcess]: Starting monitored process 6 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:48:03,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:48:03,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-03-03 10:48:03,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-03-03 10:48:03,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:03,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:03,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:48:03,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:48:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2025-03-03 10:48:03,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:48:03,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435512466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:03,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:48:03,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:48:03,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177797740] [2025-03-03 10:48:03,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:03,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:03,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:03,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:03,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:48:03,357 INFO L87 Difference]: Start difference. First operand 4810 states and 5152 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:48:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:03,657 INFO L93 Difference]: Finished difference Result 10506 states and 11249 transitions. [2025-03-03 10:48:03,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:03,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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 797 [2025-03-03 10:48:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:03,659 INFO L225 Difference]: With dead ends: 10506 [2025-03-03 10:48:03,659 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:48:03,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 797 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:48:03,665 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 138 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:03,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 238 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:48:03,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:48:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:48:03,665 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:48:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:48:03,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 797 [2025-03-03 10:48:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:03,666 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:48:03,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:48:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:48:03,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:48:03,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:48:03,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:48:03,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 10:48:03,871 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:03,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:48:04,266 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:48:04,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:48:04 BoogieIcfgContainer [2025-03-03 10:48:04,284 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:48:04,284 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:48:04,284 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:48:04,285 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:48:04,285 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:48" (3/4) ... [2025-03-03 10:48:04,287 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:48:04,301 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:48:04,302 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:48:04,303 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:48:04,303 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:48:04,398 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:48:04,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:48:04,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:48:04,399 INFO L158 Benchmark]: Toolchain (without parser) took 17449.81ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 107.9MB in the beginning and 392.3MB in the end (delta: -284.4MB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. [2025-03-03 10:48:04,399 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:48:04,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.44ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 76.5MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 10:48:04,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.27ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 67.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:48:04,400 INFO L158 Benchmark]: Boogie Preprocessor took 85.83ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 56.1MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:48:04,400 INFO L158 Benchmark]: IcfgBuilder took 1033.80ms. Allocated memory is still 142.6MB. Free memory was 56.1MB in the beginning and 67.8MB in the end (delta: -11.7MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2025-03-03 10:48:04,400 INFO L158 Benchmark]: TraceAbstraction took 15718.44ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 67.8MB in the beginning and 404.9MB in the end (delta: -337.1MB). Peak memory consumption was 315.4MB. Max. memory is 16.1GB. [2025-03-03 10:48:04,401 INFO L158 Benchmark]: Witness Printer took 114.34ms. Allocated memory is still 595.6MB. Free memory was 404.9MB in the beginning and 392.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:48:04,402 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.44ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 76.5MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.27ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 67.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.83ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 56.1MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1033.80ms. Allocated memory is still 142.6MB. Free memory was 56.1MB in the beginning and 67.8MB in the end (delta: -11.7MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15718.44ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 67.8MB in the beginning and 404.9MB in the end (delta: -337.1MB). Peak memory consumption was 315.4MB. Max. memory is 16.1GB. * Witness Printer took 114.34ms. Allocated memory is still 595.6MB. Free memory was 404.9MB in the beginning and 392.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. 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: 143]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2260 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2260 mSDsluCounter, 1894 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 923 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8934 IncrementalHoareTripleChecker+Invalid, 9857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 923 mSolverCounterUnsat, 1800 mSDtfsCounter, 8934 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2609 GetRequests, 2572 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4810occurred in iteration=14, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 3560 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 8623 NumberOfCodeBlocks, 8623 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 8603 ConstructedInterpolants, 0 QuantifiedInterpolants, 26933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3271 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 15780/16299 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: 890]: Location Invariant Derived location invariant: (((((((((7 <= a15) && (a24 == 1)) || ((a21 == 8) && (a24 == 1))) || (((a15 <= 8) && (((long long) 49 + a12) <= 0)) && (10 <= a21))) || ((a24 == 1) && (a21 <= 6))) || ((a24 == 1) && (a15 <= 5))) || ((a24 == 1) && (a21 == 9))) || ((a12 <= 11) && (a24 == 1))) || (((a21 <= 6) && (((long long) 49 + a12) <= 0)) && (a15 <= 5))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:48:04,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE