./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label30.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80c5c0aba72ae94b1a7faaff5d18dcb1975bca24b2cca6ada65386f045cad987 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:51:17,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:51:17,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:51:17,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:51:17,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:51:17,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:51:17,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:51:17,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:51:17,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:51:17,815 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:51:17,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:51:17,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:51:17,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:51:17,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:51:17,816 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:51:17,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:51:17,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:51:17,817 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:51:17,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:51:17,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:51:17,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:51:17,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:51:17,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:51:17,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:51:17,817 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:51:17,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:51:17,817 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:51:17,817 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:51:17,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:51:17,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:51:17,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:51:17,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:51:17,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:51:17,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:51:17,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:51:17,818 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:51:17,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:51:17,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:51:17,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:51:17,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:51:17,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:51:17,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:51:17,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:51:17,819 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 80c5c0aba72ae94b1a7faaff5d18dcb1975bca24b2cca6ada65386f045cad987 [2025-03-16 14:51:18,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:51:18,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:51:18,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:51:18,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:51:18,062 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:51:18,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label30.c [2025-03-16 14:51:19,215 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe84200e/4b81a4bbea984f3189e113fcd00c9b66/FLAG1ae4f488a [2025-03-16 14:51:19,496 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:51:19,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label30.c [2025-03-16 14:51:19,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe84200e/4b81a4bbea984f3189e113fcd00c9b66/FLAG1ae4f488a [2025-03-16 14:51:19,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe84200e/4b81a4bbea984f3189e113fcd00c9b66 [2025-03-16 14:51:19,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:51:19,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:51:19,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:51:19,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:51:19,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:51:19,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:51:19" (1/1) ... [2025-03-16 14:51:19,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f773c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:19, skipping insertion in model container [2025-03-16 14:51:19,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:51:19" (1/1) ... [2025-03-16 14:51:19,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:51:19,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label30.c[4279,4292] [2025-03-16 14:51:19,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:51:19,897 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:51:19,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label30.c[4279,4292] [2025-03-16 14:51:19,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:51:20,000 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:51:20,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20 WrapperNode [2025-03-16 14:51:20,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:51:20,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:51:20,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:51:20,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:51:20,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (1/1) ... [2025-03-16 14:51:20,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (1/1) ... [2025-03-16 14:51:20,089 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-16 14:51:20,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:51:20,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:51:20,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:51:20,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:51:20,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (1/1) ... [2025-03-16 14:51:20,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (1/1) ... [2025-03-16 14:51:20,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (1/1) ... [2025-03-16 14:51:20,189 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:51:20,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (1/1) ... [2025-03-16 14:51:20,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (1/1) ... [2025-03-16 14:51:20,216 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (1/1) ... [2025-03-16 14:51:20,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (1/1) ... [2025-03-16 14:51:20,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (1/1) ... [2025-03-16 14:51:20,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (1/1) ... [2025-03-16 14:51:20,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:51:20,249 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:51:20,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:51:20,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:51:20,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (1/1) ... [2025-03-16 14:51:20,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:51:20,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:20,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:51:20,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:51:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:51:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:51:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:51:20,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:51:20,345 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:51:20,347 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:51:21,617 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-16 14:51:21,617 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:51:21,627 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:51:21,627 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:51:21,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:51:21 BoogieIcfgContainer [2025-03-16 14:51:21,628 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:51:21,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:51:21,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:51:21,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:51:21,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:51:19" (1/3) ... [2025-03-16 14:51:21,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff60213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:51:21, skipping insertion in model container [2025-03-16 14:51:21,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:20" (2/3) ... [2025-03-16 14:51:21,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff60213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:51:21, skipping insertion in model container [2025-03-16 14:51:21,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:51:21" (3/3) ... [2025-03-16 14:51:21,637 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label30.c [2025-03-16 14:51:21,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:51:21,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label30.c that has 1 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:51:21,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:51:21,715 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;@7c138346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:51:21,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:51:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:21,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 14:51:21,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:21,725 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-03-16 14:51:21,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:21,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash -432312443, now seen corresponding path program 1 times [2025-03-16 14:51:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:21,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479334900] [2025-03-16 14:51:21,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:21,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 14:51:21,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 14:51:21,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:21,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479334900] [2025-03-16 14:51:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479334900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294061325] [2025-03-16 14:51:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:21,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:51:21,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:21,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:51:21,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:51:21,892 INFO L87 Difference]: Start difference. First operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 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-03-16 14:51:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:21,920 INFO L93 Difference]: Finished difference Result 443 states and 839 transitions. [2025-03-16 14:51:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:51:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 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-03-16 14:51:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:21,929 INFO L225 Difference]: With dead ends: 443 [2025-03-16 14:51:21,929 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 14:51:21,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:51:21,933 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:21,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:51:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 14:51:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-16 14:51:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2025-03-16 14:51:21,981 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 28 [2025-03-16 14:51:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:21,981 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2025-03-16 14:51:21,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 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-03-16 14:51:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2025-03-16 14:51:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 14:51:21,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:21,982 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-03-16 14:51:21,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:51:21,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:21,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash -493315485, now seen corresponding path program 1 times [2025-03-16 14:51:21,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:21,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482497664] [2025-03-16 14:51:21,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:21,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 14:51:22,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 14:51:22,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:22,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:22,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-03-16 14:51:22,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:22,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482497664] [2025-03-16 14:51:22,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482497664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:22,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:22,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:22,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199677771] [2025-03-16 14:51:22,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:22,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:22,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:22,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:22,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:22,151 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 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-03-16 14:51:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:22,960 INFO L93 Difference]: Finished difference Result 630 states and 1026 transitions. [2025-03-16 14:51:22,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:22,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 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-03-16 14:51:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:22,962 INFO L225 Difference]: With dead ends: 630 [2025-03-16 14:51:22,962 INFO L226 Difference]: Without dead ends: 412 [2025-03-16 14:51:22,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:22,964 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 195 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:22,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:51:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-16 14:51:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-03-16 14:51:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4549878345498783) internal successors, (598), 411 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 598 transitions. [2025-03-16 14:51:22,988 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 598 transitions. Word has length 28 [2025-03-16 14:51:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:22,989 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 598 transitions. [2025-03-16 14:51:22,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 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-03-16 14:51:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 598 transitions. [2025-03-16 14:51:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 14:51:22,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:22,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:22,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:51:22,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:22,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1884382098, now seen corresponding path program 1 times [2025-03-16 14:51:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:22,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147676111] [2025-03-16 14:51:22,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:23,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 14:51:23,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 14:51:23,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:23,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:23,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:23,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147676111] [2025-03-16 14:51:23,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147676111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:23,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:23,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:23,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820150448] [2025-03-16 14:51:23,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:23,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:23,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:23,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:23,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:23,211 INFO L87 Difference]: Start difference. First operand 412 states and 598 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:23,826 INFO L93 Difference]: Finished difference Result 1210 states and 1762 transitions. [2025-03-16 14:51:23,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:23,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 14:51:23,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:23,829 INFO L225 Difference]: With dead ends: 1210 [2025-03-16 14:51:23,829 INFO L226 Difference]: Without dead ends: 799 [2025-03-16 14:51:23,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:23,831 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:23,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 118 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-16 14:51:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 788. [2025-03-16 14:51:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3761118170266835) internal successors, (1083), 787 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1083 transitions. [2025-03-16 14:51:23,850 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1083 transitions. Word has length 96 [2025-03-16 14:51:23,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:23,851 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1083 transitions. [2025-03-16 14:51:23,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1083 transitions. [2025-03-16 14:51:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 14:51:23,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:23,854 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:23,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:51:23,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:23,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:23,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1450480620, now seen corresponding path program 1 times [2025-03-16 14:51:23,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:23,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061793544] [2025-03-16 14:51:23,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:23,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:23,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 14:51:23,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 14:51:23,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:23,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:24,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061793544] [2025-03-16 14:51:24,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061793544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:24,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:24,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:24,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277393970] [2025-03-16 14:51:24,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:24,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:24,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:24,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:24,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:24,223 INFO L87 Difference]: Start difference. First operand 788 states and 1083 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:25,204 INFO L93 Difference]: Finished difference Result 2504 states and 3427 transitions. [2025-03-16 14:51:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:25,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-16 14:51:25,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:25,209 INFO L225 Difference]: With dead ends: 2504 [2025-03-16 14:51:25,209 INFO L226 Difference]: Without dead ends: 1717 [2025-03-16 14:51:25,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:51:25,211 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 485 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:25,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 217 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:51:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2025-03-16 14:51:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1713. [2025-03-16 14:51:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1712 states have (on average 1.2266355140186915) internal successors, (2100), 1712 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2100 transitions. [2025-03-16 14:51:25,242 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2100 transitions. Word has length 97 [2025-03-16 14:51:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:25,243 INFO L471 AbstractCegarLoop]: Abstraction has 1713 states and 2100 transitions. [2025-03-16 14:51:25,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2100 transitions. [2025-03-16 14:51:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 14:51:25,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:25,248 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:25,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:51:25,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:25,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash 116946590, now seen corresponding path program 1 times [2025-03-16 14:51:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:25,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473497026] [2025-03-16 14:51:25,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:25,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:25,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 14:51:25,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 14:51:25,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:25,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:25,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:25,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473497026] [2025-03-16 14:51:25,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473497026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:25,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:25,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:25,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142914112] [2025-03-16 14:51:25,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:25,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:25,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:25,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:25,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:25,438 INFO L87 Difference]: Start difference. First operand 1713 states and 2100 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:26,418 INFO L93 Difference]: Finished difference Result 5295 states and 6686 transitions. [2025-03-16 14:51:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:26,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-03-16 14:51:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:26,429 INFO L225 Difference]: With dead ends: 5295 [2025-03-16 14:51:26,429 INFO L226 Difference]: Without dead ends: 3767 [2025-03-16 14:51:26,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:26,433 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 335 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:26,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 93 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:51:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2025-03-16 14:51:26,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3766. [2025-03-16 14:51:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3766 states, 3765 states have (on average 1.2292164674634793) internal successors, (4628), 3765 states have internal predecessors, (4628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 4628 transitions. [2025-03-16 14:51:26,491 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 4628 transitions. Word has length 155 [2025-03-16 14:51:26,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:26,491 INFO L471 AbstractCegarLoop]: Abstraction has 3766 states and 4628 transitions. [2025-03-16 14:51:26,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 4628 transitions. [2025-03-16 14:51:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 14:51:26,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:26,497 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:26,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:51:26,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:26,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:26,498 INFO L85 PathProgramCache]: Analyzing trace with hash -674169679, now seen corresponding path program 1 times [2025-03-16 14:51:26,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:26,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464705472] [2025-03-16 14:51:26,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:26,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:26,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 14:51:26,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 14:51:26,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:26,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:26,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464705472] [2025-03-16 14:51:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464705472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:26,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:26,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721035896] [2025-03-16 14:51:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:26,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:26,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:26,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:26,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:26,706 INFO L87 Difference]: Start difference. First operand 3766 states and 4628 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:27,216 INFO L93 Difference]: Finished difference Result 8651 states and 10853 transitions. [2025-03-16 14:51:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:27,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2025-03-16 14:51:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:27,234 INFO L225 Difference]: With dead ends: 8651 [2025-03-16 14:51:27,234 INFO L226 Difference]: Without dead ends: 5255 [2025-03-16 14:51:27,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:27,239 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:27,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 344 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2025-03-16 14:51:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 5240. [2025-03-16 14:51:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5240 states, 5239 states have (on average 1.2082458484443597) internal successors, (6330), 5239 states have internal predecessors, (6330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 6330 transitions. [2025-03-16 14:51:27,309 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 6330 transitions. Word has length 208 [2025-03-16 14:51:27,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:27,309 INFO L471 AbstractCegarLoop]: Abstraction has 5240 states and 6330 transitions. [2025-03-16 14:51:27,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 6330 transitions. [2025-03-16 14:51:27,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-16 14:51:27,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:27,312 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:27,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:51:27,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:27,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:27,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1706366001, now seen corresponding path program 1 times [2025-03-16 14:51:27,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:27,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464276300] [2025-03-16 14:51:27,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:27,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:27,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-16 14:51:27,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-16 14:51:27,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:27,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 14:51:27,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:27,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464276300] [2025-03-16 14:51:27,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464276300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:27,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:27,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:27,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444899932] [2025-03-16 14:51:27,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:27,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:27,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:27,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:27,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:27,484 INFO L87 Difference]: Start difference. First operand 5240 states and 6330 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:28,024 INFO L93 Difference]: Finished difference Result 11048 states and 13479 transitions. [2025-03-16 14:51:28,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:28,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 209 [2025-03-16 14:51:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:28,040 INFO L225 Difference]: With dead ends: 11048 [2025-03-16 14:51:28,040 INFO L226 Difference]: Without dead ends: 6178 [2025-03-16 14:51:28,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:28,046 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 173 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:28,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 345 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2025-03-16 14:51:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 6160. [2025-03-16 14:51:28,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6160 states, 6159 states have (on average 1.206364669589219) internal successors, (7430), 6159 states have internal predecessors, (7430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6160 states to 6160 states and 7430 transitions. [2025-03-16 14:51:28,125 INFO L78 Accepts]: Start accepts. Automaton has 6160 states and 7430 transitions. Word has length 209 [2025-03-16 14:51:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:28,126 INFO L471 AbstractCegarLoop]: Abstraction has 6160 states and 7430 transitions. [2025-03-16 14:51:28,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 6160 states and 7430 transitions. [2025-03-16 14:51:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-16 14:51:28,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:28,128 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:28,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:51:28,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:28,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:28,128 INFO L85 PathProgramCache]: Analyzing trace with hash -454184234, now seen corresponding path program 1 times [2025-03-16 14:51:28,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:28,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585616678] [2025-03-16 14:51:28,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:28,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-16 14:51:28,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-16 14:51:28,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:28,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 14:51:28,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:28,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585616678] [2025-03-16 14:51:28,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585616678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:28,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:28,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:28,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503035445] [2025-03-16 14:51:28,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:28,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:28,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:28,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:28,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:28,314 INFO L87 Difference]: Start difference. First operand 6160 states and 7430 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:28,924 INFO L93 Difference]: Finished difference Result 13248 states and 16225 transitions. [2025-03-16 14:51:28,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:28,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 210 [2025-03-16 14:51:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:28,940 INFO L225 Difference]: With dead ends: 13248 [2025-03-16 14:51:28,941 INFO L226 Difference]: Without dead ends: 7458 [2025-03-16 14:51:28,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:28,946 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 168 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:28,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 369 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7458 states. [2025-03-16 14:51:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7458 to 7264. [2025-03-16 14:51:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7264 states, 7263 states have (on average 1.201431915186562) internal successors, (8726), 7263 states have internal predecessors, (8726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7264 states to 7264 states and 8726 transitions. [2025-03-16 14:51:29,027 INFO L78 Accepts]: Start accepts. Automaton has 7264 states and 8726 transitions. Word has length 210 [2025-03-16 14:51:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:29,027 INFO L471 AbstractCegarLoop]: Abstraction has 7264 states and 8726 transitions. [2025-03-16 14:51:29,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 7264 states and 8726 transitions. [2025-03-16 14:51:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-16 14:51:29,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:29,030 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:29,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:51:29,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:29,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:29,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1687708600, now seen corresponding path program 1 times [2025-03-16 14:51:29,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:29,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614610118] [2025-03-16 14:51:29,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:29,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-16 14:51:29,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-16 14:51:29,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:29,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:29,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614610118] [2025-03-16 14:51:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614610118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:29,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:29,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:51:29,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136370196] [2025-03-16 14:51:29,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:29,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:29,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:29,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:29,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:29,355 INFO L87 Difference]: Start difference. First operand 7264 states and 8726 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:30,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:30,316 INFO L93 Difference]: Finished difference Result 20642 states and 25401 transitions. [2025-03-16 14:51:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:30,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2025-03-16 14:51:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:30,341 INFO L225 Difference]: With dead ends: 20642 [2025-03-16 14:51:30,341 INFO L226 Difference]: Without dead ends: 13748 [2025-03-16 14:51:30,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:30,352 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 306 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:30,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 208 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:51:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13748 states. [2025-03-16 14:51:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13748 to 13744. [2025-03-16 14:51:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13744 states, 13743 states have (on average 1.1905697445972494) internal successors, (16362), 13743 states have internal predecessors, (16362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13744 states to 13744 states and 16362 transitions. [2025-03-16 14:51:30,540 INFO L78 Accepts]: Start accepts. Automaton has 13744 states and 16362 transitions. Word has length 230 [2025-03-16 14:51:30,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:30,540 INFO L471 AbstractCegarLoop]: Abstraction has 13744 states and 16362 transitions. [2025-03-16 14:51:30,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 13744 states and 16362 transitions. [2025-03-16 14:51:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-16 14:51:30,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:30,544 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:30,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:51:30,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:30,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:30,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1125670273, now seen corresponding path program 1 times [2025-03-16 14:51:30,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:30,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482625022] [2025-03-16 14:51:30,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:30,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:30,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-16 14:51:30,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-16 14:51:30,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:30,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:30,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:30,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482625022] [2025-03-16 14:51:30,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482625022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:30,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:30,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:51:30,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163152734] [2025-03-16 14:51:30,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:30,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:30,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:30,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:30,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:30,776 INFO L87 Difference]: Start difference. First operand 13744 states and 16362 transitions. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:31,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:31,868 INFO L93 Difference]: Finished difference Result 32286 states and 39113 transitions. [2025-03-16 14:51:31,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:31,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 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 240 [2025-03-16 14:51:31,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:31,897 INFO L225 Difference]: With dead ends: 32286 [2025-03-16 14:51:31,897 INFO L226 Difference]: Without dead ends: 18912 [2025-03-16 14:51:31,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:31,909 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 315 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:31,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 129 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 14:51:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18912 states. [2025-03-16 14:51:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18912 to 18897. [2025-03-16 14:51:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18897 states, 18896 states have (on average 1.1981900931414056) internal successors, (22641), 18896 states have internal predecessors, (22641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18897 states to 18897 states and 22641 transitions. [2025-03-16 14:51:32,079 INFO L78 Accepts]: Start accepts. Automaton has 18897 states and 22641 transitions. Word has length 240 [2025-03-16 14:51:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:32,079 INFO L471 AbstractCegarLoop]: Abstraction has 18897 states and 22641 transitions. [2025-03-16 14:51:32,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 18897 states and 22641 transitions. [2025-03-16 14:51:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-16 14:51:32,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:32,083 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:32,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:51:32,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:32,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:32,084 INFO L85 PathProgramCache]: Analyzing trace with hash 701581124, now seen corresponding path program 1 times [2025-03-16 14:51:32,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:32,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122373473] [2025-03-16 14:51:32,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:32,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:32,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-16 14:51:32,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-16 14:51:32,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:32,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 14:51:32,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:32,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122373473] [2025-03-16 14:51:32,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122373473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:32,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:32,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:32,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784984024] [2025-03-16 14:51:32,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:32,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:32,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:32,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:32,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:32,204 INFO L87 Difference]: Start difference. First operand 18897 states and 22641 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:32,923 INFO L93 Difference]: Finished difference Result 37621 states and 45116 transitions. [2025-03-16 14:51:32,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:32,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2025-03-16 14:51:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:32,951 INFO L225 Difference]: With dead ends: 37621 [2025-03-16 14:51:32,952 INFO L226 Difference]: Without dead ends: 18909 [2025-03-16 14:51:32,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:32,967 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 172 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:32,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 376 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:32,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18909 states. [2025-03-16 14:51:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18909 to 18712. [2025-03-16 14:51:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18712 states, 18711 states have (on average 1.1626850515739404) internal successors, (21755), 18711 states have internal predecessors, (21755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:33,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18712 states to 18712 states and 21755 transitions. [2025-03-16 14:51:33,128 INFO L78 Accepts]: Start accepts. Automaton has 18712 states and 21755 transitions. Word has length 247 [2025-03-16 14:51:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:33,129 INFO L471 AbstractCegarLoop]: Abstraction has 18712 states and 21755 transitions. [2025-03-16 14:51:33,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 18712 states and 21755 transitions. [2025-03-16 14:51:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-16 14:51:33,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:33,133 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:33,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:51:33,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:33,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1501867015, now seen corresponding path program 1 times [2025-03-16 14:51:33,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051458361] [2025-03-16 14:51:33,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:33,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:33,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 14:51:33,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 14:51:33,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:33,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:33,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:33,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051458361] [2025-03-16 14:51:33,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051458361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:33,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:33,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:33,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364516288] [2025-03-16 14:51:33,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:33,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:33,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:33,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:33,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:33,459 INFO L87 Difference]: Start difference. First operand 18712 states and 21755 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:34,323 INFO L93 Difference]: Finished difference Result 39442 states and 46208 transitions. [2025-03-16 14:51:34,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:34,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-03-16 14:51:34,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:34,356 INFO L225 Difference]: With dead ends: 39442 [2025-03-16 14:51:34,356 INFO L226 Difference]: Without dead ends: 20547 [2025-03-16 14:51:34,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:34,371 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 215 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:34,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 169 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:51:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20547 states. [2025-03-16 14:51:34,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20547 to 18322. [2025-03-16 14:51:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18322 states, 18321 states have (on average 1.125648163309863) internal successors, (20623), 18321 states have internal predecessors, (20623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18322 states to 18322 states and 20623 transitions. [2025-03-16 14:51:34,613 INFO L78 Accepts]: Start accepts. Automaton has 18322 states and 20623 transitions. Word has length 261 [2025-03-16 14:51:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:34,613 INFO L471 AbstractCegarLoop]: Abstraction has 18322 states and 20623 transitions. [2025-03-16 14:51:34,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 18322 states and 20623 transitions. [2025-03-16 14:51:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-16 14:51:34,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:34,619 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:34,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:51:34,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:34,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:34,620 INFO L85 PathProgramCache]: Analyzing trace with hash -75316823, now seen corresponding path program 1 times [2025-03-16 14:51:34,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:34,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803313322] [2025-03-16 14:51:34,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:34,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-16 14:51:34,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-16 14:51:34,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:34,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-16 14:51:34,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:34,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803313322] [2025-03-16 14:51:34,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803313322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:34,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:34,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:34,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900806501] [2025-03-16 14:51:34,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:34,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:34,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:34,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:34,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:34,742 INFO L87 Difference]: Start difference. First operand 18322 states and 20623 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:35,314 INFO L93 Difference]: Finished difference Result 38294 states and 43085 transitions. [2025-03-16 14:51:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:35,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 295 [2025-03-16 14:51:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:35,344 INFO L225 Difference]: With dead ends: 38294 [2025-03-16 14:51:35,344 INFO L226 Difference]: Without dead ends: 22369 [2025-03-16 14:51:35,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:35,357 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 192 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:35,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 147 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22369 states. [2025-03-16 14:51:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22369 to 14081. [2025-03-16 14:51:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14081 states, 14080 states have (on average 1.1338068181818182) internal successors, (15964), 14080 states have internal predecessors, (15964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14081 states to 14081 states and 15964 transitions. [2025-03-16 14:51:35,513 INFO L78 Accepts]: Start accepts. Automaton has 14081 states and 15964 transitions. Word has length 295 [2025-03-16 14:51:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:35,514 INFO L471 AbstractCegarLoop]: Abstraction has 14081 states and 15964 transitions. [2025-03-16 14:51:35,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 14081 states and 15964 transitions. [2025-03-16 14:51:35,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-16 14:51:35,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:35,521 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:35,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:51:35,522 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:35,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:35,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1610213105, now seen corresponding path program 1 times [2025-03-16 14:51:35,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:35,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688026253] [2025-03-16 14:51:35,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:35,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:35,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-16 14:51:35,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-16 14:51:35,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:35,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 56 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:35,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688026253] [2025-03-16 14:51:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688026253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739675993] [2025-03-16 14:51:35,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:35,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:35,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:35,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:51:35,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:51:35,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-16 14:51:36,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-16 14:51:36,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:36,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:36,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:51:36,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-16 14:51:36,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:51:36,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739675993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:36,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:51:36,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 14:51:36,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026085950] [2025-03-16 14:51:36,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:36,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:36,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:36,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:36,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:51:36,079 INFO L87 Difference]: Start difference. First operand 14081 states and 15964 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:36,587 INFO L93 Difference]: Finished difference Result 28897 states and 32762 transitions. [2025-03-16 14:51:36,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:36,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 308 [2025-03-16 14:51:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:36,603 INFO L225 Difference]: With dead ends: 28897 [2025-03-16 14:51:36,603 INFO L226 Difference]: Without dead ends: 14817 [2025-03-16 14:51:36,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:51:36,613 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 162 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:36,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 380 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14817 states. [2025-03-16 14:51:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14817 to 14449. [2025-03-16 14:51:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14449 states, 14448 states have (on average 1.1315060908084165) internal successors, (16348), 14448 states have internal predecessors, (16348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14449 states to 14449 states and 16348 transitions. [2025-03-16 14:51:36,730 INFO L78 Accepts]: Start accepts. Automaton has 14449 states and 16348 transitions. Word has length 308 [2025-03-16 14:51:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:36,731 INFO L471 AbstractCegarLoop]: Abstraction has 14449 states and 16348 transitions. [2025-03-16 14:51:36,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 14449 states and 16348 transitions. [2025-03-16 14:51:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-16 14:51:36,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:36,737 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:36,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:51:36,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 14:51:36,938 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:36,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:36,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1568151365, now seen corresponding path program 1 times [2025-03-16 14:51:36,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:36,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180919323] [2025-03-16 14:51:36,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:36,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:36,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-16 14:51:36,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-16 14:51:36,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:36,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 225 proven. 29 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:51:37,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:37,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180919323] [2025-03-16 14:51:37,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180919323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:37,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971007170] [2025-03-16 14:51:37,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:37,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:37,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:37,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:51:37,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:51:37,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-16 14:51:37,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-16 14:51:37,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:37,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:37,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:51:37,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:51:38,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:51:38,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971007170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:38,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:51:38,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:51:38,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019182706] [2025-03-16 14:51:38,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:38,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:38,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:38,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:38,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:51:38,108 INFO L87 Difference]: Start difference. First operand 14449 states and 16348 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:38,765 INFO L93 Difference]: Finished difference Result 33877 states and 38196 transitions. [2025-03-16 14:51:38,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:38,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 315 [2025-03-16 14:51:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:38,783 INFO L225 Difference]: With dead ends: 33877 [2025-03-16 14:51:38,783 INFO L226 Difference]: Without dead ends: 19429 [2025-03-16 14:51:38,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:51:38,794 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 192 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:38,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 172 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19429 states. [2025-03-16 14:51:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19429 to 19425. [2025-03-16 14:51:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19425 states, 19424 states have (on average 1.123404036243822) internal successors, (21821), 19424 states have internal predecessors, (21821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19425 states to 19425 states and 21821 transitions. [2025-03-16 14:51:38,981 INFO L78 Accepts]: Start accepts. Automaton has 19425 states and 21821 transitions. Word has length 315 [2025-03-16 14:51:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:38,981 INFO L471 AbstractCegarLoop]: Abstraction has 19425 states and 21821 transitions. [2025-03-16 14:51:38,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 19425 states and 21821 transitions. [2025-03-16 14:51:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-16 14:51:38,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:38,987 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:38,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:51:39,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 14:51:39,188 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:39,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1119692554, now seen corresponding path program 1 times [2025-03-16 14:51:39,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:39,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220044743] [2025-03-16 14:51:39,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:39,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:39,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-16 14:51:39,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-16 14:51:39,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:39,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:51:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220044743] [2025-03-16 14:51:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220044743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:39,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:39,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734883407] [2025-03-16 14:51:39,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:39,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:39,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:39,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:39,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:39,385 INFO L87 Difference]: Start difference. First operand 19425 states and 21821 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:39,999 INFO L93 Difference]: Finished difference Result 39784 states and 44747 transitions. [2025-03-16 14:51:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:39,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 326 [2025-03-16 14:51:39,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:40,022 INFO L225 Difference]: With dead ends: 39784 [2025-03-16 14:51:40,022 INFO L226 Difference]: Without dead ends: 22756 [2025-03-16 14:51:40,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:40,040 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 195 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:40,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 144 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:40,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22756 states. [2025-03-16 14:51:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22756 to 19237. [2025-03-16 14:51:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19237 states, 19236 states have (on average 1.1226346433770014) internal successors, (21595), 19236 states have internal predecessors, (21595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19237 states to 19237 states and 21595 transitions. [2025-03-16 14:51:40,276 INFO L78 Accepts]: Start accepts. Automaton has 19237 states and 21595 transitions. Word has length 326 [2025-03-16 14:51:40,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:40,276 INFO L471 AbstractCegarLoop]: Abstraction has 19237 states and 21595 transitions. [2025-03-16 14:51:40,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 19237 states and 21595 transitions. [2025-03-16 14:51:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-16 14:51:40,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:40,282 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:40,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:51:40,282 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:40,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1850936376, now seen corresponding path program 1 times [2025-03-16 14:51:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379761951] [2025-03-16 14:51:40,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:40,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:40,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-16 14:51:40,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-16 14:51:40,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:40,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-16 14:51:40,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:40,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379761951] [2025-03-16 14:51:40,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379761951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:40,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:40,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 14:51:40,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303301072] [2025-03-16 14:51:40,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:40,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:51:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:40,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:51:40,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:51:40,611 INFO L87 Difference]: Start difference. First operand 19237 states and 21595 transitions. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:41,216 INFO L93 Difference]: Finished difference Result 36925 states and 41513 transitions. [2025-03-16 14:51:41,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 14:51:41,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332 [2025-03-16 14:51:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:41,235 INFO L225 Difference]: With dead ends: 36925 [2025-03-16 14:51:41,235 INFO L226 Difference]: Without dead ends: 17747 [2025-03-16 14:51:41,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:51:41,246 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 217 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:41,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 108 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:41,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17747 states. [2025-03-16 14:51:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17747 to 17735. [2025-03-16 14:51:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17735 states, 17734 states have (on average 1.1225329874816736) internal successors, (19907), 17734 states have internal predecessors, (19907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17735 states to 17735 states and 19907 transitions. [2025-03-16 14:51:41,441 INFO L78 Accepts]: Start accepts. Automaton has 17735 states and 19907 transitions. Word has length 332 [2025-03-16 14:51:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:41,441 INFO L471 AbstractCegarLoop]: Abstraction has 17735 states and 19907 transitions. [2025-03-16 14:51:41,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:41,441 INFO L276 IsEmpty]: Start isEmpty. Operand 17735 states and 19907 transitions. [2025-03-16 14:51:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-03-16 14:51:41,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:41,448 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:41,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:51:41,448 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:41,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:41,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1369903038, now seen corresponding path program 1 times [2025-03-16 14:51:41,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:41,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718353803] [2025-03-16 14:51:41,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:41,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:41,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-16 14:51:41,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-16 14:51:41,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:41,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 14:51:41,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:41,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718353803] [2025-03-16 14:51:41,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718353803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:41,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:41,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:51:41,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306481173] [2025-03-16 14:51:41,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:41,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:41,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:41,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:41,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:41,711 INFO L87 Difference]: Start difference. First operand 17735 states and 19907 transitions. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:42,647 INFO L93 Difference]: Finished difference Result 38606 states and 43437 transitions. [2025-03-16 14:51:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:42,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2025-03-16 14:51:42,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:42,670 INFO L225 Difference]: With dead ends: 38606 [2025-03-16 14:51:42,670 INFO L226 Difference]: Without dead ends: 21605 [2025-03-16 14:51:42,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:42,680 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 302 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:42,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 338 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:51:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21605 states. [2025-03-16 14:51:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21605 to 17724. [2025-03-16 14:51:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17724 states, 17723 states have (on average 1.0964847937708062) internal successors, (19433), 17723 states have internal predecessors, (19433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17724 states to 17724 states and 19433 transitions. [2025-03-16 14:51:42,897 INFO L78 Accepts]: Start accepts. Automaton has 17724 states and 19433 transitions. Word has length 337 [2025-03-16 14:51:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:42,898 INFO L471 AbstractCegarLoop]: Abstraction has 17724 states and 19433 transitions. [2025-03-16 14:51:42,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 17724 states and 19433 transitions. [2025-03-16 14:51:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-16 14:51:42,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:42,910 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:42,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:51:42,910 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:42,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:42,910 INFO L85 PathProgramCache]: Analyzing trace with hash 874676118, now seen corresponding path program 1 times [2025-03-16 14:51:42,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:42,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975257582] [2025-03-16 14:51:42,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:42,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:42,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-16 14:51:42,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-16 14:51:42,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:42,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 507 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-16 14:51:43,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:43,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975257582] [2025-03-16 14:51:43,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975257582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:43,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:43,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:43,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592398649] [2025-03-16 14:51:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:43,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:43,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:43,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:43,168 INFO L87 Difference]: Start difference. First operand 17724 states and 19433 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:43,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:43,628 INFO L93 Difference]: Finished difference Result 37287 states and 40945 transitions. [2025-03-16 14:51:43,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:43,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 432 [2025-03-16 14:51:43,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:43,646 INFO L225 Difference]: With dead ends: 37287 [2025-03-16 14:51:43,646 INFO L226 Difference]: Without dead ends: 19932 [2025-03-16 14:51:43,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:43,658 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 107 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:43,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 349 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19932 states. [2025-03-16 14:51:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19932 to 18828. [2025-03-16 14:51:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18828 states, 18827 states have (on average 1.0930047272534127) internal successors, (20578), 18827 states have internal predecessors, (20578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18828 states to 18828 states and 20578 transitions. [2025-03-16 14:51:43,795 INFO L78 Accepts]: Start accepts. Automaton has 18828 states and 20578 transitions. Word has length 432 [2025-03-16 14:51:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:43,795 INFO L471 AbstractCegarLoop]: Abstraction has 18828 states and 20578 transitions. [2025-03-16 14:51:43,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 18828 states and 20578 transitions. [2025-03-16 14:51:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-16 14:51:43,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:43,804 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:43,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:51:43,805 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:43,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash 945163428, now seen corresponding path program 1 times [2025-03-16 14:51:43,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:43,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179843392] [2025-03-16 14:51:43,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:43,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:43,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-16 14:51:43,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-16 14:51:43,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:43,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 154 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:44,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:44,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179843392] [2025-03-16 14:51:44,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179843392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:44,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393237993] [2025-03-16 14:51:44,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:44,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:44,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:44,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:51:44,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:51:44,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-16 14:51:44,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-16 14:51:44,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:44,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:44,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 14:51:44,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 154 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:45,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:51:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 170 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:48,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393237993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:51:48,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:51:48,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-16 14:51:48,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672835285] [2025-03-16 14:51:48,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:51:48,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 14:51:48,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:48,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 14:51:48,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:51:48,131 INFO L87 Difference]: Start difference. First operand 18828 states and 20578 transitions. Second operand has 13 states, 13 states have (on average 99.3076923076923) internal successors, (1291), 12 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:51,319 INFO L93 Difference]: Finished difference Result 41707 states and 45567 transitions. [2025-03-16 14:51:51,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 14:51:51,319 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 99.3076923076923) internal successors, (1291), 12 states have internal predecessors, (1291), 0 states have call successors, (0), 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 440 [2025-03-16 14:51:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:51,341 INFO L225 Difference]: With dead ends: 41707 [2025-03-16 14:51:51,342 INFO L226 Difference]: Without dead ends: 25274 [2025-03-16 14:51:51,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2025-03-16 14:51:51,354 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1360 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 6072 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 6641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 6072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:51,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 193 Invalid, 6641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 6072 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 14:51:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25274 states. [2025-03-16 14:51:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25274 to 20112. [2025-03-16 14:51:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20112 states, 20111 states have (on average 1.0894038088608224) internal successors, (21909), 20111 states have internal predecessors, (21909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20112 states to 20112 states and 21909 transitions. [2025-03-16 14:51:51,537 INFO L78 Accepts]: Start accepts. Automaton has 20112 states and 21909 transitions. Word has length 440 [2025-03-16 14:51:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:51,537 INFO L471 AbstractCegarLoop]: Abstraction has 20112 states and 21909 transitions. [2025-03-16 14:51:51,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 99.3076923076923) internal successors, (1291), 12 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 20112 states and 21909 transitions. [2025-03-16 14:51:51,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-16 14:51:51,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:51,552 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:51,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 14:51:51,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:51,752 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:51,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2036541435, now seen corresponding path program 1 times [2025-03-16 14:51:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033307088] [2025-03-16 14:51:51,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:51,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-16 14:51:51,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-16 14:51:51,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:51,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-16 14:51:51,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:51,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033307088] [2025-03-16 14:51:51,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033307088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:51,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:51,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:51,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786184118] [2025-03-16 14:51:51,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:51,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:51,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:51,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:51,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:51,955 INFO L87 Difference]: Start difference. First operand 20112 states and 21909 transitions. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:52,674 INFO L93 Difference]: Finished difference Result 39129 states and 42643 transitions. [2025-03-16 14:51:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:52,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 530 [2025-03-16 14:51:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:52,750 INFO L225 Difference]: With dead ends: 39129 [2025-03-16 14:51:52,750 INFO L226 Difference]: Without dead ends: 21780 [2025-03-16 14:51:52,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:52,754 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 166 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:52,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 61 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21780 states. [2025-03-16 14:51:52,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21780 to 19928. [2025-03-16 14:51:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19928 states, 19927 states have (on average 1.088272193506298) internal successors, (21686), 19927 states have internal predecessors, (21686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19928 states to 19928 states and 21686 transitions. [2025-03-16 14:51:52,893 INFO L78 Accepts]: Start accepts. Automaton has 19928 states and 21686 transitions. Word has length 530 [2025-03-16 14:51:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:52,894 INFO L471 AbstractCegarLoop]: Abstraction has 19928 states and 21686 transitions. [2025-03-16 14:51:52,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 19928 states and 21686 transitions. [2025-03-16 14:51:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-03-16 14:51:52,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:52,905 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:52,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 14:51:52,905 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:52,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:52,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1048241506, now seen corresponding path program 1 times [2025-03-16 14:51:52,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:52,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577500810] [2025-03-16 14:51:52,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:52,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:52,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-03-16 14:51:52,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-03-16 14:51:52,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:52,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-03-16 14:51:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577500810] [2025-03-16 14:51:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577500810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:53,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108910372] [2025-03-16 14:51:53,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:53,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:53,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:53,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:53,108 INFO L87 Difference]: Start difference. First operand 19928 states and 21686 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:53,554 INFO L93 Difference]: Finished difference Result 37844 states and 41168 transitions. [2025-03-16 14:51:53,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:53,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 544 [2025-03-16 14:51:53,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:53,576 INFO L225 Difference]: With dead ends: 37844 [2025-03-16 14:51:53,577 INFO L226 Difference]: Without dead ends: 20495 [2025-03-16 14:51:53,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:53,589 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 104 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:53,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 149 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20495 states. [2025-03-16 14:51:53,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20495 to 12930. [2025-03-16 14:51:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12930 states, 12929 states have (on average 1.0876324541727898) internal successors, (14062), 12929 states have internal predecessors, (14062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12930 states to 12930 states and 14062 transitions. [2025-03-16 14:51:53,721 INFO L78 Accepts]: Start accepts. Automaton has 12930 states and 14062 transitions. Word has length 544 [2025-03-16 14:51:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:53,722 INFO L471 AbstractCegarLoop]: Abstraction has 12930 states and 14062 transitions. [2025-03-16 14:51:53,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 12930 states and 14062 transitions. [2025-03-16 14:51:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-03-16 14:51:53,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:53,730 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:53,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 14:51:53,731 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:53,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash 330753035, now seen corresponding path program 1 times [2025-03-16 14:51:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:53,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982448173] [2025-03-16 14:51:53,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:53,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:53,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-03-16 14:51:53,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-03-16 14:51:53,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:53,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-03-16 14:51:53,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982448173] [2025-03-16 14:51:53,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982448173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:53,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:53,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:53,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226945116] [2025-03-16 14:51:53,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:53,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:53,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:53,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:53,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:53,949 INFO L87 Difference]: Start difference. First operand 12930 states and 14062 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:54,398 INFO L93 Difference]: Finished difference Result 27147 states and 29460 transitions. [2025-03-16 14:51:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:54,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 545 [2025-03-16 14:51:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:54,412 INFO L225 Difference]: With dead ends: 27147 [2025-03-16 14:51:54,412 INFO L226 Difference]: Without dead ends: 14034 [2025-03-16 14:51:54,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:54,422 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 99 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:54,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 128 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14034 states. [2025-03-16 14:51:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14034 to 11820. [2025-03-16 14:51:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11820 states, 11819 states have (on average 1.0866401556815297) internal successors, (12843), 11819 states have internal predecessors, (12843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11820 states to 11820 states and 12843 transitions. [2025-03-16 14:51:54,559 INFO L78 Accepts]: Start accepts. Automaton has 11820 states and 12843 transitions. Word has length 545 [2025-03-16 14:51:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:54,559 INFO L471 AbstractCegarLoop]: Abstraction has 11820 states and 12843 transitions. [2025-03-16 14:51:54,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 11820 states and 12843 transitions. [2025-03-16 14:51:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-03-16 14:51:54,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:54,572 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:54,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 14:51:54,572 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:54,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash 145798335, now seen corresponding path program 1 times [2025-03-16 14:51:54,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:54,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914763659] [2025-03-16 14:51:54,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:54,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:54,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-03-16 14:51:54,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-03-16 14:51:54,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:54,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2025-03-16 14:51:54,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:54,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914763659] [2025-03-16 14:51:54,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914763659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:54,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:54,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405880832] [2025-03-16 14:51:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:54,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:54,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:54,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:54,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:54,758 INFO L87 Difference]: Start difference. First operand 11820 states and 12843 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 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-03-16 14:51:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:55,171 INFO L93 Difference]: Finished difference Result 22898 states and 24837 transitions. [2025-03-16 14:51:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:55,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 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) Word has length 595 [2025-03-16 14:51:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:55,178 INFO L225 Difference]: With dead ends: 22898 [2025-03-16 14:51:55,178 INFO L226 Difference]: Without dead ends: 11079 [2025-03-16 14:51:55,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:55,183 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 190 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:55,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 314 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11079 states. [2025-03-16 14:51:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11079 to 11079. [2025-03-16 14:51:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11079 states, 11078 states have (on average 1.0779021484022386) internal successors, (11941), 11078 states have internal predecessors, (11941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11079 states to 11079 states and 11941 transitions. [2025-03-16 14:51:55,248 INFO L78 Accepts]: Start accepts. Automaton has 11079 states and 11941 transitions. Word has length 595 [2025-03-16 14:51:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:55,248 INFO L471 AbstractCegarLoop]: Abstraction has 11079 states and 11941 transitions. [2025-03-16 14:51:55,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 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-03-16 14:51:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 11079 states and 11941 transitions. [2025-03-16 14:51:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2025-03-16 14:51:55,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:55,256 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:55,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 14:51:55,256 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:55,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:55,257 INFO L85 PathProgramCache]: Analyzing trace with hash 512212074, now seen corresponding path program 1 times [2025-03-16 14:51:55,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:55,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17614782] [2025-03-16 14:51:55,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:55,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:55,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 678 statements into 1 equivalence classes. [2025-03-16 14:51:55,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 678 of 678 statements. [2025-03-16 14:51:55,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:55,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 979 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-16 14:51:55,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:55,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17614782] [2025-03-16 14:51:55,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17614782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:55,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:55,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:55,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167020739] [2025-03-16 14:51:55,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:55,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:55,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:55,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:55,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:55,435 INFO L87 Difference]: Start difference. First operand 11079 states and 11941 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:55,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:55,852 INFO L93 Difference]: Finished difference Result 22154 states and 23844 transitions. [2025-03-16 14:51:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:55,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 678 [2025-03-16 14:51:55,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:55,853 INFO L225 Difference]: With dead ends: 22154 [2025-03-16 14:51:55,853 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:51:55,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:55,861 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 52 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:55,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 304 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:55,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:51:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:51:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:51:55,862 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 678 [2025-03-16 14:51:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:55,862 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:51:55,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:51:55,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:51:55,864 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:51:55,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 14:51:55,866 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] [2025-03-16 14:51:55,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:52:01,946 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:52:01,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:52:01 BoogieIcfgContainer [2025-03-16 14:52:01,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:52:01,968 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:52:01,968 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:52:01,968 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:52:01,969 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:51:21" (3/4) ... [2025-03-16 14:52:01,970 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:52:02,001 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:52:02,002 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:52:02,002 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:52:02,003 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:52:02,169 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:52:02,169 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:52:02,169 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:52:02,170 INFO L158 Benchmark]: Toolchain (without parser) took 42633.92ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 111.8MB in the beginning and 231.1MB in the end (delta: -119.3MB). Peak memory consumption was 586.8MB. Max. memory is 16.1GB. [2025-03-16 14:52:02,170 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:52:02,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.78ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 68.0MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 14:52:02,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.30ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 51.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:52:02,170 INFO L158 Benchmark]: Boogie Preprocessor took 157.94ms. Allocated memory is still 142.6MB. Free memory was 50.8MB in the beginning and 89.7MB in the end (delta: -38.9MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2025-03-16 14:52:02,170 INFO L158 Benchmark]: IcfgBuilder took 1378.75ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 89.7MB in the beginning and 275.8MB in the end (delta: -186.2MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. [2025-03-16 14:52:02,171 INFO L158 Benchmark]: TraceAbstraction took 40337.95ms. Allocated memory was 427.8MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 274.9MB in the beginning and 910.1MB in the end (delta: -635.2MB). Peak memory consumption was 936.9MB. Max. memory is 16.1GB. [2025-03-16 14:52:02,171 INFO L158 Benchmark]: Witness Printer took 201.30ms. Allocated memory was 1.5GB in the beginning and 335.5MB in the end (delta: -1.2GB). Free memory was 910.1MB in the beginning and 231.1MB in the end (delta: 679.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:52:02,172 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.55ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.78ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 68.0MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.30ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 51.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 157.94ms. Allocated memory is still 142.6MB. Free memory was 50.8MB in the beginning and 89.7MB in the end (delta: -38.9MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * IcfgBuilder took 1378.75ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 89.7MB in the beginning and 275.8MB in the end (delta: -186.2MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. * TraceAbstraction took 40337.95ms. Allocated memory was 427.8MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 274.9MB in the beginning and 910.1MB in the end (delta: -635.2MB). Peak memory consumption was 936.9MB. Max. memory is 16.1GB. * Witness Printer took 201.30ms. Allocated memory was 1.5GB in the beginning and 335.5MB in the end (delta: -1.2GB). Free memory was 910.1MB in the beginning and 231.1MB in the end (delta: 679.1MB). 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: 103]: 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, 222 locations, 420 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.2s, OverallIterations: 25, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5982 SdHoareTripleChecker+Valid, 16.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5982 mSDsluCounter, 5670 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 853 mSDsCounter, 2642 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23484 IncrementalHoareTripleChecker+Invalid, 26126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2642 mSolverCounterUnsat, 4817 mSDtfsCounter, 23484 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1591 GetRequests, 1530 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20112occurred in iteration=20, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 36653 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 8749 NumberOfCodeBlocks, 8749 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 9160 ConstructedInterpolants, 0 QuantifiedInterpolants, 37893 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1442 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 9583/10506 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((a23 <= 262) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)) || (((((((long long) a23 + 43) <= 0) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || (((((a25 == 12) && (a3 == 1)) && ((((a25 != 13) || (a23 < 307)) && ((a23 < 307) || (a25 != 12))) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138080))) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || ((((((long long) a29 + 275802) <= 0) && (a25 == 9)) && (a4 == 1)) && (a23 <= 312))) || ((((a25 == 11) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a29 <= 140) && (a25 == 9)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15))) || ((((((long long) a23 + 43) <= 0) && (a25 == 9)) && (a3 == 1)) && (a8 == 15))) || ((((((long long) a23 + 127601) <= 0) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a3 == 1) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && (13 <= a25))) || (((((((570382 <= a29) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483751)))) || ((((((long long) a23 + 127601) <= 0) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || ((((a25 == 9) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a29 <= 245) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((a3 == 1) && (a8 == 15)) && (a25 == 10)) && (a29 <= 130))) || ((((((a29 <= 140) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && (a25 == 10))) || (((((a25 == 12) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((a25 == 9) && (((long long) a23 + 599772) <= 0)) && (a4 == 1))) || (((((307 <= a23) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((a29 <= 275) && (a25 == 12)) && (a3 == 1)) && (a8 == 15))) || ((((((a3 == 1) && ((((a25 != 13) || (a23 < 307)) && ((a23 < 307) || (a25 != 12))) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138080))) && (a4 == 1)) && (a8 == 15)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483751))) && (13 <= a25))) || (((((a25 <= 10) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a8 == 15)) && (a29 <= 130))) || ((((a25 == 12) && (((long long) a23 + 127601) <= 0)) && (a3 == 1)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:52:02,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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