./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label44.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 16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:33:30,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:33:30,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:33:30,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:33:30,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:33:30,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:33:30,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:33:30,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:33:30,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:33:30,689 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:33:30,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:33:30,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:33:30,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:33:30,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:33:30,689 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:33:30,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:33:30,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:33:30,690 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:33:30,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:33:30,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:33:30,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:33:30,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:33:30,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:33:30,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:33:30,690 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:33:30,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:33:30,691 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:33:30,691 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:33:30,691 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:33:30,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:33:30,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:33:30,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:33:30,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:33:30,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:33:30,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:33:30,691 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:33:30,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:33:30,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:33:30,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:33:30,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:33:30,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:33:30,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:33:30,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:33:30,692 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 -> 16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b [2025-03-03 10:33:30,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:33:30,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:33:30,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:33:30,937 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:33:30,937 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:33:30,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2025-03-03 10:33:32,114 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffcb733e3/182411b2705c4b05909b825cb3ca0f2a/FLAGfa11af5d0 [2025-03-03 10:33:32,405 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:33:32,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2025-03-03 10:33:32,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffcb733e3/182411b2705c4b05909b825cb3ca0f2a/FLAGfa11af5d0 [2025-03-03 10:33:32,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffcb733e3/182411b2705c4b05909b825cb3ca0f2a [2025-03-03 10:33:32,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:33:32,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:33:32,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:33:32,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:33:32,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:33:32,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:32,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58691968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32, skipping insertion in model container [2025-03-03 10:33:32,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:32,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:33:32,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c[3841,3854] [2025-03-03 10:33:32,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:33:32,842 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:33:32,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c[3841,3854] [2025-03-03 10:33:32,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:33:32,953 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:33:32,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32 WrapperNode [2025-03-03 10:33:32,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:33:32,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:33:32,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:33:32,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:33:32,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:32,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:33,058 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-03 10:33:33,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:33:33,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:33:33,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:33:33,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:33:33,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:33,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:33,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:33,127 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:33:33,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:33,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:33,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:33,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:33,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:33,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:33,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:33:33,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:33:33,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:33:33,206 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:33:33,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (1/1) ... [2025-03-03 10:33:33,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:33:33,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:33,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:33:33,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:33:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:33:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:33:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:33:33,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:33:33,304 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:33:33,305 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:33:34,590 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-03 10:33:34,590 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:33:34,605 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:33:34,605 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:33:34,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:33:34 BoogieIcfgContainer [2025-03-03 10:33:34,606 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:33:34,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:33:34,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:33:34,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:33:34,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:33:32" (1/3) ... [2025-03-03 10:33:34,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3815c758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:33:34, skipping insertion in model container [2025-03-03 10:33:34,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:33:32" (2/3) ... [2025-03-03 10:33:34,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3815c758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:33:34, skipping insertion in model container [2025-03-03 10:33:34,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:33:34" (3/3) ... [2025-03-03 10:33:34,616 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label44.c [2025-03-03 10:33:34,626 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:33:34,628 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label44.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:33:34,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:33:34,691 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;@f2801bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:33:34,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:33:34,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:34,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 10:33:34,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:34,703 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] [2025-03-03 10:33:34,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:34,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:34,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1455960224, now seen corresponding path program 1 times [2025-03-03 10:33:34,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:34,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664956968] [2025-03-03 10:33:34,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:34,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:34,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 10:33:34,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 10:33:34,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:34,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:34,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:34,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664956968] [2025-03-03 10:33:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664956968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:34,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:34,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:33:34,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78784300] [2025-03-03 10:33:34,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:34,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:34,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:34,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:34,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:34,986 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:35,876 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-03-03 10:33:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:35,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 10:33:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:35,883 INFO L225 Difference]: With dead ends: 761 [2025-03-03 10:33:35,884 INFO L226 Difference]: Without dead ends: 413 [2025-03-03 10:33:35,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:35,887 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 202 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:35,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:33:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-03 10:33:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-03-03 10:33:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-03-03 10:33:35,927 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 26 [2025-03-03 10:33:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:35,928 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-03-03 10:33:35,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-03-03 10:33:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 10:33:35,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:35,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:35,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:33:35,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:35,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1132705045, now seen corresponding path program 1 times [2025-03-03 10:33:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384637350] [2025-03-03 10:33:35,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:35,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:35,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 10:33:35,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 10:33:35,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:35,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:36,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:36,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384637350] [2025-03-03 10:33:36,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384637350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:36,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:36,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:33:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895764470] [2025-03-03 10:33:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:36,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:36,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:36,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:36,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:36,133 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:36,712 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-03-03 10:33:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:36,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 10:33:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:36,716 INFO L225 Difference]: With dead ends: 1211 [2025-03-03 10:33:36,716 INFO L226 Difference]: Without dead ends: 800 [2025-03-03 10:33:36,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:36,717 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:36,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:33:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-03 10:33:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-03-03 10:33:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2025-03-03 10:33:36,742 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 94 [2025-03-03 10:33:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:36,742 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2025-03-03 10:33:36,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2025-03-03 10:33:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 10:33:36,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:36,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:36,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:33:36,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:36,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash -958794291, now seen corresponding path program 1 times [2025-03-03 10:33:36,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:36,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538574559] [2025-03-03 10:33:36,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:36,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:36,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 10:33:36,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 10:33:36,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:36,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:37,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:37,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538574559] [2025-03-03 10:33:37,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538574559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:37,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:37,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:37,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901943303] [2025-03-03 10:33:37,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:37,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:33:37,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:37,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:33:37,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:37,094 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:38,183 INFO L93 Difference]: Finished difference Result 2505 states and 3428 transitions. [2025-03-03 10:33:38,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:33:38,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-03 10:33:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:38,189 INFO L225 Difference]: With dead ends: 2505 [2025-03-03 10:33:38,189 INFO L226 Difference]: Without dead ends: 1718 [2025-03-03 10:33:38,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:33:38,191 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:38,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 218 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:33:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-03-03 10:33:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714. [2025-03-03 10:33:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 1.2265032107413893) internal successors, (2101), 1713 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions. [2025-03-03 10:33:38,225 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 95 [2025-03-03 10:33:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:38,225 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions. [2025-03-03 10:33:38,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions. [2025-03-03 10:33:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 10:33:38,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:38,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:38,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:33:38,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:38,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:38,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1136476867, now seen corresponding path program 1 times [2025-03-03 10:33:38,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:38,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727878085] [2025-03-03 10:33:38,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:38,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:38,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 10:33:38,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 10:33:38,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:38,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:38,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:38,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727878085] [2025-03-03 10:33:38,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727878085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:38,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:38,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372094962] [2025-03-03 10:33:38,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:38,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:38,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:38,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:38,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:38,415 INFO L87 Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:39,008 INFO L93 Difference]: Finished difference Result 4005 states and 5048 transitions. [2025-03-03 10:33:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:39,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-03-03 10:33:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:39,016 INFO L225 Difference]: With dead ends: 4005 [2025-03-03 10:33:39,017 INFO L226 Difference]: Without dead ends: 2477 [2025-03-03 10:33:39,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:39,019 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 209 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:39,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:33:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-03-03 10:33:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2474. [2025-03-03 10:33:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2473 states have (on average 1.2308936514355033) internal successors, (3044), 2473 states have internal predecessors, (3044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3044 transitions. [2025-03-03 10:33:39,059 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3044 transitions. Word has length 153 [2025-03-03 10:33:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:39,060 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 3044 transitions. [2025-03-03 10:33:39,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3044 transitions. [2025-03-03 10:33:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 10:33:39,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:39,065 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:33:39,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:33:39,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:39,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash 96098514, now seen corresponding path program 1 times [2025-03-03 10:33:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:39,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523239953] [2025-03-03 10:33:39,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:39,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:39,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 10:33:39,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 10:33:39,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:39,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523239953] [2025-03-03 10:33:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523239953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:39,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891245675] [2025-03-03 10:33:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:39,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:39,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:39,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:39,259 INFO L87 Difference]: Start difference. First operand 2474 states and 3044 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:39,891 INFO L93 Difference]: Finished difference Result 5885 states and 7350 transitions. [2025-03-03 10:33:39,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:39,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-03-03 10:33:39,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:39,901 INFO L225 Difference]: With dead ends: 5885 [2025-03-03 10:33:39,902 INFO L226 Difference]: Without dead ends: 3597 [2025-03-03 10:33:39,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:39,905 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:39,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 339 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:33:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2025-03-03 10:33:39,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3397. [2025-03-03 10:33:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.2105418138987043) internal successors, (4111), 3396 states have internal predecessors, (4111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4111 transitions. [2025-03-03 10:33:39,959 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4111 transitions. Word has length 206 [2025-03-03 10:33:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:39,960 INFO L471 AbstractCegarLoop]: Abstraction has 3397 states and 4111 transitions. [2025-03-03 10:33:39,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4111 transitions. [2025-03-03 10:33:39,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 10:33:39,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:39,962 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:39,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:33:39,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:39,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:39,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1266141616, now seen corresponding path program 1 times [2025-03-03 10:33:39,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:39,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575110925] [2025-03-03 10:33:39,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:39,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:39,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 10:33:39,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 10:33:39,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:39,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 10:33:40,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:40,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575110925] [2025-03-03 10:33:40,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575110925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:40,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:40,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:40,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589016134] [2025-03-03 10:33:40,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:40,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:40,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:40,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:40,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:40,160 INFO L87 Difference]: Start difference. First operand 3397 states and 4111 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:40,801 INFO L93 Difference]: Finished difference Result 9030 states and 11023 transitions. [2025-03-03 10:33:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:40,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 207 [2025-03-03 10:33:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:40,816 INFO L225 Difference]: With dead ends: 9030 [2025-03-03 10:33:40,817 INFO L226 Difference]: Without dead ends: 5635 [2025-03-03 10:33:40,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:40,821 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 195 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:40,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 347 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:33:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5635 states. [2025-03-03 10:33:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5635 to 5635. [2025-03-03 10:33:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5635 states, 5634 states have (on average 1.207667731629393) internal successors, (6804), 5634 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 6804 transitions. [2025-03-03 10:33:40,904 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 6804 transitions. Word has length 207 [2025-03-03 10:33:40,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:40,904 INFO L471 AbstractCegarLoop]: Abstraction has 5635 states and 6804 transitions. [2025-03-03 10:33:40,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 6804 transitions. [2025-03-03 10:33:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 10:33:40,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:40,906 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:40,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:33:40,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:40,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:40,906 INFO L85 PathProgramCache]: Analyzing trace with hash 354936973, now seen corresponding path program 1 times [2025-03-03 10:33:40,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:40,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714762883] [2025-03-03 10:33:40,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:40,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:40,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 10:33:40,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 10:33:40,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:40,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 10:33:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714762883] [2025-03-03 10:33:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714762883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:41,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:41,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:41,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468048589] [2025-03-03 10:33:41,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:41,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:41,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:41,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:41,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:41,041 INFO L87 Difference]: Start difference. First operand 5635 states and 6804 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:41,677 INFO L93 Difference]: Finished difference Result 12389 states and 15113 transitions. [2025-03-03 10:33:41,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:41,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 208 [2025-03-03 10:33:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:41,693 INFO L225 Difference]: With dead ends: 12389 [2025-03-03 10:33:41,693 INFO L226 Difference]: Without dead ends: 6756 [2025-03-03 10:33:41,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:41,700 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 171 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:41,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 386 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:33:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2025-03-03 10:33:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 6739. [2025-03-03 10:33:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6739 states, 6738 states have (on average 1.1852181656277827) internal successors, (7986), 6738 states have internal predecessors, (7986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6739 states to 6739 states and 7986 transitions. [2025-03-03 10:33:41,791 INFO L78 Accepts]: Start accepts. Automaton has 6739 states and 7986 transitions. Word has length 208 [2025-03-03 10:33:41,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:41,791 INFO L471 AbstractCegarLoop]: Abstraction has 6739 states and 7986 transitions. [2025-03-03 10:33:41,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:41,791 INFO L276 IsEmpty]: Start isEmpty. Operand 6739 states and 7986 transitions. [2025-03-03 10:33:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 10:33:41,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:41,793 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:33:41,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:33:41,794 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:41,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash -892622373, now seen corresponding path program 1 times [2025-03-03 10:33:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:41,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360024976] [2025-03-03 10:33:41,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:41,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:41,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 10:33:41,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 10:33:41,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:41,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-03 10:33:41,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:41,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360024976] [2025-03-03 10:33:41,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360024976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:41,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:41,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218748308] [2025-03-03 10:33:41,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:41,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:41,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:41,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:41,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:41,967 INFO L87 Difference]: Start difference. First operand 6739 states and 7986 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:42,618 INFO L93 Difference]: Finished difference Result 14609 states and 17403 transitions. [2025-03-03 10:33:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:42,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 228 [2025-03-03 10:33:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:42,637 INFO L225 Difference]: With dead ends: 14609 [2025-03-03 10:33:42,637 INFO L226 Difference]: Without dead ends: 7872 [2025-03-03 10:33:42,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:42,644 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 176 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:42,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 208 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:33:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7872 states. [2025-03-03 10:33:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7872 to 7659. [2025-03-03 10:33:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7659 states, 7658 states have (on average 1.1880386523896578) internal successors, (9098), 7658 states have internal predecessors, (9098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7659 states to 7659 states and 9098 transitions. [2025-03-03 10:33:42,754 INFO L78 Accepts]: Start accepts. Automaton has 7659 states and 9098 transitions. Word has length 228 [2025-03-03 10:33:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:42,754 INFO L471 AbstractCegarLoop]: Abstraction has 7659 states and 9098 transitions. [2025-03-03 10:33:42,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7659 states and 9098 transitions. [2025-03-03 10:33:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 10:33:42,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:42,760 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:42,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:33:42,760 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:42,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1247327848, now seen corresponding path program 1 times [2025-03-03 10:33:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:42,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389321882] [2025-03-03 10:33:42,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:42,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:42,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 10:33:42,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 10:33:42,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:42,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 10:33:42,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:42,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389321882] [2025-03-03 10:33:42,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389321882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:42,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:42,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:42,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884579248] [2025-03-03 10:33:42,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:42,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:42,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:42,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:42,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:42,954 INFO L87 Difference]: Start difference. First operand 7659 states and 9098 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:43,588 INFO L93 Difference]: Finished difference Result 15327 states and 18216 transitions. [2025-03-03 10:33:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:43,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 235 [2025-03-03 10:33:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:43,610 INFO L225 Difference]: With dead ends: 15327 [2025-03-03 10:33:43,610 INFO L226 Difference]: Without dead ends: 7670 [2025-03-03 10:33:43,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:43,619 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 175 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:43,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 378 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:33:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2025-03-03 10:33:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 7474. [2025-03-03 10:33:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7474 states, 7473 states have (on average 1.164324902984076) internal successors, (8701), 7473 states have internal predecessors, (8701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7474 states to 7474 states and 8701 transitions. [2025-03-03 10:33:43,709 INFO L78 Accepts]: Start accepts. Automaton has 7474 states and 8701 transitions. Word has length 235 [2025-03-03 10:33:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:43,709 INFO L471 AbstractCegarLoop]: Abstraction has 7474 states and 8701 transitions. [2025-03-03 10:33:43,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 7474 states and 8701 transitions. [2025-03-03 10:33:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-03 10:33:43,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:43,712 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:33:43,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:33:43,712 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:43,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:43,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1227299026, now seen corresponding path program 1 times [2025-03-03 10:33:43,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:43,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113228334] [2025-03-03 10:33:43,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:43,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-03 10:33:43,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-03 10:33:43,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:43,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 10:33:43,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:43,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113228334] [2025-03-03 10:33:43,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113228334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:43,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:43,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:43,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793724174] [2025-03-03 10:33:43,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:43,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:43,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:43,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:43,911 INFO L87 Difference]: Start difference. First operand 7474 states and 8701 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:44,478 INFO L93 Difference]: Finished difference Result 15872 states and 18630 transitions. [2025-03-03 10:33:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:44,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 258 [2025-03-03 10:33:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:44,491 INFO L225 Difference]: With dead ends: 15872 [2025-03-03 10:33:44,491 INFO L226 Difference]: Without dead ends: 8400 [2025-03-03 10:33:44,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:44,498 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 198 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:44,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 155 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:33:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8400 states. [2025-03-03 10:33:44,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8400 to 7474. [2025-03-03 10:33:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7474 states, 7473 states have (on average 1.164324902984076) internal successors, (8701), 7473 states have internal predecessors, (8701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7474 states to 7474 states and 8701 transitions. [2025-03-03 10:33:44,582 INFO L78 Accepts]: Start accepts. Automaton has 7474 states and 8701 transitions. Word has length 258 [2025-03-03 10:33:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:44,582 INFO L471 AbstractCegarLoop]: Abstraction has 7474 states and 8701 transitions. [2025-03-03 10:33:44,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7474 states and 8701 transitions. [2025-03-03 10:33:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-03 10:33:44,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:44,586 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 10:33:44,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:33:44,586 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:44,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:44,587 INFO L85 PathProgramCache]: Analyzing trace with hash -440671699, now seen corresponding path program 1 times [2025-03-03 10:33:44,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:44,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031997975] [2025-03-03 10:33:44,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:44,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:44,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-03 10:33:44,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-03 10:33:44,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:44,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 10:33:44,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:44,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031997975] [2025-03-03 10:33:44,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031997975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:44,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:44,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:44,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261814408] [2025-03-03 10:33:44,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:44,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:33:44,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:44,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:33:44,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:44,838 INFO L87 Difference]: Start difference. First operand 7474 states and 8701 transitions. Second operand has 4 states, 4 states have (on average 48.75) 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 10:33:45,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:45,873 INFO L93 Difference]: Finished difference Result 22156 states and 26225 transitions. [2025-03-03 10:33:45,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:33:45,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) 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 261 [2025-03-03 10:33:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:45,897 INFO L225 Difference]: With dead ends: 22156 [2025-03-03 10:33:45,898 INFO L226 Difference]: Without dead ends: 14684 [2025-03-03 10:33:45,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:45,908 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 259 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:45,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 76 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:33:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14684 states. [2025-03-03 10:33:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14684 to 14479. [2025-03-03 10:33:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14479 states, 14478 states have (on average 1.1688769167012019) internal successors, (16923), 14478 states have internal predecessors, (16923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 16923 transitions. [2025-03-03 10:33:46,116 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 16923 transitions. Word has length 261 [2025-03-03 10:33:46,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:46,116 INFO L471 AbstractCegarLoop]: Abstraction has 14479 states and 16923 transitions. [2025-03-03 10:33:46,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) 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 10:33:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 16923 transitions. [2025-03-03 10:33:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 10:33:46,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:46,122 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:46,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:33:46,123 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:46,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash 806503048, now seen corresponding path program 1 times [2025-03-03 10:33:46,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:46,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257797080] [2025-03-03 10:33:46,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:46,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 10:33:46,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 10:33:46,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:46,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:46,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:46,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257797080] [2025-03-03 10:33:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257797080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:46,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:46,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137379536] [2025-03-03 10:33:46,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:46,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:33:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:46,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:33:46,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:46,323 INFO L87 Difference]: Start difference. First operand 14479 states and 16923 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:47,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:47,231 INFO L93 Difference]: Finished difference Result 37092 states and 43497 transitions. [2025-03-03 10:33:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:33:47,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2025-03-03 10:33:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:47,261 INFO L225 Difference]: With dead ends: 37092 [2025-03-03 10:33:47,261 INFO L226 Difference]: Without dead ends: 22983 [2025-03-03 10:33:47,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:47,272 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 262 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:47,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 90 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:33:47,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22983 states. [2025-03-03 10:33:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22983 to 22429. [2025-03-03 10:33:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22429 states, 22428 states have (on average 1.1685393258426966) internal successors, (26208), 22428 states have internal predecessors, (26208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22429 states to 22429 states and 26208 transitions. [2025-03-03 10:33:47,473 INFO L78 Accepts]: Start accepts. Automaton has 22429 states and 26208 transitions. Word has length 270 [2025-03-03 10:33:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:47,473 INFO L471 AbstractCegarLoop]: Abstraction has 22429 states and 26208 transitions. [2025-03-03 10:33:47,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 22429 states and 26208 transitions. [2025-03-03 10:33:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-03 10:33:47,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:47,479 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:47,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:33:47,480 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:47,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:47,480 INFO L85 PathProgramCache]: Analyzing trace with hash -420282327, now seen corresponding path program 1 times [2025-03-03 10:33:47,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:47,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027986955] [2025-03-03 10:33:47,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:47,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:47,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-03 10:33:47,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-03 10:33:47,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:47,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 10:33:47,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:47,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027986955] [2025-03-03 10:33:47,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027986955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:47,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:47,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:47,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940781831] [2025-03-03 10:33:47,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:47,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:47,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:47,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:47,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:47,581 INFO L87 Difference]: Start difference. First operand 22429 states and 26208 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:48,185 INFO L93 Difference]: Finished difference Result 41663 states and 48774 transitions. [2025-03-03 10:33:48,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:48,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 284 [2025-03-03 10:33:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:48,208 INFO L225 Difference]: With dead ends: 41663 [2025-03-03 10:33:48,208 INFO L226 Difference]: Without dead ends: 18129 [2025-03-03 10:33:48,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:48,222 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 163 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:48,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 149 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:33:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18129 states. [2025-03-03 10:33:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18129 to 17389. [2025-03-03 10:33:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17389 states, 17388 states have (on average 1.1192776627559236) internal successors, (19462), 17388 states have internal predecessors, (19462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17389 states to 17389 states and 19462 transitions. [2025-03-03 10:33:48,371 INFO L78 Accepts]: Start accepts. Automaton has 17389 states and 19462 transitions. Word has length 284 [2025-03-03 10:33:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:48,371 INFO L471 AbstractCegarLoop]: Abstraction has 17389 states and 19462 transitions. [2025-03-03 10:33:48,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 17389 states and 19462 transitions. [2025-03-03 10:33:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-03 10:33:48,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:48,377 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:48,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:33:48,377 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:48,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash -305809576, now seen corresponding path program 1 times [2025-03-03 10:33:48,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:48,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519496420] [2025-03-03 10:33:48,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:48,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:48,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 10:33:48,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 10:33:48,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:48,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:33:48,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:48,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519496420] [2025-03-03 10:33:48,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519496420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:48,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:48,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:48,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837262192] [2025-03-03 10:33:48,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:48,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:48,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:48,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:48,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:48,481 INFO L87 Difference]: Start difference. First operand 17389 states and 19462 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 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 10:33:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:49,078 INFO L93 Difference]: Finished difference Result 37352 states and 41901 transitions. [2025-03-03 10:33:49,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:49,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 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 301 [2025-03-03 10:33:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:49,097 INFO L225 Difference]: With dead ends: 37352 [2025-03-03 10:33:49,098 INFO L226 Difference]: Without dead ends: 20333 [2025-03-03 10:33:49,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:49,110 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 177 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:49,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 150 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:33:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20333 states. [2025-03-03 10:33:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20333 to 20148. [2025-03-03 10:33:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20148 states, 20147 states have (on average 1.1009083238199235) internal successors, (22180), 20147 states have internal predecessors, (22180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20148 states to 20148 states and 22180 transitions. [2025-03-03 10:33:49,276 INFO L78 Accepts]: Start accepts. Automaton has 20148 states and 22180 transitions. Word has length 301 [2025-03-03 10:33:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:49,276 INFO L471 AbstractCegarLoop]: Abstraction has 20148 states and 22180 transitions. [2025-03-03 10:33:49,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 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 10:33:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 20148 states and 22180 transitions. [2025-03-03 10:33:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-03 10:33:49,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:49,282 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:49,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:33:49,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:49,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:49,282 INFO L85 PathProgramCache]: Analyzing trace with hash -797912152, now seen corresponding path program 1 times [2025-03-03 10:33:49,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:49,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486925987] [2025-03-03 10:33:49,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:49,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:49,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 10:33:49,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 10:33:49,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:49,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-03 10:33:49,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:49,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486925987] [2025-03-03 10:33:49,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486925987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:49,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:49,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:49,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773492445] [2025-03-03 10:33:49,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:49,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:49,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:49,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:49,415 INFO L87 Difference]: Start difference. First operand 20148 states and 22180 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:49,960 INFO L93 Difference]: Finished difference Result 40473 states and 44630 transitions. [2025-03-03 10:33:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:49,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 301 [2025-03-03 10:33:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:49,982 INFO L225 Difference]: With dead ends: 40473 [2025-03-03 10:33:49,982 INFO L226 Difference]: Without dead ends: 22723 [2025-03-03 10:33:49,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:49,996 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 193 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:49,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 139 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22723 states. [2025-03-03 10:33:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22723 to 15907. [2025-03-03 10:33:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15907 states, 15906 states have (on average 1.1015968816798691) internal successors, (17522), 15906 states have internal predecessors, (17522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15907 states to 15907 states and 17522 transitions. [2025-03-03 10:33:50,219 INFO L78 Accepts]: Start accepts. Automaton has 15907 states and 17522 transitions. Word has length 301 [2025-03-03 10:33:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:50,220 INFO L471 AbstractCegarLoop]: Abstraction has 15907 states and 17522 transitions. [2025-03-03 10:33:50,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 15907 states and 17522 transitions. [2025-03-03 10:33:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-03 10:33:50,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:50,226 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:50,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:33:50,226 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:50,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:50,227 INFO L85 PathProgramCache]: Analyzing trace with hash 531321905, now seen corresponding path program 1 times [2025-03-03 10:33:50,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:50,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017748801] [2025-03-03 10:33:50,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:50,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:50,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-03 10:33:50,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-03 10:33:50,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:50,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:33:50,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:50,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017748801] [2025-03-03 10:33:50,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017748801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:50,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:50,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:33:50,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382610307] [2025-03-03 10:33:50,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:50,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:50,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:50,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:50,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:50,353 INFO L87 Difference]: Start difference. First operand 15907 states and 17522 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:50,685 INFO L93 Difference]: Finished difference Result 30696 states and 33815 transitions. [2025-03-03 10:33:50,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:50,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 308 [2025-03-03 10:33:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:50,700 INFO L225 Difference]: With dead ends: 30696 [2025-03-03 10:33:50,700 INFO L226 Difference]: Without dead ends: 15159 [2025-03-03 10:33:50,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:50,712 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:50,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 35 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:33:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15159 states. [2025-03-03 10:33:50,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15159 to 15157. [2025-03-03 10:33:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15157 states, 15156 states have (on average 1.0995645288994458) internal successors, (16665), 15156 states have internal predecessors, (16665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15157 states to 15157 states and 16665 transitions. [2025-03-03 10:33:50,875 INFO L78 Accepts]: Start accepts. Automaton has 15157 states and 16665 transitions. Word has length 308 [2025-03-03 10:33:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:50,875 INFO L471 AbstractCegarLoop]: Abstraction has 15157 states and 16665 transitions. [2025-03-03 10:33:50,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 15157 states and 16665 transitions. [2025-03-03 10:33:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-03 10:33:50,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:50,880 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:50,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:33:50,880 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:50,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:50,881 INFO L85 PathProgramCache]: Analyzing trace with hash 961026923, now seen corresponding path program 1 times [2025-03-03 10:33:50,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:50,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541247845] [2025-03-03 10:33:50,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:50,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:50,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-03 10:33:50,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-03 10:33:50,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:50,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-03 10:33:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:51,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541247845] [2025-03-03 10:33:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541247845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:51,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:51,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:51,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036351625] [2025-03-03 10:33:51,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:51,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:51,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:51,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:51,039 INFO L87 Difference]: Start difference. First operand 15157 states and 16665 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:51,550 INFO L93 Difference]: Finished difference Result 33630 states and 37051 transitions. [2025-03-03 10:33:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:51,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 330 [2025-03-03 10:33:51,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:51,568 INFO L225 Difference]: With dead ends: 33630 [2025-03-03 10:33:51,568 INFO L226 Difference]: Without dead ends: 18843 [2025-03-03 10:33:51,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:51,579 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 179 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:51,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 341 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18843 states. [2025-03-03 10:33:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18843 to 16264. [2025-03-03 10:33:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16264 states, 16263 states have (on average 1.0927873086146467) internal successors, (17772), 16263 states have internal predecessors, (17772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 17772 transitions. [2025-03-03 10:33:51,768 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 17772 transitions. Word has length 330 [2025-03-03 10:33:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:51,768 INFO L471 AbstractCegarLoop]: Abstraction has 16264 states and 17772 transitions. [2025-03-03 10:33:51,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 17772 transitions. [2025-03-03 10:33:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-03-03 10:33:51,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:51,773 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:51,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:33:51,774 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:51,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:51,774 INFO L85 PathProgramCache]: Analyzing trace with hash -502352420, now seen corresponding path program 1 times [2025-03-03 10:33:51,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:51,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617544811] [2025-03-03 10:33:51,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:51,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:51,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-03 10:33:51,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-03 10:33:51,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:51,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 10:33:51,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617544811] [2025-03-03 10:33:51,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617544811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:51,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:51,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128352194] [2025-03-03 10:33:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:51,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:51,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:51,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:51,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:51,871 INFO L87 Difference]: Start difference. First operand 16264 states and 17772 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:52,362 INFO L93 Difference]: Finished difference Result 33444 states and 36541 transitions. [2025-03-03 10:33:52,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:52,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 337 [2025-03-03 10:33:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:52,363 INFO L225 Difference]: With dead ends: 33444 [2025-03-03 10:33:52,363 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:33:52,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:52,375 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 187 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:52,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 300 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:33:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:33:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:33:52,375 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 337 [2025-03-03 10:33:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:52,376 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:33:52,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:33:52,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:33:52,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:33:52,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:33:52,381 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:52,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:33:54,354 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:33:54,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:33:54 BoogieIcfgContainer [2025-03-03 10:33:54,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:33:54,370 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:33:54,370 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:33:54,370 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:33:54,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:33:34" (3/4) ... [2025-03-03 10:33:54,372 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:33:54,389 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:33:54,391 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:33:54,392 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:33:54,393 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:33:54,520 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:33:54,521 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:33:54,521 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:33:54,521 INFO L158 Benchmark]: Toolchain (without parser) took 22089.39ms. Allocated memory was 142.6MB in the beginning and 771.8MB in the end (delta: 629.1MB). Free memory was 108.5MB in the beginning and 334.6MB in the end (delta: -226.1MB). Peak memory consumption was 405.5MB. Max. memory is 16.1GB. [2025-03-03 10:33:54,522 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:33:54,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.60ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 65.5MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 10:33:54,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.94ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 48.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:33:54,522 INFO L158 Benchmark]: Boogie Preprocessor took 145.14ms. Allocated memory is still 142.6MB. Free memory was 48.7MB in the beginning and 86.8MB in the end (delta: -38.1MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2025-03-03 10:33:54,522 INFO L158 Benchmark]: IcfgBuilder took 1399.72ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 86.8MB in the beginning and 208.4MB in the end (delta: -121.6MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. [2025-03-03 10:33:54,523 INFO L158 Benchmark]: TraceAbstraction took 19759.78ms. Allocated memory was 369.1MB in the beginning and 771.8MB in the end (delta: 402.7MB). Free memory was 207.5MB in the beginning and 351.1MB in the end (delta: -143.6MB). Peak memory consumption was 400.5MB. Max. memory is 16.1GB. [2025-03-03 10:33:54,523 INFO L158 Benchmark]: Witness Printer took 151.16ms. Allocated memory is still 771.8MB. Free memory was 347.1MB in the beginning and 334.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:33:54,524 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.60ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 65.5MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.94ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 48.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 145.14ms. Allocated memory is still 142.6MB. Free memory was 48.7MB in the beginning and 86.8MB in the end (delta: -38.1MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1399.72ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 86.8MB in the beginning and 208.4MB in the end (delta: -121.6MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19759.78ms. Allocated memory was 369.1MB in the beginning and 771.8MB in the end (delta: 402.7MB). Free memory was 207.5MB in the beginning and 351.1MB in the end (delta: -143.6MB). Peak memory consumption was 400.5MB. Max. memory is 16.1GB. * Witness Printer took 151.16ms. Allocated memory is still 771.8MB. Free memory was 347.1MB in the beginning and 334.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 94]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.7s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3688 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3688 mSDsluCounter, 3975 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 452 mSDsCounter, 1900 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11277 IncrementalHoareTripleChecker+Invalid, 13177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1900 mSolverCounterUnsat, 3523 mSDtfsCounter, 11277 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22429occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 12651 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 4102 NumberOfCodeBlocks, 4102 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4084 ConstructedInterpolants, 0 QuantifiedInterpolants, 7783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 2709/2709 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((a29 <= 140) && (a4 == 0)) && (a25 <= 10)) && (a23 <= 138)) && (a8 == 15)) || ((((a4 == 0) && (a25 == 11)) && (a8 == 15)) && (a23 <= 137))) || (((a25 == 13) && (a4 == 1)) && (a8 == 15))) || ((((a4 == 0) && (a8 == 15)) && (a25 == 10)) && (a23 <= 137))) || ((((a25 == 11) && (a4 == 1)) && (a23 <= 137)) && (130 <= a29))) || ((((a25 == 11) && (a4 == 1)) && (a8 == 15)) && (130 <= a29))) || ((((a25 == 12) && (a4 == 1)) && (a23 <= 137)) && (a29 <= 130))) || (((a4 == 1) && (a25 == 10)) && (a23 <= 137))) || ((((a25 <= 10) && (a23 <= 138)) && (a4 == 1)) && (a8 == 15))) || ((((a4 == 0) && (a8 == 15)) && (a25 == 10)) && (a29 <= 130))) || (((((a4 == 0) && (a25 == 11)) && (a23 <= 138)) && (a8 == 15)) && (247 <= a29))) || ((((a25 == 13) && (a4 == 0)) && (a8 == 15)) && (a23 <= 137))) || ((((a25 == 12) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((262 <= a29) && (a4 == 0)) && (a25 <= 10)) && (a8 == 15)) && (a23 <= 137))) || (((a4 == 1) && (a8 == 15)) && (a25 == 10))) || (((((307 <= a23) && (a25 <= 10)) && (a4 == 1)) && (a8 == 15)) && (130 <= a29))) || ((((a25 == 11) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((a25 == 12) && (a4 == 0)) && (a8 == 15))) || ((((a29 <= 140) && (a4 == 1)) && ((((a25 <= 10) && (a3 == 1)) && (a25 != 9)) || ((a25 == 12) && (a3 == 1)))) && (a8 == 15))) || (((((a29 <= 140) && (a25 <= 10)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((a25 <= 10) && (a4 == 1)) && (a8 == 15)) && (247 <= a29))) || (((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) && (a23 <= 138)) && (a8 == 15))) || ((((a25 == 12) && (a4 == 1)) && (a8 == 15)) && (130 <= a29))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:33:54,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE