./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label29.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/Problem03_label29.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 372b0f8557f493ed9d29c5f8057b8dc54ad330866696fd4878e863a88379edbf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:51:14,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:51:14,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:51:14,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:51:14,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:51:14,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:51:14,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:51:14,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:51:14,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:51:14,398 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:51:14,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:51:14,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:51:14,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:51:14,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:51:14,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:51:14,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:51:14,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:51:14,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:51:14,400 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:51:14,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:51:14,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:51:14,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:51:14,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:51:14,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:51:14,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:51:14,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:51:14,400 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 -> 372b0f8557f493ed9d29c5f8057b8dc54ad330866696fd4878e863a88379edbf [2025-03-03 09:51:14,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:51:14,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:51:14,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:51:14,624 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:51:14,625 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:51:14,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2025-03-03 09:51:15,744 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f66b2a5/785aa01e585f4ee1a4efb5b9de60758d/FLAGacc0f331f [2025-03-03 09:51:16,050 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:51:16,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2025-03-03 09:51:16,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f66b2a5/785aa01e585f4ee1a4efb5b9de60758d/FLAGacc0f331f [2025-03-03 09:51:16,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f66b2a5/785aa01e585f4ee1a4efb5b9de60758d [2025-03-03 09:51:16,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:51:16,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:51:16,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:51:16,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:51:16,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:51:16,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:16,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f53cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16, skipping insertion in model container [2025-03-03 09:51:16,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:16,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:51:16,740 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/Problem03_label29.c[58258,58271] [2025-03-03 09:51:16,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:51:16,773 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:51:16,898 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/Problem03_label29.c[58258,58271] [2025-03-03 09:51:16,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:51:16,924 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:51:16,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16 WrapperNode [2025-03-03 09:51:16,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:51:16,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:51:16,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:51:16,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:51:16,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:16,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:17,025 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-03 09:51:17,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:51:17,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:51:17,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:51:17,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:51:17,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:17,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:17,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:17,082 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 09:51:17,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:17,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:17,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:17,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:17,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:17,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:17,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:51:17,159 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:51:17,160 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:51:17,160 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:51:17,161 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (1/1) ... [2025-03-03 09:51:17,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:51:17,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:17,185 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 09:51:17,187 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 09:51:17,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:51:17,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:51:17,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:51:17,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:51:17,257 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:51:17,258 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:51:18,508 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-03 09:51:18,509 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:51:18,525 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:51:18,526 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:51:18,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:51:18 BoogieIcfgContainer [2025-03-03 09:51:18,526 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:51:18,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:51:18,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:51:18,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:51:18,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:51:16" (1/3) ... [2025-03-03 09:51:18,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d0d830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:51:18, skipping insertion in model container [2025-03-03 09:51:18,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:16" (2/3) ... [2025-03-03 09:51:18,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d0d830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:51:18, skipping insertion in model container [2025-03-03 09:51:18,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:51:18" (3/3) ... [2025-03-03 09:51:18,535 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label29.c [2025-03-03 09:51:18,546 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:51:18,549 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label29.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:51:18,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:51:18,608 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;@17f89984, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:51:18,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:51:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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 09:51:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 09:51:18,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:18,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:18,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:18,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:18,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1470833089, now seen corresponding path program 1 times [2025-03-03 09:51:18,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:18,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487092415] [2025-03-03 09:51:18,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:18,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 09:51:18,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 09:51:18,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:18,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:19,417 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 09:51:19,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:19,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487092415] [2025-03-03 09:51:19,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487092415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:19,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:19,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597324475] [2025-03-03 09:51:19,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:19,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:19,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:19,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:19,445 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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 09:51:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:20,339 INFO L93 Difference]: Finished difference Result 823 states and 1456 transitions. [2025-03-03 09:51:20,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:20,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-03 09:51:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:20,349 INFO L225 Difference]: With dead ends: 823 [2025-03-03 09:51:20,350 INFO L226 Difference]: Without dead ends: 444 [2025-03-03 09:51:20,352 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 09:51:20,354 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 53 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:20,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 244 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:51:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-03 09:51:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443. [2025-03-03 09:51:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.420814479638009) internal successors, (628), 442 states have internal predecessors, (628), 0 states have call successors, (0), 0 states 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 09:51:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 628 transitions. [2025-03-03 09:51:20,389 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 628 transitions. Word has length 178 [2025-03-03 09:51:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:20,390 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 628 transitions. [2025-03-03 09:51:20,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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 09:51:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 628 transitions. [2025-03-03 09:51:20,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 09:51:20,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:20,392 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:20,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:51:20,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:20,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash -970510315, now seen corresponding path program 1 times [2025-03-03 09:51:20,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:20,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170393007] [2025-03-03 09:51:20,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:20,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 09:51:20,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 09:51:20,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:20,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:51:20,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:20,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170393007] [2025-03-03 09:51:20,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170393007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:20,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:20,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026125488] [2025-03-03 09:51:20,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:20,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:20,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:20,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:20,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:20,560 INFO L87 Difference]: Start difference. First operand 443 states and 628 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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 09:51:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:21,226 INFO L93 Difference]: Finished difference Result 1310 states and 1864 transitions. [2025-03-03 09:51:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:21,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2025-03-03 09:51:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:21,229 INFO L225 Difference]: With dead ends: 1310 [2025-03-03 09:51:21,229 INFO L226 Difference]: Without dead ends: 869 [2025-03-03 09:51:21,230 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 09:51:21,231 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:21,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 93 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:51:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-03 09:51:21,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 855. [2025-03-03 09:51:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 1.3864168618266979) internal successors, (1184), 854 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states 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 09:51:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1184 transitions. [2025-03-03 09:51:21,266 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1184 transitions. Word has length 186 [2025-03-03 09:51:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:21,266 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1184 transitions. [2025-03-03 09:51:21,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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 09:51:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1184 transitions. [2025-03-03 09:51:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 09:51:21,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:21,269 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:21,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:51:21,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:21,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:21,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2141756437, now seen corresponding path program 1 times [2025-03-03 09:51:21,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:21,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276218114] [2025-03-03 09:51:21,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:21,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:21,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 09:51:21,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 09:51:21,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:21,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:51:21,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:21,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276218114] [2025-03-03 09:51:21,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276218114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:21,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:21,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:21,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460121747] [2025-03-03 09:51:21,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:21,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:21,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:21,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:21,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:21,425 INFO L87 Difference]: Start difference. First operand 855 states and 1184 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:21,727 INFO L93 Difference]: Finished difference Result 1688 states and 2338 transitions. [2025-03-03 09:51:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:21,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2025-03-03 09:51:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:21,729 INFO L225 Difference]: With dead ends: 1688 [2025-03-03 09:51:21,729 INFO L226 Difference]: Without dead ends: 835 [2025-03-03 09:51:21,730 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 09:51:21,731 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:21,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:51:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-03-03 09:51:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-03-03 09:51:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 834 states have (on average 1.3453237410071943) internal successors, (1122), 834 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states 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 09:51:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1122 transitions. [2025-03-03 09:51:21,742 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1122 transitions. Word has length 191 [2025-03-03 09:51:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:21,742 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1122 transitions. [2025-03-03 09:51:21,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1122 transitions. [2025-03-03 09:51:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 09:51:21,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:21,744 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:21,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:51:21,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:21,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1369880355, now seen corresponding path program 1 times [2025-03-03 09:51:21,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:21,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439957088] [2025-03-03 09:51:21,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:21,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 09:51:21,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 09:51:21,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:21,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:51:22,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:22,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439957088] [2025-03-03 09:51:22,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439957088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:22,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:22,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146306209] [2025-03-03 09:51:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:22,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:22,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:22,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:22,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:22,015 INFO L87 Difference]: Start difference. First operand 835 states and 1122 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:22,669 INFO L93 Difference]: Finished difference Result 2500 states and 3361 transitions. [2025-03-03 09:51:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:22,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-03-03 09:51:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:22,674 INFO L225 Difference]: With dead ends: 2500 [2025-03-03 09:51:22,675 INFO L226 Difference]: Without dead ends: 1667 [2025-03-03 09:51:22,676 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 09:51:22,676 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 286 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:22,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 51 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:51:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-03-03 09:51:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1665. [2025-03-03 09:51:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1664 states have (on average 1.3389423076923077) internal successors, (2228), 1664 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states 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 09:51:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2228 transitions. [2025-03-03 09:51:22,703 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2228 transitions. Word has length 195 [2025-03-03 09:51:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:22,704 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2228 transitions. [2025-03-03 09:51:22,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2228 transitions. [2025-03-03 09:51:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 09:51:22,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:22,706 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:22,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:51:22,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:22,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:22,707 INFO L85 PathProgramCache]: Analyzing trace with hash 612825390, now seen corresponding path program 1 times [2025-03-03 09:51:22,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:22,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867088988] [2025-03-03 09:51:22,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:22,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:22,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 09:51:22,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 09:51:22,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:22,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:51:22,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:22,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867088988] [2025-03-03 09:51:22,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867088988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:22,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636719244] [2025-03-03 09:51:22,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:22,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:22,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:22,958 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 09:51:22,960 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 09:51:23,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 09:51:23,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 09:51:23,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:23,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:23,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:51:23,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:51:23,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:23,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636719244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:23,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:23,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 09:51:23,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383555710] [2025-03-03 09:51:23,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:23,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:23,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:23,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:23,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:23,148 INFO L87 Difference]: Start difference. First operand 1665 states and 2228 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 09:51:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:23,358 INFO L93 Difference]: Finished difference Result 4986 states and 6675 transitions. [2025-03-03 09:51:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:23,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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 198 [2025-03-03 09:51:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:23,369 INFO L225 Difference]: With dead ends: 4986 [2025-03-03 09:51:23,369 INFO L226 Difference]: Without dead ends: 3323 [2025-03-03 09:51:23,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:23,372 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 321 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:23,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 535 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:51:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2025-03-03 09:51:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3318. [2025-03-03 09:51:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3318 states, 3317 states have (on average 1.338257461561652) internal successors, (4439), 3317 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states 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 09:51:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 4439 transitions. [2025-03-03 09:51:23,430 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 4439 transitions. Word has length 198 [2025-03-03 09:51:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:23,430 INFO L471 AbstractCegarLoop]: Abstraction has 3318 states and 4439 transitions. [2025-03-03 09:51:23,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 09:51:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 4439 transitions. [2025-03-03 09:51:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-03 09:51:23,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:23,435 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:23,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:51:23,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:23,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:23,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2074872567, now seen corresponding path program 1 times [2025-03-03 09:51:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:23,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966934108] [2025-03-03 09:51:23,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:23,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:23,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 09:51:23,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 09:51:23,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:23,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:51:23,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:23,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966934108] [2025-03-03 09:51:23,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966934108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:23,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871541267] [2025-03-03 09:51:23,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:23,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:23,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:23,841 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 09:51:23,843 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 09:51:23,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 09:51:23,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 09:51:23,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:23,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:23,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:51:23,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:51:24,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:24,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871541267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:24,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:24,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:51:24,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736934487] [2025-03-03 09:51:24,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:24,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:24,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:24,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:24,002 INFO L87 Difference]: Start difference. First operand 3318 states and 4439 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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 09:51:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:24,640 INFO L93 Difference]: Finished difference Result 8266 states and 11420 transitions. [2025-03-03 09:51:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:24,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 200 [2025-03-03 09:51:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:24,654 INFO L225 Difference]: With dead ends: 8266 [2025-03-03 09:51:24,654 INFO L226 Difference]: Without dead ends: 4950 [2025-03-03 09:51:24,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:24,659 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 212 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:24,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 365 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:51:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4950 states. [2025-03-03 09:51:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4950 to 4942. [2025-03-03 09:51:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4942 states, 4941 states have (on average 1.2651285164946366) internal successors, (6251), 4941 states have internal predecessors, (6251), 0 states have call successors, (0), 0 states 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 09:51:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4942 states to 4942 states and 6251 transitions. [2025-03-03 09:51:24,744 INFO L78 Accepts]: Start accepts. Automaton has 4942 states and 6251 transitions. Word has length 200 [2025-03-03 09:51:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:24,744 INFO L471 AbstractCegarLoop]: Abstraction has 4942 states and 6251 transitions. [2025-03-03 09:51:24,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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 09:51:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4942 states and 6251 transitions. [2025-03-03 09:51:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 09:51:24,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:24,748 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:24,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:51:24,948 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,SelfDestructingSolverStorable5 [2025-03-03 09:51:24,949 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:24,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:24,949 INFO L85 PathProgramCache]: Analyzing trace with hash -470694303, now seen corresponding path program 1 times [2025-03-03 09:51:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:24,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194090037] [2025-03-03 09:51:24,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:24,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 09:51:24,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 09:51:24,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:24,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:51:25,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:25,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194090037] [2025-03-03 09:51:25,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194090037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:25,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446355572] [2025-03-03 09:51:25,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:25,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:25,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:25,727 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 09:51:25,728 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 09:51:25,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 09:51:25,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 09:51:25,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:25,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:25,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:51:25,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:51:26,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:26,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446355572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:26,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:26,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:51:26,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791471344] [2025-03-03 09:51:26,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:26,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:26,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:26,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:26,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:26,013 INFO L87 Difference]: Start difference. First operand 4942 states and 6251 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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 09:51:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:26,622 INFO L93 Difference]: Finished difference Result 14775 states and 18685 transitions. [2025-03-03 09:51:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:26,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 216 [2025-03-03 09:51:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:26,648 INFO L225 Difference]: With dead ends: 14775 [2025-03-03 09:51:26,648 INFO L226 Difference]: Without dead ends: 9835 [2025-03-03 09:51:26,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:26,655 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 73 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:26,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 310 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:51:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9835 states. [2025-03-03 09:51:26,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9835 to 9827. [2025-03-03 09:51:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9827 states, 9826 states have (on average 1.2082230816201913) internal successors, (11872), 9826 states have internal predecessors, (11872), 0 states have call successors, (0), 0 states 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 09:51:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 11872 transitions. [2025-03-03 09:51:26,809 INFO L78 Accepts]: Start accepts. Automaton has 9827 states and 11872 transitions. Word has length 216 [2025-03-03 09:51:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:26,810 INFO L471 AbstractCegarLoop]: Abstraction has 9827 states and 11872 transitions. [2025-03-03 09:51:26,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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 09:51:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9827 states and 11872 transitions. [2025-03-03 09:51:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-03 09:51:26,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:26,818 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:26,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:51:27,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:27,019 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:27,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash 976027898, now seen corresponding path program 1 times [2025-03-03 09:51:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:27,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174500330] [2025-03-03 09:51:27,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:27,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:27,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-03 09:51:27,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-03 09:51:27,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:27,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:51:27,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:27,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174500330] [2025-03-03 09:51:27,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174500330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:27,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:27,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:51:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136346406] [2025-03-03 09:51:27,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:27,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:51:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:27,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:51:27,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:51:27,276 INFO L87 Difference]: Start difference. First operand 9827 states and 11872 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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 09:51:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:27,927 INFO L93 Difference]: Finished difference Result 19667 states and 23771 transitions. [2025-03-03 09:51:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:51:27,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2025-03-03 09:51:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:27,959 INFO L225 Difference]: With dead ends: 19667 [2025-03-03 09:51:27,959 INFO L226 Difference]: Without dead ends: 9842 [2025-03-03 09:51:27,970 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 09:51:27,971 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 793 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:27,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 45 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:51:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9842 states. [2025-03-03 09:51:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9842 to 9827. [2025-03-03 09:51:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9827 states, 9826 states have (on average 1.1984530836556075) internal successors, (11776), 9826 states have internal predecessors, (11776), 0 states have call successors, (0), 0 states 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 09:51:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 11776 transitions. [2025-03-03 09:51:28,195 INFO L78 Accepts]: Start accepts. Automaton has 9827 states and 11776 transitions. Word has length 247 [2025-03-03 09:51:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:28,195 INFO L471 AbstractCegarLoop]: Abstraction has 9827 states and 11776 transitions. [2025-03-03 09:51:28,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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 09:51:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 9827 states and 11776 transitions. [2025-03-03 09:51:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-03 09:51:28,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:28,209 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:28,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:51:28,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:28,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash -645959749, now seen corresponding path program 1 times [2025-03-03 09:51:28,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:28,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073624203] [2025-03-03 09:51:28,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:28,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:28,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-03 09:51:28,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-03 09:51:28,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:28,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:51:28,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:28,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073624203] [2025-03-03 09:51:28,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073624203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:28,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:28,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781983527] [2025-03-03 09:51:28,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:28,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:28,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:28,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:28,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:28,416 INFO L87 Difference]: Start difference. First operand 9827 states and 11776 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states 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 09:51:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:29,046 INFO L93 Difference]: Finished difference Result 22900 states and 28202 transitions. [2025-03-03 09:51:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:29,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 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 254 [2025-03-03 09:51:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:29,065 INFO L225 Difference]: With dead ends: 22900 [2025-03-03 09:51:29,065 INFO L226 Difference]: Without dead ends: 13075 [2025-03-03 09:51:29,074 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 09:51:29,074 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 151 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:29,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 149 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:51:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13075 states. [2025-03-03 09:51:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13075 to 13075. [2025-03-03 09:51:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13075 states, 13074 states have (on average 1.1724032430778644) internal successors, (15328), 13074 states have internal predecessors, (15328), 0 states have call successors, (0), 0 states 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 09:51:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13075 states to 13075 states and 15328 transitions. [2025-03-03 09:51:29,236 INFO L78 Accepts]: Start accepts. Automaton has 13075 states and 15328 transitions. Word has length 254 [2025-03-03 09:51:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:29,237 INFO L471 AbstractCegarLoop]: Abstraction has 13075 states and 15328 transitions. [2025-03-03 09:51:29,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states 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 09:51:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 13075 states and 15328 transitions. [2025-03-03 09:51:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-03 09:51:29,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:29,245 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, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-03 09:51:29,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:51:29,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:29,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:29,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1747337608, now seen corresponding path program 1 times [2025-03-03 09:51:29,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:29,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790812750] [2025-03-03 09:51:29,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:29,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-03 09:51:29,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-03 09:51:29,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:29,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:51:29,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:29,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790812750] [2025-03-03 09:51:29,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790812750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:29,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040466535] [2025-03-03 09:51:29,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:29,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:29,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:29,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:29,391 INFO L87 Difference]: Start difference. First operand 13075 states and 15328 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:29,979 INFO L93 Difference]: Finished difference Result 26156 states and 30670 transitions. [2025-03-03 09:51:29,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:29,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2025-03-03 09:51:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:29,995 INFO L225 Difference]: With dead ends: 26156 [2025-03-03 09:51:29,995 INFO L226 Difference]: Without dead ends: 13083 [2025-03-03 09:51:30,006 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 09:51:30,006 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 165 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:30,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 123 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:51:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13083 states. [2025-03-03 09:51:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13083 to 13075. [2025-03-03 09:51:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13075 states, 13074 states have (on average 1.1463974300137678) internal successors, (14988), 13074 states have internal predecessors, (14988), 0 states have call successors, (0), 0 states 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 09:51:30,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13075 states to 13075 states and 14988 transitions. [2025-03-03 09:51:30,131 INFO L78 Accepts]: Start accepts. Automaton has 13075 states and 14988 transitions. Word has length 256 [2025-03-03 09:51:30,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:30,132 INFO L471 AbstractCegarLoop]: Abstraction has 13075 states and 14988 transitions. [2025-03-03 09:51:30,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 13075 states and 14988 transitions. [2025-03-03 09:51:30,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-03 09:51:30,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:30,140 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:30,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:51:30,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:30,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:30,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1755146993, now seen corresponding path program 1 times [2025-03-03 09:51:30,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:30,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714949900] [2025-03-03 09:51:30,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:30,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:30,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 09:51:30,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 09:51:30,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:30,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:51:30,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:30,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714949900] [2025-03-03 09:51:30,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714949900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:30,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:30,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:30,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205718840] [2025-03-03 09:51:30,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:30,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:30,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:30,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:30,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:30,335 INFO L87 Difference]: Start difference. First operand 13075 states and 14988 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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 09:51:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:30,930 INFO L93 Difference]: Finished difference Result 32679 states and 37327 transitions. [2025-03-03 09:51:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:30,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 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 267 [2025-03-03 09:51:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:30,971 INFO L225 Difference]: With dead ends: 32679 [2025-03-03 09:51:30,971 INFO L226 Difference]: Without dead ends: 19606 [2025-03-03 09:51:30,985 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 09:51:30,986 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 153 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:30,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 156 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:51:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19606 states. [2025-03-03 09:51:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19606 to 19600. [2025-03-03 09:51:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19600 states, 19599 states have (on average 1.1385784989030052) internal successors, (22315), 19599 states have internal predecessors, (22315), 0 states have call successors, (0), 0 states 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 09:51:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19600 states to 19600 states and 22315 transitions. [2025-03-03 09:51:31,174 INFO L78 Accepts]: Start accepts. Automaton has 19600 states and 22315 transitions. Word has length 267 [2025-03-03 09:51:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:31,174 INFO L471 AbstractCegarLoop]: Abstraction has 19600 states and 22315 transitions. [2025-03-03 09:51:31,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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 09:51:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand 19600 states and 22315 transitions. [2025-03-03 09:51:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 09:51:31,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:31,186 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:31,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:51:31,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:31,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:31,187 INFO L85 PathProgramCache]: Analyzing trace with hash 687239827, now seen corresponding path program 1 times [2025-03-03 09:51:31,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:31,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761570885] [2025-03-03 09:51:31,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:31,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 09:51:31,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 09:51:31,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:31,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:51:31,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761570885] [2025-03-03 09:51:31,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761570885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:31,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:31,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:51:31,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146793416] [2025-03-03 09:51:31,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:31,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:31,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:31,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:31,503 INFO L87 Difference]: Start difference. First operand 19600 states and 22315 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:32,139 INFO L93 Difference]: Finished difference Result 48154 states and 54926 transitions. [2025-03-03 09:51:32,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:32,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2025-03-03 09:51:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:32,181 INFO L225 Difference]: With dead ends: 48154 [2025-03-03 09:51:32,181 INFO L226 Difference]: Without dead ends: 28556 [2025-03-03 09:51:32,198 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 09:51:32,199 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 135 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:32,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 375 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:51:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28556 states. [2025-03-03 09:51:32,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28556 to 26116. [2025-03-03 09:51:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26116 states, 26115 states have (on average 1.1313421405322612) internal successors, (29545), 26115 states have internal predecessors, (29545), 0 states have call successors, (0), 0 states 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 09:51:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26116 states to 26116 states and 29545 transitions. [2025-03-03 09:51:32,488 INFO L78 Accepts]: Start accepts. Automaton has 26116 states and 29545 transitions. Word has length 271 [2025-03-03 09:51:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:32,488 INFO L471 AbstractCegarLoop]: Abstraction has 26116 states and 29545 transitions. [2025-03-03 09:51:32,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 26116 states and 29545 transitions. [2025-03-03 09:51:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 09:51:32,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:32,501 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:32,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 09:51:32,501 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:32,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:32,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2003830772, now seen corresponding path program 1 times [2025-03-03 09:51:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:32,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952804433] [2025-03-03 09:51:32,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:32,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:32,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 09:51:32,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 09:51:32,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:32,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:51:33,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:33,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952804433] [2025-03-03 09:51:33,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952804433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:33,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937341108] [2025-03-03 09:51:33,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:33,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:33,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:33,301 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 09:51:33,303 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 09:51:33,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 09:51:33,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 09:51:33,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:33,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:33,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:51:33,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 09:51:33,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:33,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937341108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:33,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:33,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-03 09:51:33,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959410118] [2025-03-03 09:51:33,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:33,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:33,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:33,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:33,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:33,544 INFO L87 Difference]: Start difference. First operand 26116 states and 29545 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:34,121 INFO L93 Difference]: Finished difference Result 66910 states and 76149 transitions. [2025-03-03 09:51:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:34,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-03-03 09:51:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:34,171 INFO L225 Difference]: With dead ends: 66910 [2025-03-03 09:51:34,171 INFO L226 Difference]: Without dead ends: 40796 [2025-03-03 09:51:34,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:34,196 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 180 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:34,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 103 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:51:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40796 states. [2025-03-03 09:51:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40796 to 35904. [2025-03-03 09:51:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35904 states, 35903 states have (on average 1.134751970587416) internal successors, (40741), 35903 states have internal predecessors, (40741), 0 states have call successors, (0), 0 states 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 09:51:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35904 states to 35904 states and 40741 transitions. [2025-03-03 09:51:34,639 INFO L78 Accepts]: Start accepts. Automaton has 35904 states and 40741 transitions. Word has length 274 [2025-03-03 09:51:34,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:34,639 INFO L471 AbstractCegarLoop]: Abstraction has 35904 states and 40741 transitions. [2025-03-03 09:51:34,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 35904 states and 40741 transitions. [2025-03-03 09:51:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-03 09:51:34,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:34,654 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-03 09:51:34,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:51:34,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:34,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:34,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:34,855 INFO L85 PathProgramCache]: Analyzing trace with hash -624607271, now seen corresponding path program 1 times [2025-03-03 09:51:34,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:34,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272276656] [2025-03-03 09:51:34,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:34,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:34,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-03 09:51:34,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-03 09:51:34,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:34,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 09:51:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272276656] [2025-03-03 09:51:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272276656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:35,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:35,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:35,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817751165] [2025-03-03 09:51:35,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:35,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:35,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:35,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:35,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:35,083 INFO L87 Difference]: Start difference. First operand 35904 states and 40741 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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 09:51:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:35,791 INFO L93 Difference]: Finished difference Result 93210 states and 105270 transitions. [2025-03-03 09:51:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:35,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 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 284 [2025-03-03 09:51:35,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:35,876 INFO L225 Difference]: With dead ends: 93210 [2025-03-03 09:51:35,877 INFO L226 Difference]: Without dead ends: 57308 [2025-03-03 09:51:35,912 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 09:51:35,913 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 199 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:35,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 141 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:51:35,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57308 states. [2025-03-03 09:51:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57308 to 57304. [2025-03-03 09:51:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57304 states, 57303 states have (on average 1.124635708427133) internal successors, (64445), 57303 states have internal predecessors, (64445), 0 states have call successors, (0), 0 states 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 09:51:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57304 states to 57304 states and 64445 transitions. [2025-03-03 09:51:36,585 INFO L78 Accepts]: Start accepts. Automaton has 57304 states and 64445 transitions. Word has length 284 [2025-03-03 09:51:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:36,585 INFO L471 AbstractCegarLoop]: Abstraction has 57304 states and 64445 transitions. [2025-03-03 09:51:36,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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 09:51:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 57304 states and 64445 transitions. [2025-03-03 09:51:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-03 09:51:36,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:36,601 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-03 09:51:36,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 09:51:36,601 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:36,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:36,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1712368396, now seen corresponding path program 1 times [2025-03-03 09:51:36,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:36,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228436122] [2025-03-03 09:51:36,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:36,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-03 09:51:36,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-03 09:51:36,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:36,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 09:51:36,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:36,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228436122] [2025-03-03 09:51:36,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228436122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:36,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:36,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:36,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511842047] [2025-03-03 09:51:36,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:36,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:36,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:36,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:36,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:36,732 INFO L87 Difference]: Start difference. First operand 57304 states and 64445 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:37,678 INFO L93 Difference]: Finished difference Result 165252 states and 185682 transitions. [2025-03-03 09:51:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:37,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2025-03-03 09:51:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:37,794 INFO L225 Difference]: With dead ends: 165252 [2025-03-03 09:51:37,794 INFO L226 Difference]: Without dead ends: 107950 [2025-03-03 09:51:37,821 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 09:51:37,822 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 222 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:37,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 154 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:51:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107950 states. [2025-03-03 09:51:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107950 to 106318. [2025-03-03 09:51:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106318 states, 106317 states have (on average 1.1120422886274066) internal successors, (118229), 106317 states have internal predecessors, (118229), 0 states have call successors, (0), 0 states 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 09:51:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106318 states to 106318 states and 118229 transitions. [2025-03-03 09:51:38,964 INFO L78 Accepts]: Start accepts. Automaton has 106318 states and 118229 transitions. Word has length 286 [2025-03-03 09:51:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:38,964 INFO L471 AbstractCegarLoop]: Abstraction has 106318 states and 118229 transitions. [2025-03-03 09:51:38,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 106318 states and 118229 transitions. [2025-03-03 09:51:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-03 09:51:38,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:38,984 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-03 09:51:38,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 09:51:38,984 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:38,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:38,985 INFO L85 PathProgramCache]: Analyzing trace with hash 748863871, now seen corresponding path program 1 times [2025-03-03 09:51:38,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:38,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824645923] [2025-03-03 09:51:38,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:38,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:39,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-03 09:51:39,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-03 09:51:39,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:39,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:51:39,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:39,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824645923] [2025-03-03 09:51:39,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824645923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:39,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:39,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:51:39,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332928636] [2025-03-03 09:51:39,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:39,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:51:39,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:39,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:51:39,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:51:39,169 INFO L87 Difference]: Start difference. First operand 106318 states and 118229 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 09:51:40,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:40,583 INFO L93 Difference]: Finished difference Result 221644 states and 247303 transitions. [2025-03-03 09:51:40,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:51:40,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 287 [2025-03-03 09:51:40,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:40,726 INFO L225 Difference]: With dead ends: 221644 [2025-03-03 09:51:40,726 INFO L226 Difference]: Without dead ends: 115328 [2025-03-03 09:51:40,796 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 09:51:40,796 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 328 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:40,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 102 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:51:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115328 states. [2025-03-03 09:51:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115328 to 106727. [2025-03-03 09:51:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106727 states, 106726 states have (on average 1.112240691115567) internal successors, (118705), 106726 states have internal predecessors, (118705), 0 states have call successors, (0), 0 states 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 09:51:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106727 states to 106727 states and 118705 transitions. [2025-03-03 09:51:42,017 INFO L78 Accepts]: Start accepts. Automaton has 106727 states and 118705 transitions. Word has length 287 [2025-03-03 09:51:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:42,018 INFO L471 AbstractCegarLoop]: Abstraction has 106727 states and 118705 transitions. [2025-03-03 09:51:42,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 09:51:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 106727 states and 118705 transitions. [2025-03-03 09:51:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-03 09:51:42,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:42,036 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:51:42,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 09:51:42,036 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:42,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:42,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1608952858, now seen corresponding path program 1 times [2025-03-03 09:51:42,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:42,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141102389] [2025-03-03 09:51:42,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:42,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:42,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-03 09:51:42,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-03 09:51:42,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:42,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-03 09:51:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141102389] [2025-03-03 09:51:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141102389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363598062] [2025-03-03 09:51:43,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:43,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:43,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:43,251 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 09:51:43,252 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 09:51:43,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-03 09:51:43,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-03 09:51:43,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:43,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:43,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:51:43,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 09:51:43,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:43,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363598062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:43,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:43,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:51:43,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412559521] [2025-03-03 09:51:43,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:43,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:43,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:43,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:43,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:43,538 INFO L87 Difference]: Start difference. First operand 106727 states and 118705 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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 09:51:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:44,588 INFO L93 Difference]: Finished difference Result 208291 states and 231641 transitions. [2025-03-03 09:51:44,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:44,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 289 [2025-03-03 09:51:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:44,715 INFO L225 Difference]: With dead ends: 208291 [2025-03-03 09:51:44,715 INFO L226 Difference]: Without dead ends: 101566 [2025-03-03 09:51:44,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:44,759 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 81 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:44,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 323 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:51:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101566 states. [2025-03-03 09:51:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101566 to 100748. [2025-03-03 09:51:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100748 states, 100747 states have (on average 1.0853722691494536) internal successors, (109348), 100747 states have internal predecessors, (109348), 0 states have call successors, (0), 0 states 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 09:51:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100748 states to 100748 states and 109348 transitions. [2025-03-03 09:51:45,798 INFO L78 Accepts]: Start accepts. Automaton has 100748 states and 109348 transitions. Word has length 289 [2025-03-03 09:51:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:45,798 INFO L471 AbstractCegarLoop]: Abstraction has 100748 states and 109348 transitions. [2025-03-03 09:51:45,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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 09:51:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 100748 states and 109348 transitions. [2025-03-03 09:51:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-03 09:51:45,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:45,812 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-03-03 09:51:45,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:51:46,013 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,SelfDestructingSolverStorable16 [2025-03-03 09:51:46,013 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:46,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:46,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1912679454, now seen corresponding path program 1 times [2025-03-03 09:51:46,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:46,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753401260] [2025-03-03 09:51:46,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:46,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:46,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-03 09:51:46,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-03 09:51:46,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:46,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 09:51:46,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:46,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753401260] [2025-03-03 09:51:46,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753401260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:46,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362138383] [2025-03-03 09:51:46,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:46,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:46,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:46,380 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 09:51:46,382 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 09:51:46,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-03 09:51:46,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-03 09:51:46,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:46,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:46,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:51:46,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:51:46,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:46,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362138383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:46,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:46,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:51:46,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995467652] [2025-03-03 09:51:46,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:46,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:46,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:46,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:46,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:46,636 INFO L87 Difference]: Start difference. First operand 100748 states and 109348 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states 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 09:51:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:47,727 INFO L93 Difference]: Finished difference Result 251515 states and 273203 transitions. [2025-03-03 09:51:47,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:47,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 291 [2025-03-03 09:51:47,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:47,920 INFO L225 Difference]: With dead ends: 251515 [2025-03-03 09:51:47,920 INFO L226 Difference]: Without dead ends: 150769 [2025-03-03 09:51:47,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:47,995 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 53 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:47,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 156 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:51:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150769 states. [2025-03-03 09:51:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150769 to 96286. [2025-03-03 09:51:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96286 states, 96285 states have (on average 1.100192137923872) internal successors, (105932), 96285 states have internal predecessors, (105932), 0 states have call successors, (0), 0 states 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 09:51:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96286 states to 96286 states and 105932 transitions. [2025-03-03 09:51:49,806 INFO L78 Accepts]: Start accepts. Automaton has 96286 states and 105932 transitions. Word has length 291 [2025-03-03 09:51:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:49,807 INFO L471 AbstractCegarLoop]: Abstraction has 96286 states and 105932 transitions. [2025-03-03 09:51:49,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states 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 09:51:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 96286 states and 105932 transitions. [2025-03-03 09:51:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-03 09:51:49,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:49,830 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:51:49,836 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 09:51:50,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 09:51:50,031 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:50,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1414508143, now seen corresponding path program 1 times [2025-03-03 09:51:50,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:50,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884769986] [2025-03-03 09:51:50,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:50,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:50,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-03 09:51:50,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-03 09:51:50,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:50,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 148 proven. 6 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 09:51:51,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:51,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884769986] [2025-03-03 09:51:51,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884769986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:51,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385361422] [2025-03-03 09:51:51,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:51,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:51,026 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:51:51,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:51:51,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-03 09:51:51,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-03 09:51:51,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:51,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:51,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:51:51,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 09:51:51,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:51,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385361422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:51,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:51,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:51:51,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784276826] [2025-03-03 09:51:51,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:51,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:51,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:51,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:51,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:51,353 INFO L87 Difference]: Start difference. First operand 96286 states and 105932 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:52,365 INFO L93 Difference]: Finished difference Result 219432 states and 240923 transitions. [2025-03-03 09:51:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:52,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 402 [2025-03-03 09:51:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:52,528 INFO L225 Difference]: With dead ends: 219432 [2025-03-03 09:51:52,528 INFO L226 Difference]: Without dead ends: 123148 [2025-03-03 09:51:52,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:52,606 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 163 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:52,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 139 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:51:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123148 states. [2025-03-03 09:51:54,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123148 to 123136. [2025-03-03 09:51:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123136 states, 123135 states have (on average 1.0866284971778941) internal successors, (133802), 123135 states have internal predecessors, (133802), 0 states have call successors, (0), 0 states 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 09:51:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123136 states to 123136 states and 133802 transitions. [2025-03-03 09:51:54,464 INFO L78 Accepts]: Start accepts. Automaton has 123136 states and 133802 transitions. Word has length 402 [2025-03-03 09:51:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:54,465 INFO L471 AbstractCegarLoop]: Abstraction has 123136 states and 133802 transitions. [2025-03-03 09:51:54,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 123136 states and 133802 transitions. [2025-03-03 09:51:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-03 09:51:54,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:54,520 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:54,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:51:54,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:54,721 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:54,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:54,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1282929223, now seen corresponding path program 1 times [2025-03-03 09:51:54,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:54,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672387796] [2025-03-03 09:51:54,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:54,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:54,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-03 09:51:54,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-03 09:51:54,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:54,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2025-03-03 09:51:56,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672387796] [2025-03-03 09:51:56,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672387796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486057436] [2025-03-03 09:51:56,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:56,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:56,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:56,145 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:51:56,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:51:56,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-03 09:51:56,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-03 09:51:56,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:56,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:56,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:51:56,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-03 09:51:56,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:56,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486057436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:56,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:56,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:51:56,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467846848] [2025-03-03 09:51:56,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:56,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:56,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:56,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:56,520 INFO L87 Difference]: Start difference. First operand 123136 states and 133802 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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 09:51:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:57,370 INFO L93 Difference]: Finished difference Result 244652 states and 265834 transitions. [2025-03-03 09:51:57,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:57,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 453 [2025-03-03 09:51:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:57,512 INFO L225 Difference]: With dead ends: 244652 [2025-03-03 09:51:57,512 INFO L226 Difference]: Without dead ends: 121518 [2025-03-03 09:51:57,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:57,588 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 85 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:57,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 291 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:51:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121518 states. [2025-03-03 09:51:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121518 to 121305. [2025-03-03 09:51:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121305 states, 121304 states have (on average 1.0826353623953044) internal successors, (131328), 121304 states have internal predecessors, (131328), 0 states have call successors, (0), 0 states 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 09:51:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121305 states to 121305 states and 131328 transitions. [2025-03-03 09:51:58,865 INFO L78 Accepts]: Start accepts. Automaton has 121305 states and 131328 transitions. Word has length 453 [2025-03-03 09:51:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:58,865 INFO L471 AbstractCegarLoop]: Abstraction has 121305 states and 131328 transitions. [2025-03-03 09:51:58,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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 09:51:58,865 INFO L276 IsEmpty]: Start isEmpty. Operand 121305 states and 131328 transitions. [2025-03-03 09:51:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 09:51:58,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:58,907 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:58,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:51:59,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:59,107 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:59,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash 778888618, now seen corresponding path program 1 times [2025-03-03 09:51:59,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:59,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097291433] [2025-03-03 09:51:59,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:59,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:59,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 09:51:59,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 09:51:59,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:59,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 185 proven. 6 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-03-03 09:52:00,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097291433] [2025-03-03 09:52:00,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097291433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:52:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102642930] [2025-03-03 09:52:00,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:00,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:00,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:00,374 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:52:00,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:52:00,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 09:52:00,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 09:52:00,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:00,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:00,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:52:00,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:52:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 418 proven. 137 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-03 09:52:00,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:52:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 418 proven. 137 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-03 09:52:01,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102642930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:52:01,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:52:01,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2025-03-03 09:52:01,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526434972] [2025-03-03 09:52:01,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:52:01,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:52:01,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:01,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:52:01,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:52:01,058 INFO L87 Difference]: Start difference. First operand 121305 states and 131328 transitions. Second operand has 7 states, 7 states have (on average 55.0) internal successors, (385), 6 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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 09:52:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:03,545 INFO L93 Difference]: Finished difference Result 348482 states and 376942 transitions. [2025-03-03 09:52:03,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:52:03,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 55.0) internal successors, (385), 6 states have internal predecessors, (385), 0 states have call successors, (0), 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 09:52:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:03,823 INFO L225 Difference]: With dead ends: 348482 [2025-03-03 09:52:03,823 INFO L226 Difference]: Without dead ends: 227179 [2025-03-03 09:52:03,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 933 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:52:03,921 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1361 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 3008 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 3237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 3008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:03,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 248 Invalid, 3237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 3008 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 09:52:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227179 states. [2025-03-03 09:52:06,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227179 to 219656. [2025-03-03 09:52:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219656 states, 219655 states have (on average 1.0801529671530354) internal successors, (237261), 219655 states have internal predecessors, (237261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)