./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_12.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:39:46,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:39:46,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:39:46,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:39:46,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:39:46,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:39:46,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:39:46,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:39:46,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:39:46,955 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:39:46,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:39:46,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:39:46,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:39:46,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:39:46,956 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:39:46,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:39:46,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:39:46,956 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:39:46,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:39:46,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:39:46,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:39:46,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:39:46,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:39:46,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:39:46,957 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:39:46,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:39:46,957 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:39:46,957 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:39:46,957 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:39:46,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:39:46,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:39:46,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:39:46,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:39:46,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:39:46,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:39:46,958 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:39:46,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:39:46,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:39:46,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:39:46,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:39:46,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:39:46,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:39:46,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:39:46,959 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-jdk21/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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2025-02-05 10:39:47,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:39:47,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:39:47,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:39:47,174 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:39:47,175 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:39:47,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2025-02-05 10:39:48,343 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98766fce6/db86696bc25b42f0b16ced213ef0d2ac/FLAG91dcf5a7a [2025-02-05 10:39:48,542 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:39:48,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2025-02-05 10:39:48,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98766fce6/db86696bc25b42f0b16ced213ef0d2ac/FLAG91dcf5a7a [2025-02-05 10:39:48,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98766fce6/db86696bc25b42f0b16ced213ef0d2ac [2025-02-05 10:39:48,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:39:48,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:39:48,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:39:48,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:39:48,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:39:48,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:39:48" (1/1) ... [2025-02-05 10:39:48,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7382e96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:48, skipping insertion in model container [2025-02-05 10:39:48,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:39:48" (1/1) ... [2025-02-05 10:39:48,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:39:49,054 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2025-02-05 10:39:49,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:39:49,062 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:39:49,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2025-02-05 10:39:49,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:39:49,085 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:39:49,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49 WrapperNode [2025-02-05 10:39:49,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:39:49,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:39:49,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:39:49,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:39:49,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (1/1) ... [2025-02-05 10:39:49,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (1/1) ... [2025-02-05 10:39:49,108 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2025-02-05 10:39:49,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:39:49,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:39:49,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:39:49,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:39:49,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (1/1) ... [2025-02-05 10:39:49,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (1/1) ... [2025-02-05 10:39:49,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (1/1) ... [2025-02-05 10:39:49,131 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-02-05 10:39:49,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (1/1) ... [2025-02-05 10:39:49,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (1/1) ... [2025-02-05 10:39:49,137 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (1/1) ... [2025-02-05 10:39:49,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (1/1) ... [2025-02-05 10:39:49,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (1/1) ... [2025-02-05 10:39:49,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (1/1) ... [2025-02-05 10:39:49,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:39:49,142 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:39:49,142 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:39:49,142 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:39:49,143 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (1/1) ... [2025-02-05 10:39:49,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:39:49,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:49,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:39:49,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:39:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:39:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:39:49,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:39:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:39:49,243 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:39:49,245 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:39:49,382 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-05 10:39:49,382 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:39:49,388 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:39:49,388 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:39:49,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:39:49 BoogieIcfgContainer [2025-02-05 10:39:49,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:39:49,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:39:49,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:39:49,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:39:49,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:39:48" (1/3) ... [2025-02-05 10:39:49,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a13b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:39:49, skipping insertion in model container [2025-02-05 10:39:49,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:49" (2/3) ... [2025-02-05 10:39:49,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a13b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:39:49, skipping insertion in model container [2025-02-05 10:39:49,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:39:49" (3/3) ... [2025-02-05 10:39:49,395 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2025-02-05 10:39:49,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:39:49,405 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_12.c that has 1 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:39:49,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:39:49,452 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;@70364a21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:39:49,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:39:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:39:49,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:49,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:49,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:49,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:49,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1965934707, now seen corresponding path program 1 times [2025-02-05 10:39:49,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:49,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489302833] [2025-02-05 10:39:49,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:49,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:39:49,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:39:49,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:49,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:49,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:49,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489302833] [2025-02-05 10:39:49,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489302833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:49,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:49,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:49,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661785166] [2025-02-05 10:39:49,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:49,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:49,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:49,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:49,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:49,695 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:49,733 INFO L93 Difference]: Finished difference Result 93 states and 166 transitions. [2025-02-05 10:39:49,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:49,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-02-05 10:39:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:49,739 INFO L225 Difference]: With dead ends: 93 [2025-02-05 10:39:49,739 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 10:39:49,741 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-02-05 10:39:49,743 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 60 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:49,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:49,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 10:39:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2025-02-05 10:39:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 102 transitions. [2025-02-05 10:39:49,765 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 102 transitions. Word has length 19 [2025-02-05 10:39:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:49,765 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 102 transitions. [2025-02-05 10:39:49,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2025-02-05 10:39:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:39:49,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:49,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:49,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:39:49,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:49,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:49,767 INFO L85 PathProgramCache]: Analyzing trace with hash -821480780, now seen corresponding path program 1 times [2025-02-05 10:39:49,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:49,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283296733] [2025-02-05 10:39:49,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:49,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:49,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:39:49,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:39:49,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:49,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:49,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:49,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283296733] [2025-02-05 10:39:49,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283296733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:49,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:49,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942190079] [2025-02-05 10:39:49,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:49,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:49,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:49,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:49,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:49,818 INFO L87 Difference]: Start difference. First operand 55 states and 102 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:49,834 INFO L93 Difference]: Finished difference Result 134 states and 249 transitions. [2025-02-05 10:39:49,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:49,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-02-05 10:39:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:49,835 INFO L225 Difference]: With dead ends: 134 [2025-02-05 10:39:49,835 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 10:39:49,835 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-02-05 10:39:49,836 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:49,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 10:39:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-02-05 10:39:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 146 transitions. [2025-02-05 10:39:49,842 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 146 transitions. Word has length 19 [2025-02-05 10:39:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:49,842 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 146 transitions. [2025-02-05 10:39:49,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,842 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 146 transitions. [2025-02-05 10:39:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:39:49,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:49,842 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] [2025-02-05 10:39:49,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:39:49,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:49,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash 814462048, now seen corresponding path program 1 times [2025-02-05 10:39:49,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:49,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936293482] [2025-02-05 10:39:49,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:49,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:49,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 10:39:49,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:39:49,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:49,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:49,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:49,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936293482] [2025-02-05 10:39:49,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936293482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:49,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:49,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:49,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743489238] [2025-02-05 10:39:49,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:49,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:49,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:49,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:49,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:49,882 INFO L87 Difference]: Start difference. First operand 79 states and 146 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:49,895 INFO L93 Difference]: Finished difference Result 123 states and 222 transitions. [2025-02-05 10:39:49,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:49,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-05 10:39:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:49,896 INFO L225 Difference]: With dead ends: 123 [2025-02-05 10:39:49,896 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 10:39:49,897 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-02-05 10:39:49,897 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:49,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:49,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 10:39:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2025-02-05 10:39:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 81 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 148 transitions. [2025-02-05 10:39:49,902 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 148 transitions. Word has length 20 [2025-02-05 10:39:49,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:49,903 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 148 transitions. [2025-02-05 10:39:49,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 148 transitions. [2025-02-05 10:39:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:39:49,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:49,903 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] [2025-02-05 10:39:49,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:39:49,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:49,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:49,904 INFO L85 PathProgramCache]: Analyzing trace with hash 303927871, now seen corresponding path program 1 times [2025-02-05 10:39:49,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:49,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262356097] [2025-02-05 10:39:49,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:49,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:49,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 10:39:49,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:39:49,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:49,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:49,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:49,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262356097] [2025-02-05 10:39:49,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262356097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:49,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:49,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:49,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038578938] [2025-02-05 10:39:49,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:49,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:49,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:49,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:49,955 INFO L87 Difference]: Start difference. First operand 82 states and 148 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:49,969 INFO L93 Difference]: Finished difference Result 157 states and 285 transitions. [2025-02-05 10:39:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:49,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-05 10:39:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:49,970 INFO L225 Difference]: With dead ends: 157 [2025-02-05 10:39:49,970 INFO L226 Difference]: Without dead ends: 155 [2025-02-05 10:39:49,971 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-02-05 10:39:49,971 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:49,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-05 10:39:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2025-02-05 10:39:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.8240740740740742) internal successors, (197), 108 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 197 transitions. [2025-02-05 10:39:49,982 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 197 transitions. Word has length 20 [2025-02-05 10:39:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:49,982 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 197 transitions. [2025-02-05 10:39:49,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 197 transitions. [2025-02-05 10:39:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:39:49,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:49,983 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] [2025-02-05 10:39:49,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:39:49,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:49,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1811479680, now seen corresponding path program 1 times [2025-02-05 10:39:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:49,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609344429] [2025-02-05 10:39:49,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:49,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:49,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 10:39:49,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:39:49,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:49,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:50,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609344429] [2025-02-05 10:39:50,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609344429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:50,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:50,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:50,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952782839] [2025-02-05 10:39:50,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:50,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:50,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:50,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:50,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:50,016 INFO L87 Difference]: Start difference. First operand 109 states and 197 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:50,029 INFO L93 Difference]: Finished difference Result 261 states and 475 transitions. [2025-02-05 10:39:50,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:50,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-05 10:39:50,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:50,030 INFO L225 Difference]: With dead ends: 261 [2025-02-05 10:39:50,030 INFO L226 Difference]: Without dead ends: 157 [2025-02-05 10:39:50,031 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-02-05 10:39:50,031 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:50,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-05 10:39:50,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2025-02-05 10:39:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 154 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 279 transitions. [2025-02-05 10:39:50,049 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 279 transitions. Word has length 20 [2025-02-05 10:39:50,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:50,049 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 279 transitions. [2025-02-05 10:39:50,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,050 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 279 transitions. [2025-02-05 10:39:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:39:50,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:50,050 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] [2025-02-05 10:39:50,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:39:50,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:50,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash 831857467, now seen corresponding path program 1 times [2025-02-05 10:39:50,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:50,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075996348] [2025-02-05 10:39:50,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:50,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:50,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 10:39:50,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:39:50,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:50,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:50,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:50,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075996348] [2025-02-05 10:39:50,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075996348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:50,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:50,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035357969] [2025-02-05 10:39:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:50,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:50,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:50,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:50,104 INFO L87 Difference]: Start difference. First operand 155 states and 279 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:50,122 INFO L93 Difference]: Finished difference Result 234 states and 418 transitions. [2025-02-05 10:39:50,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:50,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-02-05 10:39:50,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:50,124 INFO L225 Difference]: With dead ends: 234 [2025-02-05 10:39:50,124 INFO L226 Difference]: Without dead ends: 159 [2025-02-05 10:39:50,124 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-02-05 10:39:50,125 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:50,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-05 10:39:50,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-02-05 10:39:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.7884615384615385) internal successors, (279), 156 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2025-02-05 10:39:50,131 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 21 [2025-02-05 10:39:50,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:50,132 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2025-02-05 10:39:50,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2025-02-05 10:39:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:39:50,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:50,132 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] [2025-02-05 10:39:50,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:39:50,133 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:50,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:50,133 INFO L85 PathProgramCache]: Analyzing trace with hash 321323290, now seen corresponding path program 1 times [2025-02-05 10:39:50,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:50,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209914347] [2025-02-05 10:39:50,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:50,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:50,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 10:39:50,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:39:50,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:50,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:50,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:50,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209914347] [2025-02-05 10:39:50,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209914347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:50,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:50,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824278426] [2025-02-05 10:39:50,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:50,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:50,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:50,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:50,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:50,157 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:50,169 INFO L93 Difference]: Finished difference Result 297 states and 533 transitions. [2025-02-05 10:39:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:50,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-02-05 10:39:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:50,171 INFO L225 Difference]: With dead ends: 297 [2025-02-05 10:39:50,171 INFO L226 Difference]: Without dead ends: 295 [2025-02-05 10:39:50,171 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-02-05 10:39:50,172 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 52 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:50,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:50,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-05 10:39:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 213. [2025-02-05 10:39:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.7688679245283019) internal successors, (375), 212 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 375 transitions. [2025-02-05 10:39:50,182 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 375 transitions. Word has length 21 [2025-02-05 10:39:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:50,182 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 375 transitions. [2025-02-05 10:39:50,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 375 transitions. [2025-02-05 10:39:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:39:50,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:50,183 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] [2025-02-05 10:39:50,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:39:50,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:50,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:50,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1828875099, now seen corresponding path program 1 times [2025-02-05 10:39:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:50,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604942768] [2025-02-05 10:39:50,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:50,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 10:39:50,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:39:50,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:50,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:50,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:50,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604942768] [2025-02-05 10:39:50,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604942768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:50,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:50,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:50,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958763200] [2025-02-05 10:39:50,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:50,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:50,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:50,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:50,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:50,208 INFO L87 Difference]: Start difference. First operand 213 states and 375 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:50,218 INFO L93 Difference]: Finished difference Result 509 states and 901 transitions. [2025-02-05 10:39:50,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:50,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-02-05 10:39:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:50,220 INFO L225 Difference]: With dead ends: 509 [2025-02-05 10:39:50,220 INFO L226 Difference]: Without dead ends: 303 [2025-02-05 10:39:50,220 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-02-05 10:39:50,221 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:50,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-05 10:39:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2025-02-05 10:39:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.7566666666666666) internal successors, (527), 300 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 527 transitions. [2025-02-05 10:39:50,232 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 527 transitions. Word has length 21 [2025-02-05 10:39:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:50,232 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 527 transitions. [2025-02-05 10:39:50,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 527 transitions. [2025-02-05 10:39:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:39:50,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:50,233 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] [2025-02-05 10:39:50,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:39:50,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:50,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1371115239, now seen corresponding path program 1 times [2025-02-05 10:39:50,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:50,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850956988] [2025-02-05 10:39:50,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:50,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:50,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:39:50,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:39:50,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:50,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:50,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:50,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850956988] [2025-02-05 10:39:50,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850956988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:50,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:50,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:50,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779671869] [2025-02-05 10:39:50,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:50,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:50,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:50,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:50,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:50,258 INFO L87 Difference]: Start difference. First operand 301 states and 527 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:50,275 INFO L93 Difference]: Finished difference Result 453 states and 789 transitions. [2025-02-05 10:39:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:50,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-02-05 10:39:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:50,276 INFO L225 Difference]: With dead ends: 453 [2025-02-05 10:39:50,276 INFO L226 Difference]: Without dead ends: 307 [2025-02-05 10:39:50,277 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-02-05 10:39:50,277 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:50,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:50,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-05 10:39:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2025-02-05 10:39:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.7335526315789473) internal successors, (527), 304 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 527 transitions. [2025-02-05 10:39:50,295 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 527 transitions. Word has length 22 [2025-02-05 10:39:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:50,295 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 527 transitions. [2025-02-05 10:39:50,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 527 transitions. [2025-02-05 10:39:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:39:50,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:50,299 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] [2025-02-05 10:39:50,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:39:50,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:50,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:50,299 INFO L85 PathProgramCache]: Analyzing trace with hash 860581062, now seen corresponding path program 1 times [2025-02-05 10:39:50,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:50,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777811798] [2025-02-05 10:39:50,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:50,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:50,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:39:50,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:39:50,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:50,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:50,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:50,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777811798] [2025-02-05 10:39:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777811798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:50,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:50,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857289499] [2025-02-05 10:39:50,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:50,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:50,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:50,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:50,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:50,339 INFO L87 Difference]: Start difference. First operand 305 states and 527 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:50,361 INFO L93 Difference]: Finished difference Result 569 states and 997 transitions. [2025-02-05 10:39:50,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:50,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-02-05 10:39:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:50,363 INFO L225 Difference]: With dead ends: 569 [2025-02-05 10:39:50,363 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 10:39:50,364 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-02-05 10:39:50,364 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:50,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 10:39:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 421. [2025-02-05 10:39:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.7023809523809523) internal successors, (715), 420 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 715 transitions. [2025-02-05 10:39:50,379 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 715 transitions. Word has length 22 [2025-02-05 10:39:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:50,379 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 715 transitions. [2025-02-05 10:39:50,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 715 transitions. [2025-02-05 10:39:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:39:50,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:50,381 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] [2025-02-05 10:39:50,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:39:50,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:50,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:50,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1926834425, now seen corresponding path program 1 times [2025-02-05 10:39:50,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:50,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759727981] [2025-02-05 10:39:50,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:50,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:50,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:39:50,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:39:50,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:50,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:50,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759727981] [2025-02-05 10:39:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759727981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:50,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:50,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510906138] [2025-02-05 10:39:50,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:50,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:50,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:50,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:50,438 INFO L87 Difference]: Start difference. First operand 421 states and 715 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:50,470 INFO L93 Difference]: Finished difference Result 1001 states and 1709 transitions. [2025-02-05 10:39:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:50,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-02-05 10:39:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:50,473 INFO L225 Difference]: With dead ends: 1001 [2025-02-05 10:39:50,473 INFO L226 Difference]: Without dead ends: 591 [2025-02-05 10:39:50,477 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-02-05 10:39:50,477 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:50,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:50,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-02-05 10:39:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2025-02-05 10:39:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.6921768707482994) internal successors, (995), 588 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 995 transitions. [2025-02-05 10:39:50,503 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 995 transitions. Word has length 22 [2025-02-05 10:39:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:50,503 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 995 transitions. [2025-02-05 10:39:50,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 995 transitions. [2025-02-05 10:39:50,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 10:39:50,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:50,507 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] [2025-02-05 10:39:50,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:39:50,507 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:50,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash 908236770, now seen corresponding path program 1 times [2025-02-05 10:39:50,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:50,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965858251] [2025-02-05 10:39:50,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:50,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:50,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:39:50,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:39:50,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:50,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:50,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:50,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:50,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965858251] [2025-02-05 10:39:50,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965858251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:50,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:50,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:50,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908168188] [2025-02-05 10:39:50,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:50,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:50,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:50,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:50,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:50,540 INFO L87 Difference]: Start difference. First operand 589 states and 995 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:50,564 INFO L93 Difference]: Finished difference Result 885 states and 1489 transitions. [2025-02-05 10:39:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:50,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-02-05 10:39:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:50,567 INFO L225 Difference]: With dead ends: 885 [2025-02-05 10:39:50,567 INFO L226 Difference]: Without dead ends: 599 [2025-02-05 10:39:50,568 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-02-05 10:39:50,568 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:50,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-02-05 10:39:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2025-02-05 10:39:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.669463087248322) internal successors, (995), 596 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 995 transitions. [2025-02-05 10:39:50,593 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 995 transitions. Word has length 23 [2025-02-05 10:39:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:50,594 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 995 transitions. [2025-02-05 10:39:50,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 995 transitions. [2025-02-05 10:39:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 10:39:50,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:50,595 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] [2025-02-05 10:39:50,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:39:50,595 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:50,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:50,595 INFO L85 PathProgramCache]: Analyzing trace with hash 397702593, now seen corresponding path program 1 times [2025-02-05 10:39:50,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:50,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750562509] [2025-02-05 10:39:50,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:50,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:39:50,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:39:50,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:50,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:50,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:50,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750562509] [2025-02-05 10:39:50,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750562509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:50,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:50,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793646219] [2025-02-05 10:39:50,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:50,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:50,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:50,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:50,627 INFO L87 Difference]: Start difference. First operand 597 states and 995 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:50,648 INFO L93 Difference]: Finished difference Result 1097 states and 1861 transitions. [2025-02-05 10:39:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:50,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-02-05 10:39:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:50,653 INFO L225 Difference]: With dead ends: 1097 [2025-02-05 10:39:50,653 INFO L226 Difference]: Without dead ends: 1095 [2025-02-05 10:39:50,653 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-02-05 10:39:50,654 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:50,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:50,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-02-05 10:39:50,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 837. [2025-02-05 10:39:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.6303827751196172) internal successors, (1363), 836 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1363 transitions. [2025-02-05 10:39:50,676 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1363 transitions. Word has length 23 [2025-02-05 10:39:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:50,676 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1363 transitions. [2025-02-05 10:39:50,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1363 transitions. [2025-02-05 10:39:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 10:39:50,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:50,678 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] [2025-02-05 10:39:50,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 10:39:50,679 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:50,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1905254402, now seen corresponding path program 1 times [2025-02-05 10:39:50,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:50,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483218784] [2025-02-05 10:39:50,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:50,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:50,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:39:50,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:39:50,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:50,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:50,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:50,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483218784] [2025-02-05 10:39:50,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483218784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:50,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:50,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:50,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902369995] [2025-02-05 10:39:50,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:50,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:50,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:50,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:50,704 INFO L87 Difference]: Start difference. First operand 837 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:50,728 INFO L93 Difference]: Finished difference Result 1977 states and 3237 transitions. [2025-02-05 10:39:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:50,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-02-05 10:39:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:50,733 INFO L225 Difference]: With dead ends: 1977 [2025-02-05 10:39:50,733 INFO L226 Difference]: Without dead ends: 1159 [2025-02-05 10:39:50,734 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-02-05 10:39:50,734 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:50,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-02-05 10:39:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2025-02-05 10:39:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.6219723183391004) internal successors, (1875), 1156 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1875 transitions. [2025-02-05 10:39:50,772 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1875 transitions. Word has length 23 [2025-02-05 10:39:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:50,772 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1875 transitions. [2025-02-05 10:39:50,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1875 transitions. [2025-02-05 10:39:50,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:39:50,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:50,774 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] [2025-02-05 10:39:50,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 10:39:50,774 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:50,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash -556094098, now seen corresponding path program 1 times [2025-02-05 10:39:50,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:50,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062207534] [2025-02-05 10:39:50,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:50,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:39:50,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:39:50,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:50,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:50,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062207534] [2025-02-05 10:39:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062207534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:50,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:50,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864784557] [2025-02-05 10:39:50,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:50,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:50,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:50,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:50,802 INFO L87 Difference]: Start difference. First operand 1157 states and 1875 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:50,824 INFO L93 Difference]: Finished difference Result 1737 states and 2805 transitions. [2025-02-05 10:39:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:50,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-05 10:39:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:50,828 INFO L225 Difference]: With dead ends: 1737 [2025-02-05 10:39:50,828 INFO L226 Difference]: Without dead ends: 1175 [2025-02-05 10:39:50,830 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-02-05 10:39:50,831 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:50,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:50,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-02-05 10:39:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2025-02-05 10:39:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.5998293515358362) internal successors, (1875), 1172 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1875 transitions. [2025-02-05 10:39:50,859 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1875 transitions. Word has length 24 [2025-02-05 10:39:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:50,859 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1875 transitions. [2025-02-05 10:39:50,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1875 transitions. [2025-02-05 10:39:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:39:50,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:50,860 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] [2025-02-05 10:39:50,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 10:39:50,860 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:50,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1066628275, now seen corresponding path program 1 times [2025-02-05 10:39:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:50,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977517777] [2025-02-05 10:39:50,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:50,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:39:50,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:39:50,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:50,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:50,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977517777] [2025-02-05 10:39:50,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977517777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:50,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:50,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636556224] [2025-02-05 10:39:50,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:50,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:50,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:50,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:50,888 INFO L87 Difference]: Start difference. First operand 1173 states and 1875 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:50,919 INFO L93 Difference]: Finished difference Result 2121 states and 3461 transitions. [2025-02-05 10:39:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:50,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-05 10:39:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:50,925 INFO L225 Difference]: With dead ends: 2121 [2025-02-05 10:39:50,926 INFO L226 Difference]: Without dead ends: 2119 [2025-02-05 10:39:50,926 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-02-05 10:39:50,927 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:50,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2025-02-05 10:39:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1669. [2025-02-05 10:39:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.5557553956834533) internal successors, (2595), 1668 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2595 transitions. [2025-02-05 10:39:50,984 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2595 transitions. Word has length 24 [2025-02-05 10:39:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:50,984 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2595 transitions. [2025-02-05 10:39:50,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2595 transitions. [2025-02-05 10:39:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:39:50,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:50,986 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] [2025-02-05 10:39:50,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 10:39:50,986 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:50,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash 440923534, now seen corresponding path program 1 times [2025-02-05 10:39:50,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:50,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901343309] [2025-02-05 10:39:50,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:50,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:50,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:39:50,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:39:50,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:50,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:51,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:51,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901343309] [2025-02-05 10:39:51,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901343309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:51,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:51,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:51,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104631882] [2025-02-05 10:39:51,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:51,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:51,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:51,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:51,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:51,011 INFO L87 Difference]: Start difference. First operand 1669 states and 2595 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:51,045 INFO L93 Difference]: Finished difference Result 3913 states and 6117 transitions. [2025-02-05 10:39:51,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:51,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-05 10:39:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:51,051 INFO L225 Difference]: With dead ends: 3913 [2025-02-05 10:39:51,051 INFO L226 Difference]: Without dead ends: 2279 [2025-02-05 10:39:51,053 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-02-05 10:39:51,053 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:51,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2025-02-05 10:39:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2277. [2025-02-05 10:39:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2276 states have (on average 1.5478910369068541) internal successors, (3523), 2276 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3523 transitions. [2025-02-05 10:39:51,099 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3523 transitions. Word has length 24 [2025-02-05 10:39:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:51,099 INFO L471 AbstractCegarLoop]: Abstraction has 2277 states and 3523 transitions. [2025-02-05 10:39:51,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3523 transitions. [2025-02-05 10:39:51,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:39:51,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:51,101 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] [2025-02-05 10:39:51,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 10:39:51,101 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:51,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1294289033, now seen corresponding path program 1 times [2025-02-05 10:39:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124148257] [2025-02-05 10:39:51,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:51,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:39:51,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:39:51,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:51,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:51,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:51,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124148257] [2025-02-05 10:39:51,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124148257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:51,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:51,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269716099] [2025-02-05 10:39:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:51,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:51,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:51,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:51,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:51,133 INFO L87 Difference]: Start difference. First operand 2277 states and 3523 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:51,208 INFO L93 Difference]: Finished difference Result 3417 states and 5269 transitions. [2025-02-05 10:39:51,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:51,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-02-05 10:39:51,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:51,213 INFO L225 Difference]: With dead ends: 3417 [2025-02-05 10:39:51,213 INFO L226 Difference]: Without dead ends: 2311 [2025-02-05 10:39:51,214 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-02-05 10:39:51,214 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:51,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2025-02-05 10:39:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2025-02-05 10:39:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.5264298093587523) internal successors, (3523), 2308 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3523 transitions. [2025-02-05 10:39:51,272 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3523 transitions. Word has length 25 [2025-02-05 10:39:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:51,272 INFO L471 AbstractCegarLoop]: Abstraction has 2309 states and 3523 transitions. [2025-02-05 10:39:51,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3523 transitions. [2025-02-05 10:39:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:39:51,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:51,274 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] [2025-02-05 10:39:51,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 10:39:51,274 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:51,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:51,274 INFO L85 PathProgramCache]: Analyzing trace with hash 783754856, now seen corresponding path program 1 times [2025-02-05 10:39:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:51,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514376333] [2025-02-05 10:39:51,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:51,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:51,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:39:51,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:39:51,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:51,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:51,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:51,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514376333] [2025-02-05 10:39:51,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514376333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:51,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:51,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119108153] [2025-02-05 10:39:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:51,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:51,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:51,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:51,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:51,298 INFO L87 Difference]: Start difference. First operand 2309 states and 3523 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:51,363 INFO L93 Difference]: Finished difference Result 4105 states and 6405 transitions. [2025-02-05 10:39:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:51,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-02-05 10:39:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:51,374 INFO L225 Difference]: With dead ends: 4105 [2025-02-05 10:39:51,374 INFO L226 Difference]: Without dead ends: 4103 [2025-02-05 10:39:51,375 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-02-05 10:39:51,376 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:51,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2025-02-05 10:39:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 3333. [2025-02-05 10:39:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.4798919567827131) internal successors, (4931), 3332 states have internal predecessors, (4931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4931 transitions. [2025-02-05 10:39:51,469 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4931 transitions. Word has length 25 [2025-02-05 10:39:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:51,469 INFO L471 AbstractCegarLoop]: Abstraction has 3333 states and 4931 transitions. [2025-02-05 10:39:51,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4931 transitions. [2025-02-05 10:39:51,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:39:51,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:51,473 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] [2025-02-05 10:39:51,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 10:39:51,473 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:51,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:51,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2003660631, now seen corresponding path program 1 times [2025-02-05 10:39:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881015514] [2025-02-05 10:39:51,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:51,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:39:51,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:39:51,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:51,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:51,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:51,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881015514] [2025-02-05 10:39:51,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881015514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:51,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:51,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:51,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990318395] [2025-02-05 10:39:51,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:51,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:51,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:51,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:51,494 INFO L87 Difference]: Start difference. First operand 3333 states and 4931 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:51,580 INFO L93 Difference]: Finished difference Result 7753 states and 11525 transitions. [2025-02-05 10:39:51,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:51,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-02-05 10:39:51,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:51,591 INFO L225 Difference]: With dead ends: 7753 [2025-02-05 10:39:51,591 INFO L226 Difference]: Without dead ends: 4487 [2025-02-05 10:39:51,594 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-02-05 10:39:51,595 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:51,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2025-02-05 10:39:51,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2025-02-05 10:39:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4484 states have (on average 1.47078501338091) internal successors, (6595), 4484 states have internal predecessors, (6595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6595 transitions. [2025-02-05 10:39:51,719 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6595 transitions. Word has length 25 [2025-02-05 10:39:51,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:51,719 INFO L471 AbstractCegarLoop]: Abstraction has 4485 states and 6595 transitions. [2025-02-05 10:39:51,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6595 transitions. [2025-02-05 10:39:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:39:51,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:51,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:51,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 10:39:51,722 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:51,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:51,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1473376267, now seen corresponding path program 1 times [2025-02-05 10:39:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:51,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141021097] [2025-02-05 10:39:51,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:51,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 10:39:51,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:39:51,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:51,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:51,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:51,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141021097] [2025-02-05 10:39:51,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141021097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:51,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:51,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49464005] [2025-02-05 10:39:51,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:51,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:51,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:51,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:51,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:51,737 INFO L87 Difference]: Start difference. First operand 4485 states and 6595 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:51,794 INFO L93 Difference]: Finished difference Result 6729 states and 9861 transitions. [2025-02-05 10:39:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:51,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 10:39:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:51,805 INFO L225 Difference]: With dead ends: 6729 [2025-02-05 10:39:51,805 INFO L226 Difference]: Without dead ends: 4551 [2025-02-05 10:39:51,807 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-02-05 10:39:51,807 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:51,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2025-02-05 10:39:51,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4549. [2025-02-05 10:39:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4549 states, 4548 states have (on average 1.4500879507475815) internal successors, (6595), 4548 states have internal predecessors, (6595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 6595 transitions. [2025-02-05 10:39:51,893 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 6595 transitions. Word has length 26 [2025-02-05 10:39:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:51,893 INFO L471 AbstractCegarLoop]: Abstraction has 4549 states and 6595 transitions. [2025-02-05 10:39:51,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 6595 transitions. [2025-02-05 10:39:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:39:51,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:51,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:51,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 10:39:51,896 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:51,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1983910444, now seen corresponding path program 1 times [2025-02-05 10:39:51,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201461295] [2025-02-05 10:39:51,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:51,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 10:39:51,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:39:51,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:51,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:51,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201461295] [2025-02-05 10:39:51,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201461295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:51,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:51,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:51,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731659974] [2025-02-05 10:39:51,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:51,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:51,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:51,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:51,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:51,913 INFO L87 Difference]: Start difference. First operand 4549 states and 6595 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:52,006 INFO L93 Difference]: Finished difference Result 7945 states and 11781 transitions. [2025-02-05 10:39:52,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:52,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 10:39:52,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:52,016 INFO L225 Difference]: With dead ends: 7945 [2025-02-05 10:39:52,017 INFO L226 Difference]: Without dead ends: 7943 [2025-02-05 10:39:52,018 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-02-05 10:39:52,019 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:52,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2025-02-05 10:39:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 6661. [2025-02-05 10:39:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.4034534534534535) internal successors, (9347), 6660 states have internal predecessors, (9347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 9347 transitions. [2025-02-05 10:39:52,129 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 9347 transitions. Word has length 26 [2025-02-05 10:39:52,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:52,129 INFO L471 AbstractCegarLoop]: Abstraction has 6661 states and 9347 transitions. [2025-02-05 10:39:52,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 9347 transitions. [2025-02-05 10:39:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:39:52,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:52,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:52,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 10:39:52,135 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:52,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:52,136 INFO L85 PathProgramCache]: Analyzing trace with hash -476358635, now seen corresponding path program 1 times [2025-02-05 10:39:52,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:52,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367607060] [2025-02-05 10:39:52,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:52,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 10:39:52,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:39:52,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:52,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:52,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:52,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367607060] [2025-02-05 10:39:52,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367607060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:52,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:52,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:52,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654695284] [2025-02-05 10:39:52,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:52,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:52,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:52,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:52,150 INFO L87 Difference]: Start difference. First operand 6661 states and 9347 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:52,264 INFO L93 Difference]: Finished difference Result 15369 states and 21637 transitions. [2025-02-05 10:39:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:52,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 10:39:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:52,276 INFO L225 Difference]: With dead ends: 15369 [2025-02-05 10:39:52,276 INFO L226 Difference]: Without dead ends: 8839 [2025-02-05 10:39:52,282 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-02-05 10:39:52,282 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:52,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2025-02-05 10:39:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 8837. [2025-02-05 10:39:52,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8837 states, 8836 states have (on average 1.391014033499321) internal successors, (12291), 8836 states have internal predecessors, (12291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 12291 transitions. [2025-02-05 10:39:52,465 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 12291 transitions. Word has length 26 [2025-02-05 10:39:52,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:52,466 INFO L471 AbstractCegarLoop]: Abstraction has 8837 states and 12291 transitions. [2025-02-05 10:39:52,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 12291 transitions. [2025-02-05 10:39:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:39:52,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:52,473 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] [2025-02-05 10:39:52,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 10:39:52,474 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:52,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:52,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1371654864, now seen corresponding path program 1 times [2025-02-05 10:39:52,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:52,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999562503] [2025-02-05 10:39:52,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:52,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:52,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:39:52,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:39:52,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:52,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:52,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:52,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999562503] [2025-02-05 10:39:52,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999562503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:52,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:52,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:52,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31137864] [2025-02-05 10:39:52,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:52,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:52,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:52,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:52,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:52,492 INFO L87 Difference]: Start difference. First operand 8837 states and 12291 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:52,611 INFO L93 Difference]: Finished difference Result 13257 states and 18373 transitions. [2025-02-05 10:39:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:52,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-05 10:39:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:52,625 INFO L225 Difference]: With dead ends: 13257 [2025-02-05 10:39:52,625 INFO L226 Difference]: Without dead ends: 8967 [2025-02-05 10:39:52,631 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-02-05 10:39:52,632 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:52,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8967 states. [2025-02-05 10:39:52,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8967 to 8965. [2025-02-05 10:39:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8965 states, 8964 states have (on average 1.3711512717536813) internal successors, (12291), 8964 states have internal predecessors, (12291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8965 states to 8965 states and 12291 transitions. [2025-02-05 10:39:52,845 INFO L78 Accepts]: Start accepts. Automaton has 8965 states and 12291 transitions. Word has length 27 [2025-02-05 10:39:52,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:52,845 INFO L471 AbstractCegarLoop]: Abstraction has 8965 states and 12291 transitions. [2025-02-05 10:39:52,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 8965 states and 12291 transitions. [2025-02-05 10:39:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:39:52,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:52,853 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] [2025-02-05 10:39:52,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 10:39:52,854 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:52,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:52,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1882189041, now seen corresponding path program 1 times [2025-02-05 10:39:52,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:52,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112401967] [2025-02-05 10:39:52,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:52,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:39:52,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:39:52,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:52,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:52,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:52,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112401967] [2025-02-05 10:39:52,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112401967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:52,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:52,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:52,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495466019] [2025-02-05 10:39:52,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:52,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:52,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:52,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:52,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:52,879 INFO L87 Difference]: Start difference. First operand 8965 states and 12291 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:53,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:53,045 INFO L93 Difference]: Finished difference Result 15369 states and 21509 transitions. [2025-02-05 10:39:53,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:53,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-05 10:39:53,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:53,065 INFO L225 Difference]: With dead ends: 15369 [2025-02-05 10:39:53,065 INFO L226 Difference]: Without dead ends: 15367 [2025-02-05 10:39:53,067 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-02-05 10:39:53,068 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 34 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:53,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15367 states. [2025-02-05 10:39:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15367 to 13317. [2025-02-05 10:39:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13317 states, 13316 states have (on average 1.3267497747071193) internal successors, (17667), 13316 states have internal predecessors, (17667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13317 states to 13317 states and 17667 transitions. [2025-02-05 10:39:53,263 INFO L78 Accepts]: Start accepts. Automaton has 13317 states and 17667 transitions. Word has length 27 [2025-02-05 10:39:53,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:53,263 INFO L471 AbstractCegarLoop]: Abstraction has 13317 states and 17667 transitions. [2025-02-05 10:39:53,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 13317 states and 17667 transitions. [2025-02-05 10:39:53,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:39:53,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:53,274 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] [2025-02-05 10:39:53,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 10:39:53,275 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:53,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash -374637232, now seen corresponding path program 1 times [2025-02-05 10:39:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:53,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435199135] [2025-02-05 10:39:53,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:53,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:53,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:39:53,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:39:53,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:53,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:53,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:53,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435199135] [2025-02-05 10:39:53,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435199135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:53,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:53,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:53,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024614098] [2025-02-05 10:39:53,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:53,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:53,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:53,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:53,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:53,303 INFO L87 Difference]: Start difference. First operand 13317 states and 17667 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:53,464 INFO L93 Difference]: Finished difference Result 30473 states and 40453 transitions. [2025-02-05 10:39:53,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:53,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-05 10:39:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:53,488 INFO L225 Difference]: With dead ends: 30473 [2025-02-05 10:39:53,488 INFO L226 Difference]: Without dead ends: 17415 [2025-02-05 10:39:53,499 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-02-05 10:39:53,499 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:53,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2025-02-05 10:39:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 17413. [2025-02-05 10:39:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17413 states, 17412 states have (on average 1.3086951527682058) internal successors, (22787), 17412 states have internal predecessors, (22787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 22787 transitions. [2025-02-05 10:39:53,806 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 22787 transitions. Word has length 27 [2025-02-05 10:39:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:53,806 INFO L471 AbstractCegarLoop]: Abstraction has 17413 states and 22787 transitions. [2025-02-05 10:39:53,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 22787 transitions. [2025-02-05 10:39:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 10:39:53,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:53,817 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] [2025-02-05 10:39:53,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 10:39:53,817 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:53,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:53,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1781708412, now seen corresponding path program 1 times [2025-02-05 10:39:53,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:53,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095057676] [2025-02-05 10:39:53,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:53,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:53,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 10:39:53,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 10:39:53,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:53,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:53,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:53,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095057676] [2025-02-05 10:39:53,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095057676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:53,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:53,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:53,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578157382] [2025-02-05 10:39:53,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:53,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:53,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:53,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:53,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:53,832 INFO L87 Difference]: Start difference. First operand 17413 states and 22787 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:53,949 INFO L93 Difference]: Finished difference Result 26121 states and 34053 transitions. [2025-02-05 10:39:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:53,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-05 10:39:53,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:53,973 INFO L225 Difference]: With dead ends: 26121 [2025-02-05 10:39:53,974 INFO L226 Difference]: Without dead ends: 17671 [2025-02-05 10:39:53,984 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-02-05 10:39:53,985 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:53,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17671 states. [2025-02-05 10:39:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17671 to 17669. [2025-02-05 10:39:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17669 states, 17668 states have (on average 1.289732850350917) internal successors, (22787), 17668 states have internal predecessors, (22787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17669 states to 17669 states and 22787 transitions. [2025-02-05 10:39:54,365 INFO L78 Accepts]: Start accepts. Automaton has 17669 states and 22787 transitions. Word has length 28 [2025-02-05 10:39:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:54,366 INFO L471 AbstractCegarLoop]: Abstraction has 17669 states and 22787 transitions. [2025-02-05 10:39:54,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 17669 states and 22787 transitions. [2025-02-05 10:39:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 10:39:54,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:54,379 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] [2025-02-05 10:39:54,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 10:39:54,379 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:54,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1271174235, now seen corresponding path program 1 times [2025-02-05 10:39:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133502037] [2025-02-05 10:39:54,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:54,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 10:39:54,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 10:39:54,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:54,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:54,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133502037] [2025-02-05 10:39:54,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133502037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:54,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:54,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:54,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399878963] [2025-02-05 10:39:54,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:54,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:54,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:54,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:54,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:54,405 INFO L87 Difference]: Start difference. First operand 17669 states and 22787 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:54,754 INFO L93 Difference]: Finished difference Result 29705 states and 38917 transitions. [2025-02-05 10:39:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:54,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-05 10:39:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:54,803 INFO L225 Difference]: With dead ends: 29705 [2025-02-05 10:39:54,803 INFO L226 Difference]: Without dead ends: 29703 [2025-02-05 10:39:54,811 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-02-05 10:39:54,812 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:54,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29703 states. [2025-02-05 10:39:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29703 to 26629. [2025-02-05 10:39:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26629 states, 26628 states have (on average 1.2499248910920835) internal successors, (33283), 26628 states have internal predecessors, (33283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26629 states to 26629 states and 33283 transitions. [2025-02-05 10:39:55,185 INFO L78 Accepts]: Start accepts. Automaton has 26629 states and 33283 transitions. Word has length 28 [2025-02-05 10:39:55,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:55,185 INFO L471 AbstractCegarLoop]: Abstraction has 26629 states and 33283 transitions. [2025-02-05 10:39:55,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 26629 states and 33283 transitions. [2025-02-05 10:39:55,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 10:39:55,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:55,203 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] [2025-02-05 10:39:55,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 10:39:55,204 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:55,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1516241252, now seen corresponding path program 1 times [2025-02-05 10:39:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:55,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042601615] [2025-02-05 10:39:55,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:55,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:55,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 10:39:55,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 10:39:55,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:55,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:55,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:55,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042601615] [2025-02-05 10:39:55,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042601615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:55,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:55,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:55,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64522573] [2025-02-05 10:39:55,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:55,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:55,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:55,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:55,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:55,222 INFO L87 Difference]: Start difference. First operand 26629 states and 33283 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:55,459 INFO L93 Difference]: Finished difference Result 60425 states and 75269 transitions. [2025-02-05 10:39:55,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:55,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-05 10:39:55,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:55,497 INFO L225 Difference]: With dead ends: 60425 [2025-02-05 10:39:55,497 INFO L226 Difference]: Without dead ends: 34311 [2025-02-05 10:39:55,518 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-02-05 10:39:55,519 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:55,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34311 states. [2025-02-05 10:39:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34311 to 34309. [2025-02-05 10:39:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34309 states, 34308 states have (on average 1.2238253468578757) internal successors, (41987), 34308 states have internal predecessors, (41987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34309 states to 34309 states and 41987 transitions. [2025-02-05 10:39:56,016 INFO L78 Accepts]: Start accepts. Automaton has 34309 states and 41987 transitions. Word has length 28 [2025-02-05 10:39:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:56,016 INFO L471 AbstractCegarLoop]: Abstraction has 34309 states and 41987 transitions. [2025-02-05 10:39:56,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 34309 states and 41987 transitions. [2025-02-05 10:39:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 10:39:56,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:56,028 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] [2025-02-05 10:39:56,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 10:39:56,029 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:56,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:56,029 INFO L85 PathProgramCache]: Analyzing trace with hash 751721943, now seen corresponding path program 1 times [2025-02-05 10:39:56,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:56,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661786286] [2025-02-05 10:39:56,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:56,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:56,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 10:39:56,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:39:56,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:56,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:56,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:56,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661786286] [2025-02-05 10:39:56,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661786286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:56,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:56,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:56,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267241065] [2025-02-05 10:39:56,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:56,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:56,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:56,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:56,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:56,045 INFO L87 Difference]: Start difference. First operand 34309 states and 41987 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:56,343 INFO L93 Difference]: Finished difference Result 51465 states and 62725 transitions. [2025-02-05 10:39:56,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:56,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-02-05 10:39:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:56,376 INFO L225 Difference]: With dead ends: 51465 [2025-02-05 10:39:56,376 INFO L226 Difference]: Without dead ends: 34823 [2025-02-05 10:39:56,388 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-02-05 10:39:56,389 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 51 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:56,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34823 states. [2025-02-05 10:39:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34823 to 34821. [2025-02-05 10:39:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34821 states, 34820 states have (on average 1.205829982768524) internal successors, (41987), 34820 states have internal predecessors, (41987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 41987 transitions. [2025-02-05 10:39:56,995 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 41987 transitions. Word has length 29 [2025-02-05 10:39:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:56,995 INFO L471 AbstractCegarLoop]: Abstraction has 34821 states and 41987 transitions. [2025-02-05 10:39:56,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 41987 transitions. [2025-02-05 10:39:57,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 10:39:57,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:57,012 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] [2025-02-05 10:39:57,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 10:39:57,013 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:57,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash 241187766, now seen corresponding path program 1 times [2025-02-05 10:39:57,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:57,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936902112] [2025-02-05 10:39:57,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:57,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 10:39:57,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:39:57,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:57,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:57,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936902112] [2025-02-05 10:39:57,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936902112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:57,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:57,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860479042] [2025-02-05 10:39:57,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:57,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:57,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:57,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:57,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:57,032 INFO L87 Difference]: Start difference. First operand 34821 states and 41987 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:57,754 INFO L93 Difference]: Finished difference Result 57353 states and 69637 transitions. [2025-02-05 10:39:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:57,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-02-05 10:39:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:57,819 INFO L225 Difference]: With dead ends: 57353 [2025-02-05 10:39:57,819 INFO L226 Difference]: Without dead ends: 57351 [2025-02-05 10:39:57,833 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-02-05 10:39:57,834 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 28 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:57,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57351 states. [2025-02-05 10:39:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57351 to 53253. [2025-02-05 10:39:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53253 states, 53252 states have (on average 1.1730451438443628) internal successors, (62467), 53252 states have internal predecessors, (62467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53253 states to 53253 states and 62467 transitions. [2025-02-05 10:39:58,661 INFO L78 Accepts]: Start accepts. Automaton has 53253 states and 62467 transitions. Word has length 29 [2025-02-05 10:39:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:58,662 INFO L471 AbstractCegarLoop]: Abstraction has 53253 states and 62467 transitions. [2025-02-05 10:39:58,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 53253 states and 62467 transitions. [2025-02-05 10:39:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 10:39:58,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:58,684 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] [2025-02-05 10:39:58,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 10:39:58,684 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:58,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:58,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1748739575, now seen corresponding path program 1 times [2025-02-05 10:39:58,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:58,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843681042] [2025-02-05 10:39:58,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:58,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:58,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 10:39:58,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:39:58,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:58,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:58,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:58,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843681042] [2025-02-05 10:39:58,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843681042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:58,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:58,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:58,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145168563] [2025-02-05 10:39:58,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:58,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:58,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:58,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:58,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:58,698 INFO L87 Difference]: Start difference. First operand 53253 states and 62467 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:59,332 INFO L93 Difference]: Finished difference Result 119817 states and 139269 transitions. [2025-02-05 10:39:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:59,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-02-05 10:39:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:59,380 INFO L225 Difference]: With dead ends: 119817 [2025-02-05 10:39:59,380 INFO L226 Difference]: Without dead ends: 67591 [2025-02-05 10:39:59,402 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-02-05 10:39:59,403 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 48 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:59,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67591 states. [2025-02-05 10:40:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67591 to 67589. [2025-02-05 10:40:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67589 states, 67588 states have (on average 1.1363407705509854) internal successors, (76803), 67588 states have internal predecessors, (76803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 76803 transitions. [2025-02-05 10:40:00,339 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 76803 transitions. Word has length 29 [2025-02-05 10:40:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:00,339 INFO L471 AbstractCegarLoop]: Abstraction has 67589 states and 76803 transitions. [2025-02-05 10:40:00,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 76803 transitions. [2025-02-05 10:40:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 10:40:00,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:00,361 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] [2025-02-05 10:40:00,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 10:40:00,361 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:00,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087741, now seen corresponding path program 1 times [2025-02-05 10:40:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:00,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474687241] [2025-02-05 10:40:00,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:00,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 10:40:00,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 10:40:00,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:00,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:00,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:00,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474687241] [2025-02-05 10:40:00,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474687241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:00,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:00,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:00,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325720258] [2025-02-05 10:40:00,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:00,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:00,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:00,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:00,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:00,374 INFO L87 Difference]: Start difference. First operand 67589 states and 76803 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:01,147 INFO L93 Difference]: Finished difference Result 101385 states and 114693 transitions. [2025-02-05 10:40:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:01,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-02-05 10:40:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:01,213 INFO L225 Difference]: With dead ends: 101385 [2025-02-05 10:40:01,213 INFO L226 Difference]: Without dead ends: 68615 [2025-02-05 10:40:01,238 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-02-05 10:40:01,238 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 50 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:01,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68615 states. [2025-02-05 10:40:02,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68615 to 68613. [2025-02-05 10:40:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68613 states, 68612 states have (on average 1.1193814493091587) internal successors, (76803), 68612 states have internal predecessors, (76803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68613 states to 68613 states and 76803 transitions. [2025-02-05 10:40:02,379 INFO L78 Accepts]: Start accepts. Automaton has 68613 states and 76803 transitions. Word has length 30 [2025-02-05 10:40:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:02,379 INFO L471 AbstractCegarLoop]: Abstraction has 68613 states and 76803 transitions. [2025-02-05 10:40:02,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 68613 states and 76803 transitions. [2025-02-05 10:40:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 10:40:02,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:02,401 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] [2025-02-05 10:40:02,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 10:40:02,401 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:02,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:02,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1623621918, now seen corresponding path program 1 times [2025-02-05 10:40:02,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:02,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953344624] [2025-02-05 10:40:02,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:02,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:02,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 10:40:02,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 10:40:02,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:02,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:02,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:02,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953344624] [2025-02-05 10:40:02,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953344624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:02,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:02,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:02,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842603899] [2025-02-05 10:40:02,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:02,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:02,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:02,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:02,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:02,415 INFO L87 Difference]: Start difference. First operand 68613 states and 76803 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:03,591 INFO L93 Difference]: Finished difference Result 110599 states and 122884 transitions. [2025-02-05 10:40:03,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:03,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-02-05 10:40:03,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:03,683 INFO L225 Difference]: With dead ends: 110599 [2025-02-05 10:40:03,683 INFO L226 Difference]: Without dead ends: 110597 [2025-02-05 10:40:03,697 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-02-05 10:40:03,698 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 24 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:03,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110597 states. [2025-02-05 10:40:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110597 to 106501. [2025-02-05 10:40:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106501 states, 106500 states have (on average 1.0961408450704226) internal successors, (116739), 106500 states have internal predecessors, (116739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106501 states to 106501 states and 116739 transitions. [2025-02-05 10:40:05,629 INFO L78 Accepts]: Start accepts. Automaton has 106501 states and 116739 transitions. Word has length 30 [2025-02-05 10:40:05,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:05,630 INFO L471 AbstractCegarLoop]: Abstraction has 106501 states and 116739 transitions. [2025-02-05 10:40:05,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 106501 states and 116739 transitions. [2025-02-05 10:40:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 10:40:05,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:05,678 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] [2025-02-05 10:40:05,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 10:40:05,679 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:05,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:05,679 INFO L85 PathProgramCache]: Analyzing trace with hash -116070109, now seen corresponding path program 1 times [2025-02-05 10:40:05,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:05,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945554174] [2025-02-05 10:40:05,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:05,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:05,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 10:40:05,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 10:40:05,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:05,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:05,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:05,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945554174] [2025-02-05 10:40:05,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945554174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:05,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:05,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:05,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962198504] [2025-02-05 10:40:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:05,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:05,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:05,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:05,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:05,692 INFO L87 Difference]: Start difference. First operand 106501 states and 116739 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:06,878 INFO L93 Difference]: Finished difference Result 237573 states and 256003 transitions. [2025-02-05 10:40:06,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:06,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-02-05 10:40:06,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:06,883 INFO L225 Difference]: With dead ends: 237573 [2025-02-05 10:40:06,883 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:40:06,940 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-02-05 10:40:06,940 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:06,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:40:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:40:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:40:06,943 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2025-02-05 10:40:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:06,943 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:40:06,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:40:06,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:40:06,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:40:06,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 10:40:06,948 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:06,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:40:06,960 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:40:06,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:40:06 BoogieIcfgContainer [2025-02-05 10:40:06,968 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:40:06,969 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:40:06,969 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:40:06,969 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:40:06,969 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:39:49" (3/4) ... [2025-02-05 10:40:06,971 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:40:06,977 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-05 10:40:06,977 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:40:06,977 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:40:06,978 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:40:07,038 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:40:07,038 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:40:07,038 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:40:07,039 INFO L158 Benchmark]: Toolchain (without parser) took 18127.84ms. Allocated memory was 142.6MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 105.8MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-02-05 10:40:07,041 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:40:07,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.51ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:40:07,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.48ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:40:07,041 INFO L158 Benchmark]: Boogie Preprocessor took 33.09ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:40:07,041 INFO L158 Benchmark]: IcfgBuilder took 246.62ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 75.2MB in the end (delta: 16.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:40:07,041 INFO L158 Benchmark]: TraceAbstraction took 17578.27ms. Allocated memory was 142.6MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 74.4MB in the beginning and 6.1GB in the end (delta: -6.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-02-05 10:40:07,043 INFO L158 Benchmark]: Witness Printer took 69.62ms. Allocated memory is still 7.8GB. Free memory was 6.1GB in the beginning and 6.1GB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:40:07,044 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.51ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.48ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.09ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 246.62ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 75.2MB in the end (delta: 16.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17578.27ms. Allocated memory was 142.6MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 74.4MB in the beginning and 6.1GB in the end (delta: -6.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 69.62ms. Allocated memory is still 7.8GB. Free memory was 6.1GB in the beginning and 6.1GB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 191]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1733 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1733 mSDsluCounter, 5697 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2301 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 3396 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106501occurred in iteration=34, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 16422 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 863 NumberOfCodeBlocks, 863 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 828 ConstructedInterpolants, 0 QuantifiedInterpolants, 1824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-05 10:40:07,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE