./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label38.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 d6ab095cb4c47e2e0ab83610e7dceb2c658ebc8f7a2b4be1c26690c64da4af60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:11:08,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:11:08,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:11:08,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:11:08,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:11:08,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:11:08,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:11:08,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:11:08,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:11:08,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:11:08,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:11:08,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:11:08,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:11:08,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:11:08,891 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:11:08,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:11:08,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:11:08,891 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:11:08,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:11:08,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:11:08,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:11:08,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:11:08,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:11:08,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:11:08,892 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:11:08,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:11:08,892 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:11:08,892 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:11:08,892 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:11:08,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:11:08,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:11:08,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:11:08,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:11:08,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:11:08,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:11:08,893 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:11:08,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:11:08,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:11:08,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:11:08,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:11:08,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:11:08,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:11:08,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:11:08,894 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 -> d6ab095cb4c47e2e0ab83610e7dceb2c658ebc8f7a2b4be1c26690c64da4af60 [2025-03-16 14:11:09,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:11:09,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:11:09,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:11:09,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:11:09,152 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:11:09,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label38.c [2025-03-16 14:11:10,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/487b77800/8c192aeb4c334e20a42fb88e57e43fc7/FLAGa0d005f59 [2025-03-16 14:11:10,613 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:11:10,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label38.c [2025-03-16 14:11:10,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/487b77800/8c192aeb4c334e20a42fb88e57e43fc7/FLAGa0d005f59 [2025-03-16 14:11:10,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/487b77800/8c192aeb4c334e20a42fb88e57e43fc7 [2025-03-16 14:11:10,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:11:10,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:11:10,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:11:10,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:11:10,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:11:10,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:10" (1/1) ... [2025-03-16 14:11:10,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b94d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:10, skipping insertion in model container [2025-03-16 14:11:10,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:10" (1/1) ... [2025-03-16 14:11:10,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:11:11,270 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label38.c[61364,61377] [2025-03-16 14:11:11,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:11:11,298 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:11:11,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label38.c[61364,61377] [2025-03-16 14:11:11,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:11:11,447 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:11:11,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11 WrapperNode [2025-03-16 14:11:11,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:11:11,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:11:11,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:11:11,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:11:11,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (1/1) ... [2025-03-16 14:11:11,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (1/1) ... [2025-03-16 14:11:11,564 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-16 14:11:11,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:11:11,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:11:11,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:11:11,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:11:11,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (1/1) ... [2025-03-16 14:11:11,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (1/1) ... [2025-03-16 14:11:11,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (1/1) ... [2025-03-16 14:11:11,622 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-16 14:11:11,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (1/1) ... [2025-03-16 14:11:11,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (1/1) ... [2025-03-16 14:11:11,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (1/1) ... [2025-03-16 14:11:11,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (1/1) ... [2025-03-16 14:11:11,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (1/1) ... [2025-03-16 14:11:11,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (1/1) ... [2025-03-16 14:11:11,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:11:11,710 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:11:11,711 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:11:11,711 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:11:11,711 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (1/1) ... [2025-03-16 14:11:11,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:11:11,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:11,736 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-16 14:11:11,741 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-16 14:11:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:11:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:11:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:11:11,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:11:11,814 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:11:11,816 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:11:13,075 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-16 14:11:13,076 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:11:13,088 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:11:13,090 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:11:13,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:13 BoogieIcfgContainer [2025-03-16 14:11:13,091 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:11:13,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:11:13,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:11:13,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:11:13,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:11:10" (1/3) ... [2025-03-16 14:11:13,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37af4bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:11:13, skipping insertion in model container [2025-03-16 14:11:13,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:11" (2/3) ... [2025-03-16 14:11:13,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37af4bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:11:13, skipping insertion in model container [2025-03-16 14:11:13,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:13" (3/3) ... [2025-03-16 14:11:13,099 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label38.c [2025-03-16 14:11:13,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:11:13,115 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label38.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:11:13,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:11:13,165 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;@684ff964, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:11:13,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:11:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:13,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 14:11:13,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:13,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:13,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:13,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash -950021346, now seen corresponding path program 1 times [2025-03-16 14:11:13,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:13,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165237497] [2025-03-16 14:11:13,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:13,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:13,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 14:11:13,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 14:11:13,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:13,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:13,675 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-16 14:11:13,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:13,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165237497] [2025-03-16 14:11:13,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165237497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:13,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:13,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530896372] [2025-03-16 14:11:13,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:13,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:11:13,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:13,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:11:13,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:11:13,702 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 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 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:13,733 INFO L93 Difference]: Finished difference Result 481 states and 913 transitions. [2025-03-16 14:11:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:11:13,735 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-03-16 14:11:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:13,742 INFO L225 Difference]: With dead ends: 481 [2025-03-16 14:11:13,742 INFO L226 Difference]: Without dead ends: 238 [2025-03-16 14:11:13,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:11:13,747 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:13,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:11:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-16 14:11:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-16 14:11:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2025-03-16 14:11:13,780 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 200 [2025-03-16 14:11:13,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:13,781 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2025-03-16 14:11:13,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2025-03-16 14:11:13,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 14:11:13,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:13,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:13,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:11:13,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:13,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash 341832543, now seen corresponding path program 1 times [2025-03-16 14:11:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:13,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297299091] [2025-03-16 14:11:13,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:13,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:13,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 14:11:13,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 14:11:13,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:13,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:14,284 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-16 14:11:14,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:14,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297299091] [2025-03-16 14:11:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297299091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:14,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:14,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:14,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355085892] [2025-03-16 14:11:14,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:14,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:14,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:14,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:14,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:14,291 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:15,061 INFO L93 Difference]: Finished difference Result 696 states and 1149 transitions. [2025-03-16 14:11:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:15,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-03-16 14:11:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:15,066 INFO L225 Difference]: With dead ends: 696 [2025-03-16 14:11:15,068 INFO L226 Difference]: Without dead ends: 459 [2025-03-16 14:11:15,069 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-16 14:11:15,071 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 63 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:15,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 137 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-16 14:11:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 458. [2025-03-16 14:11:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.5514223194748358) internal successors, (709), 457 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 709 transitions. [2025-03-16 14:11:15,101 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 709 transitions. Word has length 200 [2025-03-16 14:11:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:15,102 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 709 transitions. [2025-03-16 14:11:15,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 709 transitions. [2025-03-16 14:11:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 14:11:15,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:15,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:15,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:11:15,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:15,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1593131293, now seen corresponding path program 1 times [2025-03-16 14:11:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:15,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112672491] [2025-03-16 14:11:15,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:15,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 14:11:15,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 14:11:15,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:15,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:15,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:15,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:15,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112672491] [2025-03-16 14:11:15,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112672491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:15,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:15,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:15,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615998307] [2025-03-16 14:11:15,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:15,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:15,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:15,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:15,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:15,409 INFO L87 Difference]: Start difference. First operand 458 states and 709 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:15,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:15,647 INFO L93 Difference]: Finished difference Result 1371 states and 2124 transitions. [2025-03-16 14:11:15,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:15,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-03-16 14:11:15,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:15,651 INFO L225 Difference]: With dead ends: 1371 [2025-03-16 14:11:15,651 INFO L226 Difference]: Without dead ends: 914 [2025-03-16 14:11:15,653 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-16 14:11:15,656 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:15,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 595 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:11:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-16 14:11:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 912. [2025-03-16 14:11:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 1.5466520307354557) internal successors, (1409), 911 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1409 transitions. [2025-03-16 14:11:15,694 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1409 transitions. Word has length 205 [2025-03-16 14:11:15,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:15,694 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1409 transitions. [2025-03-16 14:11:15,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1409 transitions. [2025-03-16 14:11:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 14:11:15,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:15,698 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:15,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:11:15,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:15,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:15,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1481316595, now seen corresponding path program 1 times [2025-03-16 14:11:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:15,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607680042] [2025-03-16 14:11:15,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:15,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:15,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 14:11:15,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 14:11:15,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:15,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:15,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:15,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607680042] [2025-03-16 14:11:15,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607680042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:15,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:15,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469038443] [2025-03-16 14:11:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:15,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:15,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:15,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:15,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:15,841 INFO L87 Difference]: Start difference. First operand 912 states and 1409 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:16,516 INFO L93 Difference]: Finished difference Result 2684 states and 4170 transitions. [2025-03-16 14:11:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:16,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 14:11:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:16,522 INFO L225 Difference]: With dead ends: 2684 [2025-03-16 14:11:16,523 INFO L226 Difference]: Without dead ends: 1773 [2025-03-16 14:11:16,524 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-16 14:11:16,525 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 236 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:16,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 153 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-03-16 14:11:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1737. [2025-03-16 14:11:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1736 states have (on average 1.5138248847926268) internal successors, (2628), 1736 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2628 transitions. [2025-03-16 14:11:16,569 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2628 transitions. Word has length 208 [2025-03-16 14:11:16,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:16,569 INFO L471 AbstractCegarLoop]: Abstraction has 1737 states and 2628 transitions. [2025-03-16 14:11:16,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:16,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2628 transitions. [2025-03-16 14:11:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-16 14:11:16,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:16,576 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:16,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:11:16,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:16,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:16,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1635792060, now seen corresponding path program 1 times [2025-03-16 14:11:16,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:16,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119790088] [2025-03-16 14:11:16,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:16,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:16,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-16 14:11:16,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-16 14:11:16,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:16,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:16,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:16,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119790088] [2025-03-16 14:11:16,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119790088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:16,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:16,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:16,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028806826] [2025-03-16 14:11:16,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:16,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:16,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:16,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:16,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:16,725 INFO L87 Difference]: Start difference. First operand 1737 states and 2628 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:17,048 INFO L93 Difference]: Finished difference Result 5177 states and 7842 transitions. [2025-03-16 14:11:17,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:17,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2025-03-16 14:11:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:17,060 INFO L225 Difference]: With dead ends: 5177 [2025-03-16 14:11:17,061 INFO L226 Difference]: Without dead ends: 3441 [2025-03-16 14:11:17,064 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-16 14:11:17,065 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 349 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:17,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 512 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:11:17,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2025-03-16 14:11:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3437. [2025-03-16 14:11:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3437 states, 3436 states have (on average 1.5075669383003492) internal successors, (5180), 3436 states have internal predecessors, (5180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 5180 transitions. [2025-03-16 14:11:17,131 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 5180 transitions. Word has length 214 [2025-03-16 14:11:17,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:17,131 INFO L471 AbstractCegarLoop]: Abstraction has 3437 states and 5180 transitions. [2025-03-16 14:11:17,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 5180 transitions. [2025-03-16 14:11:17,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-16 14:11:17,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:17,137 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:17,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:11:17,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:17,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:17,137 INFO L85 PathProgramCache]: Analyzing trace with hash -557778070, now seen corresponding path program 1 times [2025-03-16 14:11:17,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:17,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546494834] [2025-03-16 14:11:17,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:17,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-16 14:11:17,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-16 14:11:17,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:17,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 14:11:17,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:17,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546494834] [2025-03-16 14:11:17,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546494834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:17,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:17,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:17,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795540316] [2025-03-16 14:11:17,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:17,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:17,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:17,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:17,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:17,408 INFO L87 Difference]: Start difference. First operand 3437 states and 5180 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:18,128 INFO L93 Difference]: Finished difference Result 8538 states and 12820 transitions. [2025-03-16 14:11:18,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:18,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2025-03-16 14:11:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:18,143 INFO L225 Difference]: With dead ends: 8538 [2025-03-16 14:11:18,144 INFO L226 Difference]: Without dead ends: 5102 [2025-03-16 14:11:18,147 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-16 14:11:18,148 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 234 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:18,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 113 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2025-03-16 14:11:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 5098. [2025-03-16 14:11:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5098 states, 5097 states have (on average 1.4732195409064155) internal successors, (7509), 5097 states have internal predecessors, (7509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5098 states to 5098 states and 7509 transitions. [2025-03-16 14:11:18,230 INFO L78 Accepts]: Start accepts. Automaton has 5098 states and 7509 transitions. Word has length 215 [2025-03-16 14:11:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:18,230 INFO L471 AbstractCegarLoop]: Abstraction has 5098 states and 7509 transitions. [2025-03-16 14:11:18,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5098 states and 7509 transitions. [2025-03-16 14:11:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-16 14:11:18,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:18,238 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:18,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:11:18,238 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:18,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:18,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1111393465, now seen corresponding path program 1 times [2025-03-16 14:11:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298179813] [2025-03-16 14:11:18,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:18,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:18,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-16 14:11:18,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-16 14:11:18,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:18,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 14:11:18,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:18,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298179813] [2025-03-16 14:11:18,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298179813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:18,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:18,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:18,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256154035] [2025-03-16 14:11:18,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:18,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:18,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:18,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:18,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:18,354 INFO L87 Difference]: Start difference. First operand 5098 states and 7509 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:18,637 INFO L93 Difference]: Finished difference Result 15192 states and 22393 transitions. [2025-03-16 14:11:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:18,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2025-03-16 14:11:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:18,670 INFO L225 Difference]: With dead ends: 15192 [2025-03-16 14:11:18,670 INFO L226 Difference]: Without dead ends: 10095 [2025-03-16 14:11:18,678 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-16 14:11:18,680 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 358 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:18,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 584 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:11:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10095 states. [2025-03-16 14:11:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10095 to 10089. [2025-03-16 14:11:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10089 states, 10088 states have (on average 1.4734337827121333) internal successors, (14864), 10088 states have internal predecessors, (14864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10089 states to 10089 states and 14864 transitions. [2025-03-16 14:11:18,866 INFO L78 Accepts]: Start accepts. Automaton has 10089 states and 14864 transitions. Word has length 222 [2025-03-16 14:11:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:18,866 INFO L471 AbstractCegarLoop]: Abstraction has 10089 states and 14864 transitions. [2025-03-16 14:11:18,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 10089 states and 14864 transitions. [2025-03-16 14:11:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-16 14:11:18,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:18,879 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:18,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:11:18,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:18,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash -21102191, now seen corresponding path program 1 times [2025-03-16 14:11:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663051733] [2025-03-16 14:11:18,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:18,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:18,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-16 14:11:18,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-16 14:11:18,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:18,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:19,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:19,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663051733] [2025-03-16 14:11:19,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663051733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:19,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034803259] [2025-03-16 14:11:19,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:19,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:19,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:19,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:19,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:11:19,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-16 14:11:19,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-16 14:11:19,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:19,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:19,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:19,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:19,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:19,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034803259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:19,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:19,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:11:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372619638] [2025-03-16 14:11:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:19,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:19,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:19,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:19,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:19,274 INFO L87 Difference]: Start difference. First operand 10089 states and 14864 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-16 14:11:20,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:20,106 INFO L93 Difference]: Finished difference Result 29937 states and 44139 transitions. [2025-03-16 14:11:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:20,106 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 222 [2025-03-16 14:11:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:20,160 INFO L225 Difference]: With dead ends: 29937 [2025-03-16 14:11:20,160 INFO L226 Difference]: Without dead ends: 19849 [2025-03-16 14:11:20,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:20,178 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 223 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:20,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 427 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19849 states. [2025-03-16 14:11:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19849 to 19833. [2025-03-16 14:11:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19833 states, 19832 states have (on average 1.3025413473174667) internal successors, (25832), 19832 states have internal predecessors, (25832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19833 states to 19833 states and 25832 transitions. [2025-03-16 14:11:20,599 INFO L78 Accepts]: Start accepts. Automaton has 19833 states and 25832 transitions. Word has length 222 [2025-03-16 14:11:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:20,599 INFO L471 AbstractCegarLoop]: Abstraction has 19833 states and 25832 transitions. [2025-03-16 14:11:20,599 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-16 14:11:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 19833 states and 25832 transitions. [2025-03-16 14:11:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-16 14:11:20,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:20,617 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:20,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:11:20,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:20,818 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:20,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash -437724309, now seen corresponding path program 1 times [2025-03-16 14:11:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:20,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402632621] [2025-03-16 14:11:20,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:20,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-16 14:11:20,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-16 14:11:20,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:20,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 14:11:20,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:20,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402632621] [2025-03-16 14:11:20,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402632621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:20,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:20,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:20,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412179477] [2025-03-16 14:11:20,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:20,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:20,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:20,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:20,947 INFO L87 Difference]: Start difference. First operand 19833 states and 25832 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:21,755 INFO L93 Difference]: Finished difference Result 59227 states and 77123 transitions. [2025-03-16 14:11:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:21,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 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 222 [2025-03-16 14:11:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:21,823 INFO L225 Difference]: With dead ends: 59227 [2025-03-16 14:11:21,823 INFO L226 Difference]: Without dead ends: 39395 [2025-03-16 14:11:21,851 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-16 14:11:21,852 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 239 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:21,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 161 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39395 states. [2025-03-16 14:11:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39395 to 39379. [2025-03-16 14:11:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39379 states, 39378 states have (on average 1.2545075930722738) internal successors, (49400), 39378 states have internal predecessors, (49400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39379 states to 39379 states and 49400 transitions. [2025-03-16 14:11:22,502 INFO L78 Accepts]: Start accepts. Automaton has 39379 states and 49400 transitions. Word has length 222 [2025-03-16 14:11:22,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:22,503 INFO L471 AbstractCegarLoop]: Abstraction has 39379 states and 49400 transitions. [2025-03-16 14:11:22,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 39379 states and 49400 transitions. [2025-03-16 14:11:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-16 14:11:22,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:22,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:22,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:11:22,543 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:22,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:22,543 INFO L85 PathProgramCache]: Analyzing trace with hash -809012423, now seen corresponding path program 1 times [2025-03-16 14:11:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:22,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123832927] [2025-03-16 14:11:22,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:22,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-16 14:11:22,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-16 14:11:22,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:22,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:22,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:22,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123832927] [2025-03-16 14:11:22,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123832927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:22,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620912127] [2025-03-16 14:11:22,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:22,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:22,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:22,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:22,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:11:23,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-16 14:11:23,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-16 14:11:23,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:23,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:23,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:11:23,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:23,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:23,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620912127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:23,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:23,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:11:23,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653792800] [2025-03-16 14:11:23,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:23,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:23,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:23,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:23,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:23,268 INFO L87 Difference]: Start difference. First operand 39379 states and 49400 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:24,173 INFO L93 Difference]: Finished difference Result 112778 states and 141633 transitions. [2025-03-16 14:11:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:24,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2025-03-16 14:11:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:24,308 INFO L225 Difference]: With dead ends: 112778 [2025-03-16 14:11:24,308 INFO L226 Difference]: Without dead ends: 73400 [2025-03-16 14:11:24,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:24,353 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 48 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:24,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 403 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73400 states. [2025-03-16 14:11:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73400 to 73344. [2025-03-16 14:11:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73344 states, 73343 states have (on average 1.2222570661140122) internal successors, (89644), 73343 states have internal predecessors, (89644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:25,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73344 states to 73344 states and 89644 transitions. [2025-03-16 14:11:25,427 INFO L78 Accepts]: Start accepts. Automaton has 73344 states and 89644 transitions. Word has length 248 [2025-03-16 14:11:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:25,427 INFO L471 AbstractCegarLoop]: Abstraction has 73344 states and 89644 transitions. [2025-03-16 14:11:25,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 73344 states and 89644 transitions. [2025-03-16 14:11:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-16 14:11:25,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:25,487 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:25,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:11:25,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 14:11:25,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:25,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2036032864, now seen corresponding path program 1 times [2025-03-16 14:11:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:25,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482198739] [2025-03-16 14:11:25,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:25,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:25,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 14:11:25,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 14:11:25,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:25,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 14:11:26,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:26,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482198739] [2025-03-16 14:11:26,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482198739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:26,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406703959] [2025-03-16 14:11:26,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:26,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:26,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:26,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:26,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:11:26,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 14:11:26,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 14:11:26,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:26,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:26,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:26,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 14:11:26,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:26,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406703959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:26,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:26,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:11:26,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034841670] [2025-03-16 14:11:26,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:26,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:26,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:26,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:26,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:26,990 INFO L87 Difference]: Start difference. First operand 73344 states and 89644 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:28,166 INFO L93 Difference]: Finished difference Result 175935 states and 218999 transitions. [2025-03-16 14:11:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:28,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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-16 14:11:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:28,345 INFO L225 Difference]: With dead ends: 175935 [2025-03-16 14:11:28,345 INFO L226 Difference]: Without dead ends: 102592 [2025-03-16 14:11:28,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:28,370 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 52 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:28,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 396 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2025-03-16 14:11:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102576. [2025-03-16 14:11:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102576 states, 102575 states have (on average 1.2452449427248355) internal successors, (127731), 102575 states have internal predecessors, (127731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102576 states to 102576 states and 127731 transitions. [2025-03-16 14:11:29,584 INFO L78 Accepts]: Start accepts. Automaton has 102576 states and 127731 transitions. Word has length 258 [2025-03-16 14:11:29,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:29,584 INFO L471 AbstractCegarLoop]: Abstraction has 102576 states and 127731 transitions. [2025-03-16 14:11:29,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 102576 states and 127731 transitions. [2025-03-16 14:11:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-16 14:11:29,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:29,628 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:29,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 14:11:29,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:29,829 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:29,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:29,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1146907352, now seen corresponding path program 1 times [2025-03-16 14:11:29,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:29,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582629983] [2025-03-16 14:11:29,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:29,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:29,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 14:11:29,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 14:11:29,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:29,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 14:11:30,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:30,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582629983] [2025-03-16 14:11:30,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582629983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:30,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535982840] [2025-03-16 14:11:30,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:30,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:30,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:30,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:30,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:11:30,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 14:11:30,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 14:11:30,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:30,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:30,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:30,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:30,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:30,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535982840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:30,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:30,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:11:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341712263] [2025-03-16 14:11:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:30,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:30,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:30,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:30,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:30,470 INFO L87 Difference]: Start difference. First operand 102576 states and 127731 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:31,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:31,680 INFO L93 Difference]: Finished difference Result 205165 states and 255485 transitions. [2025-03-16 14:11:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:31,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 267 [2025-03-16 14:11:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:31,821 INFO L225 Difference]: With dead ends: 205165 [2025-03-16 14:11:31,821 INFO L226 Difference]: Without dead ends: 102590 [2025-03-16 14:11:31,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:31,871 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 227 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:31,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 165 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102590 states. [2025-03-16 14:11:32,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102590 to 102574. [2025-03-16 14:11:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102574 states, 102573 states have (on average 1.1755822682382304) internal successors, (120583), 102573 states have internal predecessors, (120583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102574 states to 102574 states and 120583 transitions. [2025-03-16 14:11:33,074 INFO L78 Accepts]: Start accepts. Automaton has 102574 states and 120583 transitions. Word has length 267 [2025-03-16 14:11:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:33,074 INFO L471 AbstractCegarLoop]: Abstraction has 102574 states and 120583 transitions. [2025-03-16 14:11:33,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 102574 states and 120583 transitions. [2025-03-16 14:11:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-16 14:11:33,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:33,121 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:33,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 14:11:33,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:33,322 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:33,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:33,322 INFO L85 PathProgramCache]: Analyzing trace with hash -780268639, now seen corresponding path program 1 times [2025-03-16 14:11:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:33,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895270505] [2025-03-16 14:11:33,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:33,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:33,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-16 14:11:33,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-16 14:11:33,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:33,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-16 14:11:34,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:34,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895270505] [2025-03-16 14:11:34,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895270505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:34,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374171348] [2025-03-16 14:11:34,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:34,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:34,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:34,347 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:34,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:11:34,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-16 14:11:34,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-16 14:11:34,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:34,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:34,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:34,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 14:11:34,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:34,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374171348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:34,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:34,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:11:34,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491899247] [2025-03-16 14:11:34,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:34,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:34,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:34,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:34,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:34,516 INFO L87 Difference]: Start difference. First operand 102574 states and 120583 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:35,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:35,491 INFO L93 Difference]: Finished difference Result 294552 states and 346712 transitions. [2025-03-16 14:11:35,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:35,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 277 [2025-03-16 14:11:35,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:35,741 INFO L225 Difference]: With dead ends: 294552 [2025-03-16 14:11:35,741 INFO L226 Difference]: Without dead ends: 191979 [2025-03-16 14:11:35,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:35,791 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 308 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:35,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 874 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:11:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191979 states. [2025-03-16 14:11:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191979 to 188729. [2025-03-16 14:11:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188729 states, 188728 states have (on average 1.1598331991013522) internal successors, (218893), 188728 states have internal predecessors, (218893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188729 states to 188729 states and 218893 transitions. [2025-03-16 14:11:38,211 INFO L78 Accepts]: Start accepts. Automaton has 188729 states and 218893 transitions. Word has length 277 [2025-03-16 14:11:38,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:38,211 INFO L471 AbstractCegarLoop]: Abstraction has 188729 states and 218893 transitions. [2025-03-16 14:11:38,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 188729 states and 218893 transitions. [2025-03-16 14:11:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-16 14:11:38,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:38,288 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:38,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 14:11:38,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 14:11:38,489 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:38,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:38,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1628757909, now seen corresponding path program 1 times [2025-03-16 14:11:38,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:38,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795977301] [2025-03-16 14:11:38,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:38,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:38,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 14:11:38,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 14:11:38,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:38,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-16 14:11:39,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:39,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795977301] [2025-03-16 14:11:39,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795977301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:39,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832524208] [2025-03-16 14:11:39,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:39,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:39,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:39,482 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:39,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 14:11:39,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 14:11:39,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 14:11:39,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:39,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:39,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:39,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 14:11:39,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:39,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832524208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:39,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:39,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:11:39,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972964029] [2025-03-16 14:11:39,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:39,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:39,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:39,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:39,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:39,624 INFO L87 Difference]: Start difference. First operand 188729 states and 218893 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:40,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:40,869 INFO L93 Difference]: Finished difference Result 365884 states and 423989 transitions. [2025-03-16 14:11:40,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:40,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2025-03-16 14:11:40,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:41,087 INFO L225 Difference]: With dead ends: 365884 [2025-03-16 14:11:41,087 INFO L226 Difference]: Without dead ends: 177156 [2025-03-16 14:11:41,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:41,195 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:41,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 369 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177156 states. [2025-03-16 14:11:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177156 to 176955. [2025-03-16 14:11:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176955 states, 176954 states have (on average 1.1503045989353164) internal successors, (203551), 176954 states have internal predecessors, (203551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176955 states to 176955 states and 203551 transitions. [2025-03-16 14:11:43,716 INFO L78 Accepts]: Start accepts. Automaton has 176955 states and 203551 transitions. Word has length 281 [2025-03-16 14:11:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:43,716 INFO L471 AbstractCegarLoop]: Abstraction has 176955 states and 203551 transitions. [2025-03-16 14:11:43,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 176955 states and 203551 transitions. [2025-03-16 14:11:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-16 14:11:43,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:43,777 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:43,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 14:11:43,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:43,977 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:43,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:43,978 INFO L85 PathProgramCache]: Analyzing trace with hash 445601784, now seen corresponding path program 1 times [2025-03-16 14:11:43,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:43,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665797517] [2025-03-16 14:11:43,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:43,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:44,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-16 14:11:44,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-16 14:11:44,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:44,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 97 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-16 14:11:44,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665797517] [2025-03-16 14:11:44,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665797517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145369868] [2025-03-16 14:11:44,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:44,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:44,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:44,940 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:44,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 14:11:44,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-16 14:11:45,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-16 14:11:45,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:45,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:45,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:11:45,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-16 14:11:45,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:45,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145369868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:45,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:45,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:11:45,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937754697] [2025-03-16 14:11:45,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:45,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:45,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:45,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:45,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:45,100 INFO L87 Difference]: Start difference. First operand 176955 states and 203551 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:46,494 INFO L93 Difference]: Finished difference Result 395320 states and 456590 transitions. [2025-03-16 14:11:46,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:46,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 283 [2025-03-16 14:11:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:46,802 INFO L225 Difference]: With dead ends: 395320 [2025-03-16 14:11:46,802 INFO L226 Difference]: Without dead ends: 218366 [2025-03-16 14:11:46,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:46,920 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 210 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:46,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 179 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218366 states. [2025-03-16 14:11:49,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218366 to 216692. [2025-03-16 14:11:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216692 states, 216691 states have (on average 1.140910328532334) internal successors, (247225), 216691 states have internal predecessors, (247225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216692 states to 216692 states and 247225 transitions. [2025-03-16 14:11:49,591 INFO L78 Accepts]: Start accepts. Automaton has 216692 states and 247225 transitions. Word has length 283 [2025-03-16 14:11:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:49,591 INFO L471 AbstractCegarLoop]: Abstraction has 216692 states and 247225 transitions. [2025-03-16 14:11:49,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:49,591 INFO L276 IsEmpty]: Start isEmpty. Operand 216692 states and 247225 transitions. [2025-03-16 14:11:49,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 14:11:49,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:49,649 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:49,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 14:11:49,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:49,850 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:49,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash 725641538, now seen corresponding path program 1 times [2025-03-16 14:11:49,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450035886] [2025-03-16 14:11:49,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:49,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 14:11:49,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 14:11:49,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:49,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-16 14:11:50,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:50,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450035886] [2025-03-16 14:11:50,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450035886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:50,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121528391] [2025-03-16 14:11:50,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:50,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:50,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:50,783 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:50,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 14:11:50,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 14:11:50,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 14:11:50,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:50,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:50,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:11:50,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-16 14:11:50,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:50,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121528391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:50,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:50,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 14:11:50,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614063897] [2025-03-16 14:11:50,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:50,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:50,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:50,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:50,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:50,998 INFO L87 Difference]: Start difference. First operand 216692 states and 247225 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:52,540 INFO L93 Difference]: Finished difference Result 407876 states and 466329 transitions. [2025-03-16 14:11:52,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:52,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 287 [2025-03-16 14:11:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:52,811 INFO L225 Difference]: With dead ends: 407876 [2025-03-16 14:11:52,812 INFO L226 Difference]: Without dead ends: 191185 [2025-03-16 14:11:52,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:52,878 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:52,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 30 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:11:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191185 states. [2025-03-16 14:11:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191185 to 189967. [2025-03-16 14:11:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189967 states, 189966 states have (on average 1.136892917680006) internal successors, (215971), 189966 states have internal predecessors, (215971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:55,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189967 states to 189967 states and 215971 transitions. [2025-03-16 14:11:55,105 INFO L78 Accepts]: Start accepts. Automaton has 189967 states and 215971 transitions. Word has length 287 [2025-03-16 14:11:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:55,105 INFO L471 AbstractCegarLoop]: Abstraction has 189967 states and 215971 transitions. [2025-03-16 14:11:55,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 189967 states and 215971 transitions. [2025-03-16 14:11:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-16 14:11:55,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:55,150 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:55,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 14:11:55,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 14:11:55,351 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:55,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash 583360743, now seen corresponding path program 1 times [2025-03-16 14:11:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:55,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649440060] [2025-03-16 14:11:55,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:55,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:55,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-16 14:11:55,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-16 14:11:55,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:55,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 14:11:56,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:56,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649440060] [2025-03-16 14:11:56,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649440060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:56,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743365429] [2025-03-16 14:11:56,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:56,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:56,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:56,730 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:56,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 14:11:56,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-16 14:11:56,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-16 14:11:56,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:56,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:56,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:11:56,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:56,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:56,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743365429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:56,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:56,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:11:56,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432949156] [2025-03-16 14:11:56,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:56,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:56,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:56,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:56,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:56,865 INFO L87 Difference]: Start difference. First operand 189967 states and 215971 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:58,203 INFO L93 Difference]: Finished difference Result 369532 states and 418818 transitions. [2025-03-16 14:11:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:58,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 299 [2025-03-16 14:11:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:58,454 INFO L225 Difference]: With dead ends: 369532 [2025-03-16 14:11:58,454 INFO L226 Difference]: Without dead ends: 179566 [2025-03-16 14:11:58,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:58,545 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 231 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:58,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 310 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:11:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179566 states. [2025-03-16 14:12:00,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179566 to 174865. [2025-03-16 14:12:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174865 states, 174864 states have (on average 1.1053675999634) internal successors, (193289), 174864 states have internal predecessors, (193289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)