./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label24.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label24.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 63c3a28a771a7642d2d01d4b50ea8f0914adef37135dc9c64a20524a1e6d797b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:32:20,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:32:20,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:32:20,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:32:20,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:32:20,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:32:20,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:32:20,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:32:20,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:32:20,663 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:32:20,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:32:20,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:32:20,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:32:20,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:32:20,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:32:20,665 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:32:20,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:32:20,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:32:20,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:32:20,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:32:20,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:32:20,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:32:20,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:32:20,666 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:32:20,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:32:20,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:32:20,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:32:20,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:32:20,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:32:20,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:32:20,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:32:20,667 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 -> 63c3a28a771a7642d2d01d4b50ea8f0914adef37135dc9c64a20524a1e6d797b [2025-03-03 10:32:20,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:32:20,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:32:20,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:32:20,883 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:32:20,883 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:32:20,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label24.c [2025-03-03 10:32:22,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88c35a81/d0359aae26304ff3abb96f34665ebbb0/FLAG14fd82ad1 [2025-03-03 10:32:22,323 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:32:22,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label24.c [2025-03-03 10:32:22,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88c35a81/d0359aae26304ff3abb96f34665ebbb0/FLAG14fd82ad1 [2025-03-03 10:32:22,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88c35a81/d0359aae26304ff3abb96f34665ebbb0 [2025-03-03 10:32:22,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:32:22,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:32:22,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:32:22,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:32:22,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:32:22,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:32:22" (1/1) ... [2025-03-03 10:32:22,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d076140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:22, skipping insertion in model container [2025-03-03 10:32:22,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:32:22" (1/1) ... [2025-03-03 10:32:22,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:32:22,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label24.c[7451,7464] [2025-03-03 10:32:22,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:32:22,896 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:32:22,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label24.c[7451,7464] [2025-03-03 10:32:22,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:32:23,001 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:32:23,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:23 WrapperNode [2025-03-03 10:32:23,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:32:23,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:32:23,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:32:23,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:32:23,007 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:32:23" (1/1) ... [2025-03-03 10:32:23,022 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:32:23" (1/1) ... [2025-03-03 10:32:23,093 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-03 10:32:23,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:32:23,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:32:23,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:32:23,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:32:23,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:23" (1/1) ... [2025-03-03 10:32:23,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:23" (1/1) ... [2025-03-03 10:32:23,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:23" (1/1) ... [2025-03-03 10:32:23,170 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:32:23,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:23" (1/1) ... [2025-03-03 10:32:23,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:23" (1/1) ... [2025-03-03 10:32:23,197 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:23" (1/1) ... [2025-03-03 10:32:23,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:23" (1/1) ... [2025-03-03 10:32:23,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:23" (1/1) ... [2025-03-03 10:32:23,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:23" (1/1) ... [2025-03-03 10:32:23,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:32:23,227 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:32:23,227 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:32:23,227 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:32:23,228 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:23" (1/1) ... [2025-03-03 10:32:23,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:32:23,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:23,254 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:32:23,258 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:32:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:32:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:32:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:32:23,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:32:23,318 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:32:23,320 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:32:24,503 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-03 10:32:24,504 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:32:24,519 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:32:24,521 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:32:24,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:32:24 BoogieIcfgContainer [2025-03-03 10:32:24,522 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:32:24,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:32:24,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:32:24,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:32:24,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:32:22" (1/3) ... [2025-03-03 10:32:24,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7a5dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:32:24, skipping insertion in model container [2025-03-03 10:32:24,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:23" (2/3) ... [2025-03-03 10:32:24,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7a5dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:32:24, skipping insertion in model container [2025-03-03 10:32:24,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:32:24" (3/3) ... [2025-03-03 10:32:24,529 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label24.c [2025-03-03 10:32:24,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:32:24,540 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label24.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:32:24,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:32:24,597 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;@3d603c21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:32:24,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:32:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 10:32:24,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:24,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:24,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:24,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:24,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1557857454, now seen corresponding path program 1 times [2025-03-03 10:32:24,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:24,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598354591] [2025-03-03 10:32:24,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:24,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:24,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 10:32:24,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 10:32:24,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:24,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:24,887 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:32:24,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:24,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598354591] [2025-03-03 10:32:24,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598354591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:24,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:24,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:24,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559894600] [2025-03-03 10:32:24,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:24,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:24,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:24,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:24,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:24,911 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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:32:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:25,730 INFO L93 Difference]: Finished difference Result 763 states and 1349 transitions. [2025-03-03 10:32:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:25,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-03 10:32:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:25,739 INFO L225 Difference]: With dead ends: 763 [2025-03-03 10:32:25,739 INFO L226 Difference]: Without dead ends: 416 [2025-03-03 10:32:25,742 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:32:25,744 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 222 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:25,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 88 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:32:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-03 10:32:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2025-03-03 10:32:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 407 states have internal predecessors, (657), 0 states have call successors, (0), 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:32:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 657 transitions. [2025-03-03 10:32:25,775 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 657 transitions. Word has length 51 [2025-03-03 10:32:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:25,775 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 657 transitions. [2025-03-03 10:32:25,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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:32:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 657 transitions. [2025-03-03 10:32:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 10:32:25,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:25,778 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:25,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:32:25,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:25,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1788375292, now seen corresponding path program 1 times [2025-03-03 10:32:25,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:25,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978449694] [2025-03-03 10:32:25,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:25,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:25,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 10:32:25,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 10:32:25,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:25,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:25,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978449694] [2025-03-03 10:32:25,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978449694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:25,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575934640] [2025-03-03 10:32:25,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:25,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:25,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:25,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:25,902 INFO L87 Difference]: Start difference. First operand 408 states and 657 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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:32:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:26,442 INFO L93 Difference]: Finished difference Result 1189 states and 1922 transitions. [2025-03-03 10:32:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:26,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-03 10:32:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:26,445 INFO L225 Difference]: With dead ends: 1189 [2025-03-03 10:32:26,445 INFO L226 Difference]: Without dead ends: 783 [2025-03-03 10:32:26,446 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:32:26,446 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 176 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:26,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 152 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-03 10:32:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2025-03-03 10:32:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4424552429667519) internal successors, (1128), 782 states have internal predecessors, (1128), 0 states have call successors, (0), 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:32:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1128 transitions. [2025-03-03 10:32:26,472 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1128 transitions. Word has length 116 [2025-03-03 10:32:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:26,472 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1128 transitions. [2025-03-03 10:32:26,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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:32:26,472 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1128 transitions. [2025-03-03 10:32:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 10:32:26,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:26,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:26,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:32:26,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:26,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash 860432028, now seen corresponding path program 1 times [2025-03-03 10:32:26,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:26,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201825371] [2025-03-03 10:32:26,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:26,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 10:32:26,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 10:32:26,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:26,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:26,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201825371] [2025-03-03 10:32:26,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201825371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:26,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:26,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616324962] [2025-03-03 10:32:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:26,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:26,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:26,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:26,623 INFO L87 Difference]: Start difference. First operand 783 states and 1128 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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:32:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:27,181 INFO L93 Difference]: Finished difference Result 1942 states and 2803 transitions. [2025-03-03 10:32:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:27,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-03 10:32:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:27,185 INFO L225 Difference]: With dead ends: 1942 [2025-03-03 10:32:27,185 INFO L226 Difference]: Without dead ends: 1161 [2025-03-03 10:32:27,187 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:32:27,191 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 143 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:27,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 175 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-03-03 10:32:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1151. [2025-03-03 10:32:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1150 states have (on average 1.337391304347826) internal successors, (1538), 1150 states have internal predecessors, (1538), 0 states have call successors, (0), 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:32:27,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1538 transitions. [2025-03-03 10:32:27,215 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1538 transitions. Word has length 119 [2025-03-03 10:32:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:27,216 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1538 transitions. [2025-03-03 10:32:27,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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:32:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1538 transitions. [2025-03-03 10:32:27,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 10:32:27,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:27,218 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:27,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:32:27,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:27,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:27,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1793817466, now seen corresponding path program 1 times [2025-03-03 10:32:27,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:27,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907769126] [2025-03-03 10:32:27,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:27,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:27,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 10:32:27,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 10:32:27,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:27,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:27,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:27,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907769126] [2025-03-03 10:32:27,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907769126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:27,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:27,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:27,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74139833] [2025-03-03 10:32:27,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:27,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:27,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:27,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:27,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:27,628 INFO L87 Difference]: Start difference. First operand 1151 states and 1538 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:28,670 INFO L93 Difference]: Finished difference Result 3412 states and 4532 transitions. [2025-03-03 10:32:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:28,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-03-03 10:32:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:28,676 INFO L225 Difference]: With dead ends: 3412 [2025-03-03 10:32:28,676 INFO L226 Difference]: Without dead ends: 2263 [2025-03-03 10:32:28,678 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:32:28,678 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:28,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 216 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:32:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2025-03-03 10:32:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1891. [2025-03-03 10:32:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1890 states have (on average 1.2476190476190476) internal successors, (2358), 1890 states have internal predecessors, (2358), 0 states have call successors, (0), 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:32:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2358 transitions. [2025-03-03 10:32:28,710 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2358 transitions. Word has length 120 [2025-03-03 10:32:28,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:28,710 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 2358 transitions. [2025-03-03 10:32:28,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2358 transitions. [2025-03-03 10:32:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 10:32:28,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:28,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:28,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:32:28,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:28,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:28,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1672450007, now seen corresponding path program 1 times [2025-03-03 10:32:28,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:28,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828918302] [2025-03-03 10:32:28,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:28,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:28,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 10:32:28,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 10:32:28,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:28,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 10:32:28,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:28,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828918302] [2025-03-03 10:32:28,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828918302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:28,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:28,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:28,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033544209] [2025-03-03 10:32:28,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:28,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:28,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:28,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:28,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:28,904 INFO L87 Difference]: Start difference. First operand 1891 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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:32:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:29,412 INFO L93 Difference]: Finished difference Result 4707 states and 5770 transitions. [2025-03-03 10:32:29,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:29,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 194 [2025-03-03 10:32:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:29,421 INFO L225 Difference]: With dead ends: 4707 [2025-03-03 10:32:29,421 INFO L226 Difference]: Without dead ends: 2818 [2025-03-03 10:32:29,423 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:32:29,424 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 75 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:29,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 153 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:29,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2025-03-03 10:32:29,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2633. [2025-03-03 10:32:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2632 states have (on average 1.2146656534954408) internal successors, (3197), 2632 states have internal predecessors, (3197), 0 states have call successors, (0), 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:32:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3197 transitions. [2025-03-03 10:32:29,454 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3197 transitions. Word has length 194 [2025-03-03 10:32:29,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:29,455 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3197 transitions. [2025-03-03 10:32:29,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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:32:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3197 transitions. [2025-03-03 10:32:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 10:32:29,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:29,458 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:29,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:32:29,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:29,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1437573534, now seen corresponding path program 1 times [2025-03-03 10:32:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:29,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042899565] [2025-03-03 10:32:29,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:29,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 10:32:29,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 10:32:29,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:29,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:29,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:29,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042899565] [2025-03-03 10:32:29,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042899565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:29,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:29,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:29,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762258710] [2025-03-03 10:32:29,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:29,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:29,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:29,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:29,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:29,617 INFO L87 Difference]: Start difference. First operand 2633 states and 3197 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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:32:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:30,206 INFO L93 Difference]: Finished difference Result 6192 states and 7591 transitions. [2025-03-03 10:32:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-03 10:32:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:30,215 INFO L225 Difference]: With dead ends: 6192 [2025-03-03 10:32:30,215 INFO L226 Difference]: Without dead ends: 3745 [2025-03-03 10:32:30,217 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:32:30,218 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:30,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 333 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2025-03-03 10:32:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3369. [2025-03-03 10:32:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 3368 states have (on average 1.2033847980997625) internal successors, (4053), 3368 states have internal predecessors, (4053), 0 states have call successors, (0), 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:32:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 4053 transitions. [2025-03-03 10:32:30,257 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 4053 transitions. Word has length 231 [2025-03-03 10:32:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:30,257 INFO L471 AbstractCegarLoop]: Abstraction has 3369 states and 4053 transitions. [2025-03-03 10:32:30,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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:32:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 4053 transitions. [2025-03-03 10:32:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 10:32:30,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:30,259 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:30,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:32:30,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:30,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1082299964, now seen corresponding path program 1 times [2025-03-03 10:32:30,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:30,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084730606] [2025-03-03 10:32:30,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:30,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:30,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 10:32:30,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 10:32:30,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:30,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:30,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:30,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084730606] [2025-03-03 10:32:30,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084730606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:30,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:30,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:32:30,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488314230] [2025-03-03 10:32:30,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:30,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:30,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:30,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:30,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:30,616 INFO L87 Difference]: Start difference. First operand 3369 states and 4053 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 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:32:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:31,628 INFO L93 Difference]: Finished difference Result 10063 states and 12290 transitions. [2025-03-03 10:32:31,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:31,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-03-03 10:32:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:31,644 INFO L225 Difference]: With dead ends: 10063 [2025-03-03 10:32:31,644 INFO L226 Difference]: Without dead ends: 6696 [2025-03-03 10:32:31,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:31,648 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 326 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:31,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 118 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:32:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6696 states. [2025-03-03 10:32:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6696 to 6136. [2025-03-03 10:32:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6136 states, 6135 states have (on average 1.2102689486552567) internal successors, (7425), 6135 states have internal predecessors, (7425), 0 states have call successors, (0), 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:32:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6136 states to 6136 states and 7425 transitions. [2025-03-03 10:32:31,730 INFO L78 Accepts]: Start accepts. Automaton has 6136 states and 7425 transitions. Word has length 232 [2025-03-03 10:32:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:31,730 INFO L471 AbstractCegarLoop]: Abstraction has 6136 states and 7425 transitions. [2025-03-03 10:32:31,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 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:32:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 6136 states and 7425 transitions. [2025-03-03 10:32:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-03 10:32:31,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:31,733 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:32:31,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:32:31,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:31,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash -603529474, now seen corresponding path program 1 times [2025-03-03 10:32:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376250987] [2025-03-03 10:32:31,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:31,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-03 10:32:31,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-03 10:32:31,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:31,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:31,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:31,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376250987] [2025-03-03 10:32:31,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376250987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:31,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:31,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914605096] [2025-03-03 10:32:31,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:31,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:31,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:31,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:31,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:31,957 INFO L87 Difference]: Start difference. First operand 6136 states and 7425 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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:32:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:32,926 INFO L93 Difference]: Finished difference Result 13749 states and 16796 transitions. [2025-03-03 10:32:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:32,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 243 [2025-03-03 10:32:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:32,944 INFO L225 Difference]: With dead ends: 13749 [2025-03-03 10:32:32,945 INFO L226 Difference]: Without dead ends: 7983 [2025-03-03 10:32:32,949 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:32:32,950 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 254 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:32,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 141 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:32:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7983 states. [2025-03-03 10:32:33,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7983 to 7794. [2025-03-03 10:32:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7794 states, 7793 states have (on average 1.1940202746054152) internal successors, (9305), 7793 states have internal predecessors, (9305), 0 states have call successors, (0), 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:32:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7794 states to 7794 states and 9305 transitions. [2025-03-03 10:32:33,062 INFO L78 Accepts]: Start accepts. Automaton has 7794 states and 9305 transitions. Word has length 243 [2025-03-03 10:32:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:33,063 INFO L471 AbstractCegarLoop]: Abstraction has 7794 states and 9305 transitions. [2025-03-03 10:32:33,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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:32:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 7794 states and 9305 transitions. [2025-03-03 10:32:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-03 10:32:33,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:33,069 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:33,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:32:33,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:33,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:33,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2130790335, now seen corresponding path program 1 times [2025-03-03 10:32:33,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:33,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576865613] [2025-03-03 10:32:33,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:33,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-03 10:32:33,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-03 10:32:33,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:33,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-03 10:32:33,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:33,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576865613] [2025-03-03 10:32:33,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576865613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:33,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:33,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:33,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568813035] [2025-03-03 10:32:33,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:33,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:33,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:33,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:33,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:33,236 INFO L87 Difference]: Start difference. First operand 7794 states and 9305 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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:32:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:33,775 INFO L93 Difference]: Finished difference Result 17057 states and 20338 transitions. [2025-03-03 10:32:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:33,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 306 [2025-03-03 10:32:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:33,794 INFO L225 Difference]: With dead ends: 17057 [2025-03-03 10:32:33,795 INFO L226 Difference]: Without dead ends: 9633 [2025-03-03 10:32:33,802 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:32:33,802 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 168 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:33,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 155 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9633 states. [2025-03-03 10:32:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9633 to 5765. [2025-03-03 10:32:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5765 states, 5764 states have (on average 1.2161693268563498) internal successors, (7010), 5764 states have internal predecessors, (7010), 0 states have call successors, (0), 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:32:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 7010 transitions. [2025-03-03 10:32:33,873 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 7010 transitions. Word has length 306 [2025-03-03 10:32:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:33,873 INFO L471 AbstractCegarLoop]: Abstraction has 5765 states and 7010 transitions. [2025-03-03 10:32:33,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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:32:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 7010 transitions. [2025-03-03 10:32:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-03 10:32:33,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:33,881 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:33,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:32:33,882 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:33,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:33,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1142414259, now seen corresponding path program 1 times [2025-03-03 10:32:33,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:33,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113228334] [2025-03-03 10:32:33,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:33,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:33,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-03 10:32:33,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-03 10:32:33,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:33,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 10:32:34,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:34,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113228334] [2025-03-03 10:32:34,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113228334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:34,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:34,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:34,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793724174] [2025-03-03 10:32:34,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:34,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:34,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:34,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:34,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:34,069 INFO L87 Difference]: Start difference. First operand 5765 states and 7010 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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:32:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:34,639 INFO L93 Difference]: Finished difference Result 13739 states and 16774 transitions. [2025-03-03 10:32:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:34,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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 322 [2025-03-03 10:32:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:34,650 INFO L225 Difference]: With dead ends: 13739 [2025-03-03 10:32:34,651 INFO L226 Difference]: Without dead ends: 8344 [2025-03-03 10:32:34,655 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:32:34,655 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 156 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:34,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 67 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8344 states. [2025-03-03 10:32:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8344 to 8341. [2025-03-03 10:32:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8341 states, 8340 states have (on average 1.1985611510791367) internal successors, (9996), 8340 states have internal predecessors, (9996), 0 states have call successors, (0), 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:32:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8341 states to 8341 states and 9996 transitions. [2025-03-03 10:32:34,744 INFO L78 Accepts]: Start accepts. Automaton has 8341 states and 9996 transitions. Word has length 322 [2025-03-03 10:32:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:34,744 INFO L471 AbstractCegarLoop]: Abstraction has 8341 states and 9996 transitions. [2025-03-03 10:32:34,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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:32:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 8341 states and 9996 transitions. [2025-03-03 10:32:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-03 10:32:34,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:34,749 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:34,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:32:34,749 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:34,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:34,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1133835139, now seen corresponding path program 1 times [2025-03-03 10:32:34,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:34,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51454318] [2025-03-03 10:32:34,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:34,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:34,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-03 10:32:34,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-03 10:32:34,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:34,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 303 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:35,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:35,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51454318] [2025-03-03 10:32:35,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51454318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:35,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564553672] [2025-03-03 10:32:35,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:35,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:35,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:35,168 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:32:35,169 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:32:35,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-03 10:32:35,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-03 10:32:35,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:35,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:35,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:32:35,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-03 10:32:35,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:35,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564553672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:35,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:35,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:32:35,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434359745] [2025-03-03 10:32:35,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:35,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:35,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:35,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:35,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:32:35,506 INFO L87 Difference]: Start difference. First operand 8341 states and 9996 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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:32:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:35,983 INFO L93 Difference]: Finished difference Result 16682 states and 19992 transitions. [2025-03-03 10:32:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:35,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 322 [2025-03-03 10:32:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:35,994 INFO L225 Difference]: With dead ends: 16682 [2025-03-03 10:32:35,994 INFO L226 Difference]: Without dead ends: 8711 [2025-03-03 10:32:36,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:32:36,000 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 130 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:36,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 166 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8711 states. [2025-03-03 10:32:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8711 to 8525. [2025-03-03 10:32:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8525 states, 8524 states have (on average 1.187939934303144) internal successors, (10126), 8524 states have internal predecessors, (10126), 0 states have call successors, (0), 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:32:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8525 states to 8525 states and 10126 transitions. [2025-03-03 10:32:36,068 INFO L78 Accepts]: Start accepts. Automaton has 8525 states and 10126 transitions. Word has length 322 [2025-03-03 10:32:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:36,068 INFO L471 AbstractCegarLoop]: Abstraction has 8525 states and 10126 transitions. [2025-03-03 10:32:36,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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:32:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 8525 states and 10126 transitions. [2025-03-03 10:32:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-03 10:32:36,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:36,073 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:36,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:32:36,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 10:32:36,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:36,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:36,274 INFO L85 PathProgramCache]: Analyzing trace with hash -232556351, now seen corresponding path program 1 times [2025-03-03 10:32:36,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:36,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102748452] [2025-03-03 10:32:36,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:36,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:36,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-03 10:32:36,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-03 10:32:36,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:36,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:32:36,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:36,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102748452] [2025-03-03 10:32:36,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102748452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:36,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:36,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:36,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628414990] [2025-03-03 10:32:36,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:36,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:36,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:36,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:36,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:36,403 INFO L87 Difference]: Start difference. First operand 8525 states and 10126 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 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:32:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:36,709 INFO L93 Difference]: Finished difference Result 16676 states and 19860 transitions. [2025-03-03 10:32:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:36,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 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 333 [2025-03-03 10:32:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:36,720 INFO L225 Difference]: With dead ends: 16676 [2025-03-03 10:32:36,721 INFO L226 Difference]: Without dead ends: 8521 [2025-03-03 10:32:36,726 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:32:36,726 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:36,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 40 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:32:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8521 states. [2025-03-03 10:32:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8521 to 8521. [2025-03-03 10:32:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8521 states, 8520 states have (on average 1.1873239436619718) internal successors, (10116), 8520 states have internal predecessors, (10116), 0 states have call successors, (0), 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:32:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8521 states to 8521 states and 10116 transitions. [2025-03-03 10:32:36,794 INFO L78 Accepts]: Start accepts. Automaton has 8521 states and 10116 transitions. Word has length 333 [2025-03-03 10:32:36,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:36,795 INFO L471 AbstractCegarLoop]: Abstraction has 8521 states and 10116 transitions. [2025-03-03 10:32:36,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 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:32:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 8521 states and 10116 transitions. [2025-03-03 10:32:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-03 10:32:36,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:36,801 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:36,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:32:36,801 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:36,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:36,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1534475193, now seen corresponding path program 1 times [2025-03-03 10:32:36,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:36,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940866996] [2025-03-03 10:32:36,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:36,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:36,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-03 10:32:36,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-03 10:32:36,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:36,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-03 10:32:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:36,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940866996] [2025-03-03 10:32:36,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940866996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:36,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:36,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:36,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913023169] [2025-03-03 10:32:36,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:36,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:36,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:36,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:36,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:36,981 INFO L87 Difference]: Start difference. First operand 8521 states and 10116 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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:32:37,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:37,497 INFO L93 Difference]: Finished difference Result 20168 states and 23750 transitions. [2025-03-03 10:32:37,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:37,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 357 [2025-03-03 10:32:37,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:37,514 INFO L225 Difference]: With dead ends: 20168 [2025-03-03 10:32:37,514 INFO L226 Difference]: Without dead ends: 10726 [2025-03-03 10:32:37,522 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:32:37,523 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 150 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:37,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 309 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10726 states. [2025-03-03 10:32:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10726 to 9252. [2025-03-03 10:32:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9252 states, 9251 states have (on average 1.1298238028321264) internal successors, (10452), 9251 states have internal predecessors, (10452), 0 states have call successors, (0), 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:32:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9252 states to 9252 states and 10452 transitions. [2025-03-03 10:32:37,678 INFO L78 Accepts]: Start accepts. Automaton has 9252 states and 10452 transitions. Word has length 357 [2025-03-03 10:32:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:37,679 INFO L471 AbstractCegarLoop]: Abstraction has 9252 states and 10452 transitions. [2025-03-03 10:32:37,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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:32:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 9252 states and 10452 transitions. [2025-03-03 10:32:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-03 10:32:37,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:37,686 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:37,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:32:37,686 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:37,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:37,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1218837081, now seen corresponding path program 1 times [2025-03-03 10:32:37,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:37,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307251975] [2025-03-03 10:32:37,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:37,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:37,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-03 10:32:37,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-03 10:32:37,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:37,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 10:32:37,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:37,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307251975] [2025-03-03 10:32:37,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307251975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:37,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:37,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:37,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363557444] [2025-03-03 10:32:37,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:37,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:37,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:37,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:37,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:37,905 INFO L87 Difference]: Start difference. First operand 9252 states and 10452 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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:32:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:38,366 INFO L93 Difference]: Finished difference Result 19986 states and 22610 transitions. [2025-03-03 10:32:38,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:38,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 362 [2025-03-03 10:32:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:38,375 INFO L225 Difference]: With dead ends: 19986 [2025-03-03 10:32:38,375 INFO L226 Difference]: Without dead ends: 11104 [2025-03-03 10:32:38,378 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:32:38,378 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 136 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:38,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 113 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11104 states. [2025-03-03 10:32:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11104 to 10176. [2025-03-03 10:32:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10176 states, 10175 states have (on average 1.1291400491400492) internal successors, (11489), 10175 states have internal predecessors, (11489), 0 states have call successors, (0), 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:32:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10176 states to 10176 states and 11489 transitions. [2025-03-03 10:32:38,451 INFO L78 Accepts]: Start accepts. Automaton has 10176 states and 11489 transitions. Word has length 362 [2025-03-03 10:32:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:38,451 INFO L471 AbstractCegarLoop]: Abstraction has 10176 states and 11489 transitions. [2025-03-03 10:32:38,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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:32:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 10176 states and 11489 transitions. [2025-03-03 10:32:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-03 10:32:38,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:38,456 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:38,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:32:38,456 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:38,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:38,457 INFO L85 PathProgramCache]: Analyzing trace with hash -683603968, now seen corresponding path program 1 times [2025-03-03 10:32:38,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:38,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813169002] [2025-03-03 10:32:38,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:38,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:38,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 10:32:38,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 10:32:38,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:38,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 10:32:38,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:38,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813169002] [2025-03-03 10:32:38,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813169002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:38,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:38,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:38,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706767067] [2025-03-03 10:32:38,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:38,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:38,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:38,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:38,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:38,691 INFO L87 Difference]: Start difference. First operand 10176 states and 11489 transitions. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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:32:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:39,453 INFO L93 Difference]: Finished difference Result 26996 states and 30590 transitions. [2025-03-03 10:32:39,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:39,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 372 [2025-03-03 10:32:39,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:39,466 INFO L225 Difference]: With dead ends: 26996 [2025-03-03 10:32:39,466 INFO L226 Difference]: Without dead ends: 16454 [2025-03-03 10:32:39,472 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:32:39,473 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 227 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:39,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 86 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:32:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-03 10:32:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16082. [2025-03-03 10:32:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16082 states, 16081 states have (on average 1.1266090417262609) internal successors, (18117), 16081 states have internal predecessors, (18117), 0 states have call successors, (0), 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:32:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16082 states to 16082 states and 18117 transitions. [2025-03-03 10:32:39,591 INFO L78 Accepts]: Start accepts. Automaton has 16082 states and 18117 transitions. Word has length 372 [2025-03-03 10:32:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:39,591 INFO L471 AbstractCegarLoop]: Abstraction has 16082 states and 18117 transitions. [2025-03-03 10:32:39,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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:32:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 16082 states and 18117 transitions. [2025-03-03 10:32:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-03 10:32:39,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:39,596 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:39,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:32:39,597 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:39,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:39,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1844812189, now seen corresponding path program 1 times [2025-03-03 10:32:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:39,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809495812] [2025-03-03 10:32:39,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:39,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:39,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-03 10:32:39,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-03 10:32:39,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:39,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 146 proven. 200 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-03 10:32:39,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:39,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809495812] [2025-03-03 10:32:39,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809495812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:39,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260422097] [2025-03-03 10:32:39,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:39,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:39,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:39,850 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:32:39,850 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:32:39,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-03 10:32:39,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-03 10:32:39,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:39,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:39,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 10:32:39,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 244 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:41,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:32:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 244 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:43,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260422097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:32:43,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:32:43,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2025-03-03 10:32:43,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477134414] [2025-03-03 10:32:43,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:32:43,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 10:32:43,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:43,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 10:32:43,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 10:32:43,427 INFO L87 Difference]: Start difference. First operand 16082 states and 18117 transitions. Second operand has 12 states, 12 states have (on average 76.16666666666667) internal successors, (914), 11 states have internal predecessors, (914), 0 states have call successors, (0), 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:32:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:48,476 INFO L93 Difference]: Finished difference Result 51642 states and 57875 transitions. [2025-03-03 10:32:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-03 10:32:48,477 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 76.16666666666667) internal successors, (914), 11 states have internal predecessors, (914), 0 states have call successors, (0), 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 389 [2025-03-03 10:32:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:48,511 INFO L225 Difference]: With dead ends: 51642 [2025-03-03 10:32:48,511 INFO L226 Difference]: Without dead ends: 35746 [2025-03-03 10:32:48,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 770 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=499, Invalid=1307, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 10:32:48,525 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 4206 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7251 mSolverCounterSat, 1541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4206 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 8792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1541 IncrementalHoareTripleChecker+Valid, 7251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:48,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4206 Valid, 197 Invalid, 8792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1541 Valid, 7251 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 10:32:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35746 states. [2025-03-03 10:32:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35746 to 17916. [2025-03-03 10:32:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17916 states, 17915 states have (on average 1.1166620150711695) internal successors, (20005), 17915 states have internal predecessors, (20005), 0 states have call successors, (0), 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:32:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17916 states to 17916 states and 20005 transitions. [2025-03-03 10:32:48,861 INFO L78 Accepts]: Start accepts. Automaton has 17916 states and 20005 transitions. Word has length 389 [2025-03-03 10:32:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:48,861 INFO L471 AbstractCegarLoop]: Abstraction has 17916 states and 20005 transitions. [2025-03-03 10:32:48,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 76.16666666666667) internal successors, (914), 11 states have internal predecessors, (914), 0 states have call successors, (0), 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:32:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 17916 states and 20005 transitions. [2025-03-03 10:32:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-03 10:32:48,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:48,867 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:48,874 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:32:49,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 10:32:49,068 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:49,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2042513014, now seen corresponding path program 1 times [2025-03-03 10:32:49,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:49,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961859465] [2025-03-03 10:32:49,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:49,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:49,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-03 10:32:49,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-03 10:32:49,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:49,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-03 10:32:49,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:49,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961859465] [2025-03-03 10:32:49,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961859465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:49,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:49,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:49,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943405181] [2025-03-03 10:32:49,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:49,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:49,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:49,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:49,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:49,380 INFO L87 Difference]: Start difference. First operand 17916 states and 20005 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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:32:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:50,247 INFO L93 Difference]: Finished difference Result 37309 states and 41657 transitions. [2025-03-03 10:32:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:50,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 394 [2025-03-03 10:32:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:50,266 INFO L225 Difference]: With dead ends: 37309 [2025-03-03 10:32:50,266 INFO L226 Difference]: Without dead ends: 19579 [2025-03-03 10:32:50,277 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:32:50,277 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 200 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:50,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 112 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:32:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19579 states. [2025-03-03 10:32:50,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19579 to 17178. [2025-03-03 10:32:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17178 states, 17177 states have (on average 1.1152704197473366) internal successors, (19157), 17177 states have internal predecessors, (19157), 0 states have call successors, (0), 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:32:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17178 states to 17178 states and 19157 transitions. [2025-03-03 10:32:50,429 INFO L78 Accepts]: Start accepts. Automaton has 17178 states and 19157 transitions. Word has length 394 [2025-03-03 10:32:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:50,430 INFO L471 AbstractCegarLoop]: Abstraction has 17178 states and 19157 transitions. [2025-03-03 10:32:50,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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:32:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 17178 states and 19157 transitions. [2025-03-03 10:32:50,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-03 10:32:50,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:50,435 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:50,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:32:50,435 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:50,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash -828336316, now seen corresponding path program 1 times [2025-03-03 10:32:50,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:50,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355925477] [2025-03-03 10:32:50,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:50,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-03 10:32:50,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-03 10:32:50,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:50,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-03 10:32:50,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:50,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355925477] [2025-03-03 10:32:50,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355925477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:50,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:50,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:50,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226392659] [2025-03-03 10:32:50,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:50,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:50,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:50,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:50,549 INFO L87 Difference]: Start difference. First operand 17178 states and 19157 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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:32:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:51,033 INFO L93 Difference]: Finished difference Result 34351 states and 38310 transitions. [2025-03-03 10:32:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:51,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 403 [2025-03-03 10:32:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:51,048 INFO L225 Difference]: With dead ends: 34351 [2025-03-03 10:32:51,048 INFO L226 Difference]: Without dead ends: 17359 [2025-03-03 10:32:51,057 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:32:51,057 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 151 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:51,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 132 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2025-03-03 10:32:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 17173. [2025-03-03 10:32:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17173 states, 17172 states have (on average 1.1059864896342884) internal successors, (18992), 17172 states have internal predecessors, (18992), 0 states have call successors, (0), 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:32:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17173 states to 17173 states and 18992 transitions. [2025-03-03 10:32:51,193 INFO L78 Accepts]: Start accepts. Automaton has 17173 states and 18992 transitions. Word has length 403 [2025-03-03 10:32:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:51,194 INFO L471 AbstractCegarLoop]: Abstraction has 17173 states and 18992 transitions. [2025-03-03 10:32:51,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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:32:51,194 INFO L276 IsEmpty]: Start isEmpty. Operand 17173 states and 18992 transitions. [2025-03-03 10:32:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-03 10:32:51,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:51,200 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:51,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:32:51,200 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:51,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:51,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1902900970, now seen corresponding path program 1 times [2025-03-03 10:32:51,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117424266] [2025-03-03 10:32:51,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:51,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-03 10:32:51,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-03 10:32:51,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:51,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-03-03 10:32:51,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:51,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117424266] [2025-03-03 10:32:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117424266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:51,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:51,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970855840] [2025-03-03 10:32:51,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:51,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:51,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:51,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:51,551 INFO L87 Difference]: Start difference. First operand 17173 states and 18992 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:32:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:52,074 INFO L93 Difference]: Finished difference Result 36184 states and 40011 transitions. [2025-03-03 10:32:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:52,074 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 434 [2025-03-03 10:32:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:52,095 INFO L225 Difference]: With dead ends: 36184 [2025-03-03 10:32:52,095 INFO L226 Difference]: Without dead ends: 19197 [2025-03-03 10:32:52,110 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:32:52,110 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 158 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:52,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 308 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19197 states. [2025-03-03 10:32:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19197 to 16065. [2025-03-03 10:32:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16065 states, 16064 states have (on average 1.0991035856573705) internal successors, (17656), 16064 states have internal predecessors, (17656), 0 states have call successors, (0), 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:32:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16065 states to 16065 states and 17656 transitions. [2025-03-03 10:32:52,297 INFO L78 Accepts]: Start accepts. Automaton has 16065 states and 17656 transitions. Word has length 434 [2025-03-03 10:32:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:52,297 INFO L471 AbstractCegarLoop]: Abstraction has 16065 states and 17656 transitions. [2025-03-03 10:32:52,297 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:32:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 16065 states and 17656 transitions. [2025-03-03 10:32:52,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 10:32:52,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:52,304 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:52,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:32:52,304 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:52,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:52,305 INFO L85 PathProgramCache]: Analyzing trace with hash -182766547, now seen corresponding path program 1 times [2025-03-03 10:32:52,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:52,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956570681] [2025-03-03 10:32:52,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:52,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:52,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 10:32:52,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 10:32:52,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:52,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-03 10:32:52,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:52,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956570681] [2025-03-03 10:32:52,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956570681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:52,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:52,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:52,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909334996] [2025-03-03 10:32:52,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:52,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:52,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:52,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:52,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:52,594 INFO L87 Difference]: Start difference. First operand 16065 states and 17656 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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:32:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:53,066 INFO L93 Difference]: Finished difference Result 32501 states and 35737 transitions. [2025-03-03 10:32:53,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:53,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 468 [2025-03-03 10:32:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:53,079 INFO L225 Difference]: With dead ends: 32501 [2025-03-03 10:32:53,079 INFO L226 Difference]: Without dead ends: 16806 [2025-03-03 10:32:53,088 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:32:53,088 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 127 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:53,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 117 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16806 states. [2025-03-03 10:32:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16806 to 15697. [2025-03-03 10:32:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15697 states, 15696 states have (on average 1.0980504587155964) internal successors, (17235), 15696 states have internal predecessors, (17235), 0 states have call successors, (0), 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:32:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15697 states to 15697 states and 17235 transitions. [2025-03-03 10:32:53,209 INFO L78 Accepts]: Start accepts. Automaton has 15697 states and 17235 transitions. Word has length 468 [2025-03-03 10:32:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:53,210 INFO L471 AbstractCegarLoop]: Abstraction has 15697 states and 17235 transitions. [2025-03-03 10:32:53,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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:32:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 15697 states and 17235 transitions. [2025-03-03 10:32:53,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-03-03 10:32:53,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:53,217 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:53,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:32:53,218 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:53,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:53,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1907889375, now seen corresponding path program 1 times [2025-03-03 10:32:53,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:53,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329779055] [2025-03-03 10:32:53,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:53,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:53,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-03-03 10:32:53,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-03-03 10:32:53,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:53,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 312 proven. 434 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-03 10:32:53,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329779055] [2025-03-03 10:32:53,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329779055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350948409] [2025-03-03 10:32:53,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:53,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:53,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:53,600 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:32:53,602 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:32:53,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-03-03 10:32:53,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-03-03 10:32:53,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:53,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:53,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:32:53,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 697 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-03 10:32:53,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350948409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:53,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:53,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:32:53,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854686885] [2025-03-03 10:32:53,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:53,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:53,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:53,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:53,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:32:53,826 INFO L87 Difference]: Start difference. First operand 15697 states and 17235 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:32:54,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:54,272 INFO L93 Difference]: Finished difference Result 31765 states and 34858 transitions. [2025-03-03 10:32:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:54,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 513 [2025-03-03 10:32:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:54,287 INFO L225 Difference]: With dead ends: 31765 [2025-03-03 10:32:54,287 INFO L226 Difference]: Without dead ends: 16254 [2025-03-03 10:32:54,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:32:54,297 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 67 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:54,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 342 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16254 states. [2025-03-03 10:32:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16254 to 15697. [2025-03-03 10:32:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15697 states, 15696 states have (on average 1.089322120285423) internal successors, (17098), 15696 states have internal predecessors, (17098), 0 states have call successors, (0), 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:32:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15697 states to 15697 states and 17098 transitions. [2025-03-03 10:32:54,432 INFO L78 Accepts]: Start accepts. Automaton has 15697 states and 17098 transitions. Word has length 513 [2025-03-03 10:32:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:54,432 INFO L471 AbstractCegarLoop]: Abstraction has 15697 states and 17098 transitions. [2025-03-03 10:32:54,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:32:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 15697 states and 17098 transitions. [2025-03-03 10:32:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-03-03 10:32:54,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:54,438 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:54,445 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:32:54,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:54,639 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:54,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1216095878, now seen corresponding path program 1 times [2025-03-03 10:32:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:54,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748254605] [2025-03-03 10:32:54,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:54,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:54,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-03 10:32:54,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-03 10:32:54,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:54,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 10:32:55,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:55,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748254605] [2025-03-03 10:32:55,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748254605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:55,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:55,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:32:55,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547428195] [2025-03-03 10:32:55,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:55,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:32:55,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:55,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:32:55,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:32:55,378 INFO L87 Difference]: Start difference. First operand 15697 states and 17098 transitions. Second operand has 7 states, 7 states have (on average 56.285714285714285) internal successors, (394), 6 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:56,548 INFO L93 Difference]: Finished difference Result 36368 states and 39487 transitions. [2025-03-03 10:32:56,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:32:56,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.285714285714285) internal successors, (394), 6 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 523 [2025-03-03 10:32:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:56,571 INFO L225 Difference]: With dead ends: 36368 [2025-03-03 10:32:56,571 INFO L226 Difference]: Without dead ends: 21041 [2025-03-03 10:32:56,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:32:56,585 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 214 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:56,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 229 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2365 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:32:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21041 states. [2025-03-03 10:32:56,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21041 to 17171. [2025-03-03 10:32:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17171 states, 17170 states have (on average 1.0881770529994177) internal successors, (18684), 17170 states have internal predecessors, (18684), 0 states have call successors, (0), 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:32:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17171 states to 17171 states and 18684 transitions. [2025-03-03 10:32:56,826 INFO L78 Accepts]: Start accepts. Automaton has 17171 states and 18684 transitions. Word has length 523 [2025-03-03 10:32:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:56,826 INFO L471 AbstractCegarLoop]: Abstraction has 17171 states and 18684 transitions. [2025-03-03 10:32:56,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.285714285714285) internal successors, (394), 6 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 17171 states and 18684 transitions. [2025-03-03 10:32:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-03 10:32:56,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:56,833 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:56,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:32:56,833 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:56,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:56,834 INFO L85 PathProgramCache]: Analyzing trace with hash -264037953, now seen corresponding path program 1 times [2025-03-03 10:32:56,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:56,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348538432] [2025-03-03 10:32:56,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:56,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:56,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-03 10:32:56,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-03 10:32:56,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:56,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 606 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 10:32:57,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:57,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348538432] [2025-03-03 10:32:57,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348538432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:57,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107663555] [2025-03-03 10:32:57,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:57,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:57,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:57,620 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:32:57,622 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:32:57,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-03 10:32:57,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-03 10:32:57,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:57,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:57,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:32:57,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 493 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 10:32:58,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:33:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 493 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 10:33:00,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107663555] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:33:00,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:33:00,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-03-03 10:33:00,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673446941] [2025-03-03 10:33:00,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:33:00,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 10:33:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:00,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 10:33:00,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:33:00,300 INFO L87 Difference]: Start difference. First operand 17171 states and 18684 transitions. Second operand has 11 states, 11 states have (on average 88.36363636363636) internal successors, (972), 10 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:03,040 INFO L93 Difference]: Finished difference Result 40972 states and 44318 transitions. [2025-03-03 10:33:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 10:33:03,040 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 88.36363636363636) internal successors, (972), 10 states have internal predecessors, (972), 0 states have call successors, (0), 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 533 [2025-03-03 10:33:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:03,061 INFO L225 Difference]: With dead ends: 40972 [2025-03-03 10:33:03,061 INFO L226 Difference]: Without dead ends: 21960 [2025-03-03 10:33:03,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1087 GetRequests, 1063 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=436, Unknown=0, NotChecked=0, Total=650 [2025-03-03 10:33:03,072 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1303 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 4186 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 4685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 4186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:03,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 168 Invalid, 4685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 4186 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:33:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21960 states. [2025-03-03 10:33:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21960 to 14583. [2025-03-03 10:33:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14583 states, 14582 states have (on average 1.0620628171718558) internal successors, (15487), 14582 states have internal predecessors, (15487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14583 states to 14583 states and 15487 transitions. [2025-03-03 10:33:03,268 INFO L78 Accepts]: Start accepts. Automaton has 14583 states and 15487 transitions. Word has length 533 [2025-03-03 10:33:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:03,268 INFO L471 AbstractCegarLoop]: Abstraction has 14583 states and 15487 transitions. [2025-03-03 10:33:03,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.36363636363636) internal successors, (972), 10 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 14583 states and 15487 transitions. [2025-03-03 10:33:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-03 10:33:03,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:03,273 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:03,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:33:03,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:03,474 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:03,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:03,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1378007588, now seen corresponding path program 1 times [2025-03-03 10:33:03,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:03,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092680574] [2025-03-03 10:33:03,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:03,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:03,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-03 10:33:03,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-03 10:33:03,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:03,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 390 proven. 206 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-03 10:33:04,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:04,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092680574] [2025-03-03 10:33:04,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092680574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:04,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983863669] [2025-03-03 10:33:04,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:04,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:04,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:04,065 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:33:04,067 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:33:04,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-03 10:33:04,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-03 10:33:04,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:04,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:04,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:33:04,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 341 proven. 255 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-03 10:33:05,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:33:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 527 proven. 69 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-03 10:33:06,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983863669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:33:06,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:33:06,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-03 10:33:06,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118370576] [2025-03-03 10:33:06,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:33:06,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 10:33:06,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:06,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 10:33:06,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:33:06,762 INFO L87 Difference]: Start difference. First operand 14583 states and 15487 transitions. Second operand has 10 states, 10 states have (on average 84.3) internal successors, (843), 10 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:08,771 INFO L93 Difference]: Finished difference Result 37291 states and 39626 transitions. [2025-03-03 10:33:08,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 10:33:08,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 84.3) internal successors, (843), 10 states have internal predecessors, (843), 0 states have call successors, (0), 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 536 [2025-03-03 10:33:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:08,813 INFO L225 Difference]: With dead ends: 37291 [2025-03-03 10:33:08,813 INFO L226 Difference]: Without dead ends: 21238 [2025-03-03 10:33:08,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1075 GetRequests, 1066 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:33:08,819 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1016 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 3203 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 3663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 3203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:08,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 157 Invalid, 3663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 3203 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:33:08,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21238 states. [2025-03-03 10:33:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21238 to 19197. [2025-03-03 10:33:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19197 states, 19196 states have (on average 1.0571473223588248) internal successors, (20293), 19196 states have internal predecessors, (20293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19197 states to 19197 states and 20293 transitions. [2025-03-03 10:33:09,022 INFO L78 Accepts]: Start accepts. Automaton has 19197 states and 20293 transitions. Word has length 536 [2025-03-03 10:33:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:09,022 INFO L471 AbstractCegarLoop]: Abstraction has 19197 states and 20293 transitions. [2025-03-03 10:33:09,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 84.3) internal successors, (843), 10 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 19197 states and 20293 transitions. [2025-03-03 10:33:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-03-03 10:33:09,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:09,030 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-03 10:33:09,038 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:33:09,231 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,SelfDestructingSolverStorable23 [2025-03-03 10:33:09,231 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:09,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2122869502, now seen corresponding path program 1 times [2025-03-03 10:33:09,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:09,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700653422] [2025-03-03 10:33:09,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:09,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:09,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-03-03 10:33:09,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-03-03 10:33:09,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:09,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1179 backedges. 881 proven. 166 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-03 10:33:09,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:09,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700653422] [2025-03-03 10:33:09,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700653422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:09,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596812743] [2025-03-03 10:33:09,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:09,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:09,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:09,582 INFO L229 MonitoredProcess]: Starting monitored process 7 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:33:09,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:33:09,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-03-03 10:33:09,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-03-03 10:33:09,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:09,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:09,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:33:09,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1179 backedges. 839 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-03 10:33:09,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:33:09,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596812743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:09,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:33:09,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:33:09,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127423656] [2025-03-03 10:33:09,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:09,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:09,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:09,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:09,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:33:09,800 INFO L87 Difference]: Start difference. First operand 19197 states and 20293 transitions. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:10,194 INFO L93 Difference]: Finished difference Result 38024 states and 40204 transitions. [2025-03-03 10:33:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:10,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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 632 [2025-03-03 10:33:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:10,212 INFO L225 Difference]: With dead ends: 38024 [2025-03-03 10:33:10,213 INFO L226 Difference]: Without dead ends: 19197 [2025-03-03 10:33:10,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:33:10,223 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 143 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:10,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 261 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:33:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19197 states. [2025-03-03 10:33:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19197 to 19011. [2025-03-03 10:33:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19011 states, 19010 states have (on average 1.0557601262493423) internal successors, (20070), 19010 states have internal predecessors, (20070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19011 states to 19011 states and 20070 transitions. [2025-03-03 10:33:10,409 INFO L78 Accepts]: Start accepts. Automaton has 19011 states and 20070 transitions. Word has length 632 [2025-03-03 10:33:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:10,409 INFO L471 AbstractCegarLoop]: Abstraction has 19011 states and 20070 transitions. [2025-03-03 10:33:10,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 19011 states and 20070 transitions. [2025-03-03 10:33:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-03-03 10:33:10,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:10,417 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:33:10,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 10:33:10,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:10,618 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:10,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:10,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2024410535, now seen corresponding path program 1 times [2025-03-03 10:33:10,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:10,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580176175] [2025-03-03 10:33:10,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:10,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:10,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-03-03 10:33:10,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-03-03 10:33:10,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:10,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 984 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-03-03 10:33:10,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580176175] [2025-03-03 10:33:10,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580176175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:10,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:10,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501742298] [2025-03-03 10:33:10,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:10,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:10,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:10,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:10,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:10,977 INFO L87 Difference]: Start difference. First operand 19011 states and 20070 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:11,450 INFO L93 Difference]: Finished difference Result 35248 states and 37172 transitions. [2025-03-03 10:33:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:11,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 670 [2025-03-03 10:33:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:11,469 INFO L225 Difference]: With dead ends: 35248 [2025-03-03 10:33:11,469 INFO L226 Difference]: Without dead ends: 16423 [2025-03-03 10:33:11,474 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:33:11,475 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 95 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:11,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 267 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16423 states. [2025-03-03 10:33:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16423 to 13655. [2025-03-03 10:33:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13655 states, 13654 states have (on average 1.049729017137835) internal successors, (14333), 13654 states have internal predecessors, (14333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13655 states to 13655 states and 14333 transitions. [2025-03-03 10:33:11,678 INFO L78 Accepts]: Start accepts. Automaton has 13655 states and 14333 transitions. Word has length 670 [2025-03-03 10:33:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:11,679 INFO L471 AbstractCegarLoop]: Abstraction has 13655 states and 14333 transitions. [2025-03-03 10:33:11,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13655 states and 14333 transitions. [2025-03-03 10:33:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-03-03 10:33:11,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:11,690 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, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:11,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 10:33:11,690 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:11,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2001601297, now seen corresponding path program 1 times [2025-03-03 10:33:11,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:11,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047501671] [2025-03-03 10:33:11,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:11,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:11,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-03 10:33:11,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-03 10:33:11,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:11,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1675 backedges. 1067 proven. 0 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2025-03-03 10:33:11,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:11,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047501671] [2025-03-03 10:33:11,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047501671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:11,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:11,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:11,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665752473] [2025-03-03 10:33:11,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:11,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:11,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:11,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:11,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:11,981 INFO L87 Difference]: Start difference. First operand 13655 states and 14333 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:12,462 INFO L93 Difference]: Finished difference Result 26759 states and 28099 transitions. [2025-03-03 10:33:12,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:12,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 671 [2025-03-03 10:33:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:12,476 INFO L225 Difference]: With dead ends: 26759 [2025-03-03 10:33:12,476 INFO L226 Difference]: Without dead ends: 13474 [2025-03-03 10:33:12,484 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:33:12,484 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 113 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:12,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 317 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13474 states. [2025-03-03 10:33:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13474 to 11079. [2025-03-03 10:33:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11079 states, 11078 states have (on average 1.0470301498465426) internal successors, (11599), 11078 states have internal predecessors, (11599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11079 states to 11079 states and 11599 transitions. [2025-03-03 10:33:12,620 INFO L78 Accepts]: Start accepts. Automaton has 11079 states and 11599 transitions. Word has length 671 [2025-03-03 10:33:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:12,621 INFO L471 AbstractCegarLoop]: Abstraction has 11079 states and 11599 transitions. [2025-03-03 10:33:12,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 11079 states and 11599 transitions. [2025-03-03 10:33:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2025-03-03 10:33:12,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:12,626 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:33:12,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 10:33:12,626 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:12,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:12,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1199767205, now seen corresponding path program 1 times [2025-03-03 10:33:12,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:12,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642145472] [2025-03-03 10:33:12,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:12,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:12,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-03-03 10:33:12,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-03-03 10:33:12,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:12,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 911 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-03 10:33:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642145472] [2025-03-03 10:33:13,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642145472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:13,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:13,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:33:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247944597] [2025-03-03 10:33:13,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:13,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:33:13,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:13,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:33:13,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:13,092 INFO L87 Difference]: Start difference. First operand 11079 states and 11599 transitions. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:13,686 INFO L93 Difference]: Finished difference Result 23817 states and 24948 transitions. [2025-03-03 10:33:13,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:33:13,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 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 677 [2025-03-03 10:33:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:13,701 INFO L225 Difference]: With dead ends: 23817 [2025-03-03 10:33:13,701 INFO L226 Difference]: Without dead ends: 13108 [2025-03-03 10:33:13,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:13,708 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 221 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:13,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 69 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:33:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13108 states. [2025-03-03 10:33:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13108 to 9419. [2025-03-03 10:33:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9419 states, 9418 states have (on average 1.0468252282862605) internal successors, (9859), 9418 states have internal predecessors, (9859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9419 states to 9419 states and 9859 transitions. [2025-03-03 10:33:13,809 INFO L78 Accepts]: Start accepts. Automaton has 9419 states and 9859 transitions. Word has length 677 [2025-03-03 10:33:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:13,810 INFO L471 AbstractCegarLoop]: Abstraction has 9419 states and 9859 transitions. [2025-03-03 10:33:13,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9419 states and 9859 transitions. [2025-03-03 10:33:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-03-03 10:33:13,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:13,815 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:13,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 10:33:13,815 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:13,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1191865987, now seen corresponding path program 1 times [2025-03-03 10:33:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:13,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662980614] [2025-03-03 10:33:13,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:13,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-03 10:33:13,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-03 10:33:13,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:13,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1390 backedges. 921 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-03 10:33:14,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:14,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662980614] [2025-03-03 10:33:14,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662980614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:14,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:14,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:33:14,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138261185] [2025-03-03 10:33:14,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:14,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:33:14,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:14,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:33:14,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:14,366 INFO L87 Difference]: Start difference. First operand 9419 states and 9859 transitions. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:15,012 INFO L93 Difference]: Finished difference Result 19765 states and 20688 transitions. [2025-03-03 10:33:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:33:15,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 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 733 [2025-03-03 10:33:15,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:15,024 INFO L225 Difference]: With dead ends: 19765 [2025-03-03 10:33:15,024 INFO L226 Difference]: Without dead ends: 11084 [2025-03-03 10:33:15,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:15,031 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 236 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:15,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 60 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:33:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11084 states. [2025-03-03 10:33:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11084 to 9051. [2025-03-03 10:33:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9051 states, 9050 states have (on average 1.047513812154696) internal successors, (9480), 9050 states have internal predecessors, (9480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9051 states to 9051 states and 9480 transitions. [2025-03-03 10:33:15,176 INFO L78 Accepts]: Start accepts. Automaton has 9051 states and 9480 transitions. Word has length 733 [2025-03-03 10:33:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:15,176 INFO L471 AbstractCegarLoop]: Abstraction has 9051 states and 9480 transitions. [2025-03-03 10:33:15,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 9051 states and 9480 transitions. [2025-03-03 10:33:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-03 10:33:15,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:15,182 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:15,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 10:33:15,182 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:15,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash -693625843, now seen corresponding path program 1 times [2025-03-03 10:33:15,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:15,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482541051] [2025-03-03 10:33:15,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:15,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:15,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-03 10:33:15,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-03 10:33:15,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:15,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-03-03 10:33:15,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482541051] [2025-03-03 10:33:15,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482541051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:15,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:15,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:15,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954018648] [2025-03-03 10:33:15,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:15,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:15,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:15,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:15,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:15,554 INFO L87 Difference]: Start difference. First operand 9051 states and 9480 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:15,901 INFO L93 Difference]: Finished difference Result 13484 states and 14056 transitions. [2025-03-03 10:33:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:15,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 757 [2025-03-03 10:33:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:15,903 INFO L225 Difference]: With dead ends: 13484 [2025-03-03 10:33:15,903 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:33:15,907 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:33:15,907 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 86 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:15,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 18 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:33:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:33:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:33:15,907 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:33:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:33:15,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 757 [2025-03-03 10:33:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:15,908 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:33:15,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:33:15,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:33:15,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:33:15,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 10:33:15,916 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:15,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.