./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label48.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_label48.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 7a889f150dc2c455e03355eaf9dfccf3bdcd55e31f50409b2096126a8e217346 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:52:15,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:52:15,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:52:15,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:52:15,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:52:15,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:52:15,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:52:15,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:52:15,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:52:15,169 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:52:15,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:52:15,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:52:15,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:52:15,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:52:15,170 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:52:15,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:52:15,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:52:15,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:52:15,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:52:15,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:52:15,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:52:15,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:52:15,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:52:15,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:52:15,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:52:15,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:52:15,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:52:15,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:52:15,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:52:15,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:52:15,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:52:15,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:52:15,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:52:15,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:52:15,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:52:15,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:52:15,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:52:15,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:52:15,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:52:15,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:52:15,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:52:15,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:52:15,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:52:15,172 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 -> 7a889f150dc2c455e03355eaf9dfccf3bdcd55e31f50409b2096126a8e217346 [2025-03-16 14:52:15,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:52:15,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:52:15,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:52:15,406 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:52:15,406 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:52:15,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label48.c [2025-03-16 14:52:16,553 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e9c36fd/8a84fd429a9e4442995c79edcb361862/FLAG805f89b4f [2025-03-16 14:52:16,830 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:52:16,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label48.c [2025-03-16 14:52:16,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e9c36fd/8a84fd429a9e4442995c79edcb361862/FLAG805f89b4f [2025-03-16 14:52:17,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e9c36fd/8a84fd429a9e4442995c79edcb361862 [2025-03-16 14:52:17,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:52:17,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:52:17,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:52:17,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:52:17,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:52:17,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f53cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17, skipping insertion in model container [2025-03-16 14:52:17,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:52:17,281 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_label48.c[7294,7307] [2025-03-16 14:52:17,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:52:17,417 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:52:17,440 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_label48.c[7294,7307] [2025-03-16 14:52:17,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:52:17,520 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:52:17,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17 WrapperNode [2025-03-16 14:52:17,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:52:17,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:52:17,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:52:17,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:52:17,527 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:52:17" (1/1) ... [2025-03-16 14:52:17,545 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:52:17" (1/1) ... [2025-03-16 14:52:17,618 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-16 14:52:17,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:52:17,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:52:17,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:52:17,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:52:17,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,691 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:52:17,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:52:17,759 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:52:17,759 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:52:17,759 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:52:17,760 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:52:17,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:17,786 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:52:17,789 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:52:17,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:52:17,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:52:17,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:52:17,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:52:17,858 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:52:17,859 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:52:18,935 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-16 14:52:18,935 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:52:18,947 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:52:18,947 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:52:18,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:18 BoogieIcfgContainer [2025-03-16 14:52:18,949 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:52:18,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:52:18,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:52:18,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:52:18,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:52:17" (1/3) ... [2025-03-16 14:52:18,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368697c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:52:18, skipping insertion in model container [2025-03-16 14:52:18,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (2/3) ... [2025-03-16 14:52:18,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368697c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:52:18, skipping insertion in model container [2025-03-16 14:52:18,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:18" (3/3) ... [2025-03-16 14:52:18,956 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label48.c [2025-03-16 14:52:18,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:52:18,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label48.c that has 1 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:52:19,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:52:19,021 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;@5cde462, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:52:19,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:52:19,026 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:52:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 14:52:19,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:19,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:19,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:19,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:19,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1934239924, now seen corresponding path program 1 times [2025-03-16 14:52:19,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:19,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882881671] [2025-03-16 14:52:19,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:19,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 14:52:19,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 14:52:19,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:19,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:19,182 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:52:19,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882881671] [2025-03-16 14:52:19,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882881671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:19,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:19,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:19,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194039508] [2025-03-16 14:52:19,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:19,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:52:19,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:19,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:52:19,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:52:19,209 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:52:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:19,241 INFO L93 Difference]: Finished difference Result 443 states and 839 transitions. [2025-03-16 14:52:19,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:52:19,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 14:52:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:19,250 INFO L225 Difference]: With dead ends: 443 [2025-03-16 14:52:19,250 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 14:52:19,253 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:52:19,255 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:52:19,256 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:52:19,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 14:52:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-16 14:52:19,290 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:52:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2025-03-16 14:52:19,296 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 49 [2025-03-16 14:52:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:19,297 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2025-03-16 14:52:19,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:52:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2025-03-16 14:52:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 14:52:19,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:19,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:19,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:52:19,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:19,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:19,300 INFO L85 PathProgramCache]: Analyzing trace with hash 864604785, now seen corresponding path program 1 times [2025-03-16 14:52:19,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:19,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236197252] [2025-03-16 14:52:19,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:19,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 14:52:19,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 14:52:19,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:19,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:19,482 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:52:19,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:19,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236197252] [2025-03-16 14:52:19,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236197252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:19,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:19,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418562782] [2025-03-16 14:52:19,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:19,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:19,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:19,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:19,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:19,485 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:52:20,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:20,211 INFO L93 Difference]: Finished difference Result 630 states and 1029 transitions. [2025-03-16 14:52:20,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:20,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 14:52:20,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:20,215 INFO L225 Difference]: With dead ends: 630 [2025-03-16 14:52:20,216 INFO L226 Difference]: Without dead ends: 412 [2025-03-16 14:52:20,217 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:52:20,218 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 158 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:20,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 145 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-16 14:52:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2025-03-16 14:52:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4596577017114913) internal successors, (597), 409 states have internal predecessors, (597), 0 states have call successors, (0), 0 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:52:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2025-03-16 14:52:20,237 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 49 [2025-03-16 14:52:20,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:20,237 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2025-03-16 14:52:20,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:52:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2025-03-16 14:52:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 14:52:20,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:20,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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:52:20,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:52:20,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:20,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:20,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1217276164, now seen corresponding path program 1 times [2025-03-16 14:52:20,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:20,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466148747] [2025-03-16 14:52:20,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:20,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 14:52:20,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 14:52:20,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:20,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:20,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:20,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466148747] [2025-03-16 14:52:20,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466148747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:20,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:20,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:20,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280226411] [2025-03-16 14:52:20,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:20,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:20,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:20,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:20,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:20,442 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:52:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:21,096 INFO L93 Difference]: Finished difference Result 1208 states and 1764 transitions. [2025-03-16 14:52:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:21,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-03-16 14:52:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:21,099 INFO L225 Difference]: With dead ends: 1208 [2025-03-16 14:52:21,099 INFO L226 Difference]: Without dead ends: 799 [2025-03-16 14:52:21,100 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:52:21,101 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 122 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:52:21,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-16 14:52:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 786. [2025-03-16 14:52:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3847133757961783) internal successors, (1087), 785 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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:52:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1087 transitions. [2025-03-16 14:52:21,129 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1087 transitions. Word has length 117 [2025-03-16 14:52:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:21,130 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1087 transitions. [2025-03-16 14:52:21,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:52:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1087 transitions. [2025-03-16 14:52:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 14:52:21,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:21,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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:52:21,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:52:21,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:21,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1006413759, now seen corresponding path program 1 times [2025-03-16 14:52:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:21,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76013896] [2025-03-16 14:52:21,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:21,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:21,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 14:52:21,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 14:52:21,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:21,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:21,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:21,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76013896] [2025-03-16 14:52:21,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76013896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:21,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:21,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:21,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829359205] [2025-03-16 14:52:21,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:21,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:21,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:21,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:21,402 INFO L87 Difference]: Start difference. First operand 786 states and 1087 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:52:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:21,871 INFO L93 Difference]: Finished difference Result 1940 states and 2627 transitions. [2025-03-16 14:52:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:21,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-16 14:52:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:21,875 INFO L225 Difference]: With dead ends: 1940 [2025-03-16 14:52:21,875 INFO L226 Difference]: Without dead ends: 1155 [2025-03-16 14:52:21,876 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:52:21,876 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:21,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 192 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-03-16 14:52:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2025-03-16 14:52:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2772963604852687) internal successors, (1474), 1154 states have internal predecessors, (1474), 0 states have call successors, (0), 0 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:52:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1474 transitions. [2025-03-16 14:52:21,894 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1474 transitions. Word has length 119 [2025-03-16 14:52:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:21,894 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1474 transitions. [2025-03-16 14:52:21,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:52:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1474 transitions. [2025-03-16 14:52:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 14:52:21,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:21,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:21,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:52:21,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:21,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:21,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1190725812, now seen corresponding path program 1 times [2025-03-16 14:52:21,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:21,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473370576] [2025-03-16 14:52:21,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:21,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 14:52:21,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 14:52:21,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:21,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-16 14:52:22,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:22,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473370576] [2025-03-16 14:52:22,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473370576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:22,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:22,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:22,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119219678] [2025-03-16 14:52:22,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:22,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:22,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:22,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:22,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:22,080 INFO L87 Difference]: Start difference. First operand 1155 states and 1474 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:52:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:22,689 INFO L93 Difference]: Finished difference Result 3055 states and 3913 transitions. [2025-03-16 14:52:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:22,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 161 [2025-03-16 14:52:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:22,696 INFO L225 Difference]: With dead ends: 3055 [2025-03-16 14:52:22,696 INFO L226 Difference]: Without dead ends: 1901 [2025-03-16 14:52:22,698 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:52:22,698 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 156 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.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:22,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-03-16 14:52:22,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1900. [2025-03-16 14:52:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1899 states have (on average 1.220115850447604) internal successors, (2317), 1899 states have internal predecessors, (2317), 0 states have call successors, (0), 0 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:52:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2317 transitions. [2025-03-16 14:52:22,729 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2317 transitions. Word has length 161 [2025-03-16 14:52:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:22,730 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 2317 transitions. [2025-03-16 14:52:22,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:52:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2317 transitions. [2025-03-16 14:52:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 14:52:22,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:22,732 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:22,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:52:22,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:22,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:22,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1826720104, now seen corresponding path program 1 times [2025-03-16 14:52:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:22,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161973375] [2025-03-16 14:52:22,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:22,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:22,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 14:52:22,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 14:52:22,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:22,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:22,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:22,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161973375] [2025-03-16 14:52:22,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161973375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:22,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:22,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:22,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276585171] [2025-03-16 14:52:22,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:22,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:22,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:22,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:22,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:22,907 INFO L87 Difference]: Start difference. First operand 1900 states and 2317 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:52:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:23,488 INFO L93 Difference]: Finished difference Result 4549 states and 5628 transitions. [2025-03-16 14:52:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:23,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-03-16 14:52:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:23,497 INFO L225 Difference]: With dead ends: 4549 [2025-03-16 14:52:23,497 INFO L226 Difference]: Without dead ends: 2834 [2025-03-16 14:52:23,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:23,501 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 155 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:23,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 334 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:52:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2025-03-16 14:52:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2455. [2025-03-16 14:52:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2455 states, 2454 states have (on average 1.2118989405052976) internal successors, (2974), 2454 states have internal predecessors, (2974), 0 states have call successors, (0), 0 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:52:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 2974 transitions. [2025-03-16 14:52:23,539 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 2974 transitions. Word has length 176 [2025-03-16 14:52:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:23,539 INFO L471 AbstractCegarLoop]: Abstraction has 2455 states and 2974 transitions. [2025-03-16 14:52:23,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:52:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 2974 transitions. [2025-03-16 14:52:23,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 14:52:23,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:23,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:23,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:52:23,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:23,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:23,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1231936422, now seen corresponding path program 1 times [2025-03-16 14:52:23,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:23,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800572027] [2025-03-16 14:52:23,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:23,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 14:52:23,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 14:52:23,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:23,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 14:52:23,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:23,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800572027] [2025-03-16 14:52:23,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800572027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:23,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:23,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735349637] [2025-03-16 14:52:23,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:23,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:23,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:23,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:23,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:23,737 INFO L87 Difference]: Start difference. First operand 2455 states and 2974 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:52:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:24,345 INFO L93 Difference]: Finished difference Result 5654 states and 6929 transitions. [2025-03-16 14:52:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:24,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 231 [2025-03-16 14:52:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:24,353 INFO L225 Difference]: With dead ends: 5654 [2025-03-16 14:52:24,354 INFO L226 Difference]: Without dead ends: 3200 [2025-03-16 14:52:24,356 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:52:24,356 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 147 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:24,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 385 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2025-03-16 14:52:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 3007. [2025-03-16 14:52:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.2049234863606122) internal successors, (3622), 3006 states have internal predecessors, (3622), 0 states have call successors, (0), 0 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:52:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 3622 transitions. [2025-03-16 14:52:24,391 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 3622 transitions. Word has length 231 [2025-03-16 14:52:24,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:24,391 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 3622 transitions. [2025-03-16 14:52:24,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:52:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 3622 transitions. [2025-03-16 14:52:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-16 14:52:24,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:24,394 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:52:24,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:52:24,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:24,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash -921883489, now seen corresponding path program 1 times [2025-03-16 14:52:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:24,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706493531] [2025-03-16 14:52:24,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:24,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:24,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 14:52:24,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 14:52:24,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:24,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:24,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:24,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706493531] [2025-03-16 14:52:24,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706493531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:24,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:24,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49556121] [2025-03-16 14:52:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:24,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:24,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:24,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:24,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:24,633 INFO L87 Difference]: Start difference. First operand 3007 states and 3622 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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:52:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:25,248 INFO L93 Difference]: Finished difference Result 7502 states and 9171 transitions. [2025-03-16 14:52:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:25,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2025-03-16 14:52:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:25,258 INFO L225 Difference]: With dead ends: 7502 [2025-03-16 14:52:25,258 INFO L226 Difference]: Without dead ends: 4496 [2025-03-16 14:52:25,261 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:52:25,262 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 117 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:25,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 180 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2025-03-16 14:52:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4492. [2025-03-16 14:52:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 4491 states have (on average 1.2052994878646182) internal successors, (5413), 4491 states have internal predecessors, (5413), 0 states have call successors, (0), 0 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:52:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 5413 transitions. [2025-03-16 14:52:25,314 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 5413 transitions. Word has length 258 [2025-03-16 14:52:25,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:25,314 INFO L471 AbstractCegarLoop]: Abstraction has 4492 states and 5413 transitions. [2025-03-16 14:52:25,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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:52:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 5413 transitions. [2025-03-16 14:52:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-16 14:52:25,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:25,320 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:25,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:52:25,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:25,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1589418096, now seen corresponding path program 1 times [2025-03-16 14:52:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:25,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123026004] [2025-03-16 14:52:25,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:25,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:25,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 14:52:25,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 14:52:25,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:25,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 145 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123026004] [2025-03-16 14:52:25,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123026004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919497718] [2025-03-16 14:52:25,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:25,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:25,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:25,930 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:52:25,931 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:52:25,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 14:52:26,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 14:52:26,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:26,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:26,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:52:26,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:52:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:26,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:52:26,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919497718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:26,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:52:26,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:52:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813457104] [2025-03-16 14:52:26,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:26,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:26,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:26,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:52:26,334 INFO L87 Difference]: Start difference. First operand 4492 states and 5413 transitions. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:52:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:27,393 INFO L93 Difference]: Finished difference Result 12127 states and 14816 transitions. [2025-03-16 14:52:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:27,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2025-03-16 14:52:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:27,408 INFO L225 Difference]: With dead ends: 12127 [2025-03-16 14:52:27,408 INFO L226 Difference]: Without dead ends: 7636 [2025-03-16 14:52:27,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:52:27,413 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 230 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:27,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 68 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 14:52:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7636 states. [2025-03-16 14:52:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7636 to 7628. [2025-03-16 14:52:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7628 states, 7627 states have (on average 1.2135833224072374) internal successors, (9256), 7627 states have internal predecessors, (9256), 0 states have call successors, (0), 0 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:52:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7628 states to 7628 states and 9256 transitions. [2025-03-16 14:52:27,498 INFO L78 Accepts]: Start accepts. Automaton has 7628 states and 9256 transitions. Word has length 268 [2025-03-16 14:52:27,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:27,499 INFO L471 AbstractCegarLoop]: Abstraction has 7628 states and 9256 transitions. [2025-03-16 14:52:27,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:52:27,499 INFO L276 IsEmpty]: Start isEmpty. Operand 7628 states and 9256 transitions. [2025-03-16 14:52:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-16 14:52:27,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:27,503 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:52:27,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:52:27,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:27,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:27,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:27,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1239708632, now seen corresponding path program 1 times [2025-03-16 14:52:27,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:27,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200704305] [2025-03-16 14:52:27,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:27,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:27,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 14:52:27,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 14:52:27,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:27,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:28,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200704305] [2025-03-16 14:52:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200704305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:28,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:28,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:52:28,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690251110] [2025-03-16 14:52:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:28,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:52:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:28,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:52:28,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:52:28,162 INFO L87 Difference]: Start difference. First operand 7628 states and 9256 transitions. Second operand has 5 states, 5 states have (on average 53.6) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:52:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:29,543 INFO L93 Difference]: Finished difference Result 17293 states and 21284 transitions. [2025-03-16 14:52:29,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:52:29,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2025-03-16 14:52:29,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:29,564 INFO L225 Difference]: With dead ends: 17293 [2025-03-16 14:52:29,565 INFO L226 Difference]: Without dead ends: 10034 [2025-03-16 14:52:29,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:52:29,571 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 400 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:29,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 101 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 14:52:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10034 states. [2025-03-16 14:52:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10034 to 9100. [2025-03-16 14:52:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9100 states, 9099 states have (on average 1.2021101219914276) internal successors, (10938), 9099 states have internal predecessors, (10938), 0 states have call successors, (0), 0 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:52:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9100 states to 9100 states and 10938 transitions. [2025-03-16 14:52:29,664 INFO L78 Accepts]: Start accepts. Automaton has 9100 states and 10938 transitions. Word has length 268 [2025-03-16 14:52:29,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:29,665 INFO L471 AbstractCegarLoop]: Abstraction has 9100 states and 10938 transitions. [2025-03-16 14:52:29,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:52:29,665 INFO L276 IsEmpty]: Start isEmpty. Operand 9100 states and 10938 transitions. [2025-03-16 14:52:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-16 14:52:29,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:29,670 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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:52:29,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:52:29,670 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:29,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1734301572, now seen corresponding path program 1 times [2025-03-16 14:52:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:29,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597444857] [2025-03-16 14:52:29,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:29,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:29,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-16 14:52:29,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-16 14:52:29,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:29,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-16 14:52:29,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:29,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597444857] [2025-03-16 14:52:29,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597444857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:29,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:29,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:29,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918834124] [2025-03-16 14:52:29,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:29,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:29,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:29,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:29,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:29,773 INFO L87 Difference]: Start difference. First operand 9100 states and 10938 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:30,400 INFO L93 Difference]: Finished difference Result 21141 states and 25701 transitions. [2025-03-16 14:52:30,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:30,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 279 [2025-03-16 14:52:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:30,416 INFO L225 Difference]: With dead ends: 21141 [2025-03-16 14:52:30,417 INFO L226 Difference]: Without dead ends: 12410 [2025-03-16 14:52:30,423 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:52:30,423 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 172 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:30,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 346 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12410 states. [2025-03-16 14:52:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12410 to 12226. [2025-03-16 14:52:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12226 states, 12225 states have (on average 1.1932924335378323) internal successors, (14588), 12225 states have internal predecessors, (14588), 0 states have call successors, (0), 0 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:52:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12226 states to 12226 states and 14588 transitions. [2025-03-16 14:52:30,527 INFO L78 Accepts]: Start accepts. Automaton has 12226 states and 14588 transitions. Word has length 279 [2025-03-16 14:52:30,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:30,528 INFO L471 AbstractCegarLoop]: Abstraction has 12226 states and 14588 transitions. [2025-03-16 14:52:30,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 12226 states and 14588 transitions. [2025-03-16 14:52:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-16 14:52:30,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:30,533 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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:52:30,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:52:30,533 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:30,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:30,534 INFO L85 PathProgramCache]: Analyzing trace with hash -53903543, now seen corresponding path program 1 times [2025-03-16 14:52:30,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:30,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753263856] [2025-03-16 14:52:30,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:30,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:30,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-16 14:52:30,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-16 14:52:30,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:30,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 95 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:30,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:30,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753263856] [2025-03-16 14:52:30,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753263856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:30,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993591204] [2025-03-16 14:52:30,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:30,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:30,766 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:52:30,767 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:52:30,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-16 14:52:30,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-16 14:52:30,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:30,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:30,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:52:30,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:52:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:31,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:52:31,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993591204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:31,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:52:31,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:52:31,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716895344] [2025-03-16 14:52:31,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:31,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:31,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:31,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:31,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:52:31,112 INFO L87 Difference]: Start difference. First operand 12226 states and 14588 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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:52:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:31,659 INFO L93 Difference]: Finished difference Result 25577 states and 30607 transitions. [2025-03-16 14:52:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:31,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 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 282 [2025-03-16 14:52:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:31,677 INFO L225 Difference]: With dead ends: 25577 [2025-03-16 14:52:31,677 INFO L226 Difference]: Without dead ends: 13720 [2025-03-16 14:52:31,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:52:31,687 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 99 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:31,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 352 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:52:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13720 states. [2025-03-16 14:52:31,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13720 to 13709. [2025-03-16 14:52:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13709 states, 13708 states have (on average 1.1885030639042895) internal successors, (16292), 13708 states have internal predecessors, (16292), 0 states have call successors, (0), 0 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:52:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13709 states to 13709 states and 16292 transitions. [2025-03-16 14:52:31,803 INFO L78 Accepts]: Start accepts. Automaton has 13709 states and 16292 transitions. Word has length 282 [2025-03-16 14:52:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:31,804 INFO L471 AbstractCegarLoop]: Abstraction has 13709 states and 16292 transitions. [2025-03-16 14:52:31,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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:52:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 13709 states and 16292 transitions. [2025-03-16 14:52:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-16 14:52:31,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:31,809 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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:52:31,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:52:32,010 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,SelfDestructingSolverStorable11 [2025-03-16 14:52:32,010 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:32,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:32,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1694620423, now seen corresponding path program 1 times [2025-03-16 14:52:32,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:32,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473138602] [2025-03-16 14:52:32,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:32,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:32,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-16 14:52:32,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-16 14:52:32,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:32,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:32,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:32,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473138602] [2025-03-16 14:52:32,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473138602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:32,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:32,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:52:32,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587190033] [2025-03-16 14:52:32,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:32,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:32,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:32,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:32,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:32,294 INFO L87 Difference]: Start difference. First operand 13709 states and 16292 transitions. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 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:52:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:33,170 INFO L93 Difference]: Finished difference Result 30190 states and 36129 transitions. [2025-03-16 14:52:33,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:33,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 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 285 [2025-03-16 14:52:33,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:33,191 INFO L225 Difference]: With dead ends: 30190 [2025-03-16 14:52:33,191 INFO L226 Difference]: Without dead ends: 16850 [2025-03-16 14:52:33,203 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:52:33,204 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 282 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:33,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 104 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:52:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16850 states. [2025-03-16 14:52:33,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16850 to 16841. [2025-03-16 14:52:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16841 states, 16840 states have (on average 1.1812945368171022) internal successors, (19893), 16840 states have internal predecessors, (19893), 0 states have call successors, (0), 0 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:52:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16841 states to 16841 states and 19893 transitions. [2025-03-16 14:52:33,378 INFO L78 Accepts]: Start accepts. Automaton has 16841 states and 19893 transitions. Word has length 285 [2025-03-16 14:52:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:33,378 INFO L471 AbstractCegarLoop]: Abstraction has 16841 states and 19893 transitions. [2025-03-16 14:52:33,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 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:52:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 16841 states and 19893 transitions. [2025-03-16 14:52:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-16 14:52:33,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:33,385 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, 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, 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] [2025-03-16 14:52:33,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:52:33,385 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1807358909, now seen corresponding path program 1 times [2025-03-16 14:52:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:33,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252292883] [2025-03-16 14:52:33,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:33,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-16 14:52:33,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-16 14:52:33,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:33,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-16 14:52:33,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:33,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252292883] [2025-03-16 14:52:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252292883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:33,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:33,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284210177] [2025-03-16 14:52:33,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:33,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:33,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:33,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:33,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:33,479 INFO L87 Difference]: Start difference. First operand 16841 states and 19893 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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:52:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:33,971 INFO L93 Difference]: Finished difference Result 32571 states and 38572 transitions. [2025-03-16 14:52:33,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:33,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 307 [2025-03-16 14:52:33,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:33,991 INFO L225 Difference]: With dead ends: 32571 [2025-03-16 14:52:33,991 INFO L226 Difference]: Without dead ends: 16099 [2025-03-16 14:52:34,004 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:52:34,004 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 173 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:34,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 150 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:34,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16099 states. [2025-03-16 14:52:34,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16099 to 15913. [2025-03-16 14:52:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15913 states, 15912 states have (on average 1.127199597787833) internal successors, (17936), 15912 states have internal predecessors, (17936), 0 states have call successors, (0), 0 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:52:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15913 states to 15913 states and 17936 transitions. [2025-03-16 14:52:34,214 INFO L78 Accepts]: Start accepts. Automaton has 15913 states and 17936 transitions. Word has length 307 [2025-03-16 14:52:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:34,214 INFO L471 AbstractCegarLoop]: Abstraction has 15913 states and 17936 transitions. [2025-03-16 14:52:34,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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:52:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 15913 states and 17936 transitions. [2025-03-16 14:52:34,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-16 14:52:34,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:34,219 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:34,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:52:34,219 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:34,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash -429192573, now seen corresponding path program 1 times [2025-03-16 14:52:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:34,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423920069] [2025-03-16 14:52:34,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:34,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-16 14:52:34,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-16 14:52:34,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:34,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:52:34,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:34,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423920069] [2025-03-16 14:52:34,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423920069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:34,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:34,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35378423] [2025-03-16 14:52:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:34,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:34,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:34,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:34,331 INFO L87 Difference]: Start difference. First operand 15913 states and 17936 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 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:52:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:34,872 INFO L93 Difference]: Finished difference Result 34768 states and 39302 transitions. [2025-03-16 14:52:34,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:34,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 311 [2025-03-16 14:52:34,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:34,891 INFO L225 Difference]: With dead ends: 34768 [2025-03-16 14:52:34,892 INFO L226 Difference]: Without dead ends: 19040 [2025-03-16 14:52:34,902 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:52:34,903 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 152 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:34,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 356 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:52:34,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19040 states. [2025-03-16 14:52:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19040 to 17191. [2025-03-16 14:52:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17191 states, 17190 states have (on average 1.12065154159395) internal successors, (19264), 17190 states have internal predecessors, (19264), 0 states have call successors, (0), 0 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:52:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17191 states to 17191 states and 19264 transitions. [2025-03-16 14:52:35,123 INFO L78 Accepts]: Start accepts. Automaton has 17191 states and 19264 transitions. Word has length 311 [2025-03-16 14:52:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:35,123 INFO L471 AbstractCegarLoop]: Abstraction has 17191 states and 19264 transitions. [2025-03-16 14:52:35,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 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:52:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 17191 states and 19264 transitions. [2025-03-16 14:52:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-16 14:52:35,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:35,130 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:35,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:52:35,130 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:35,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash -849727656, now seen corresponding path program 1 times [2025-03-16 14:52:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:35,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731716111] [2025-03-16 14:52:35,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:35,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:35,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-16 14:52:35,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-16 14:52:35,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:35,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 221 proven. 72 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-16 14:52:35,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:35,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731716111] [2025-03-16 14:52:35,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731716111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:35,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847094378] [2025-03-16 14:52:35,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:35,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:35,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:35,741 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:52:35,743 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:52:35,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-16 14:52:35,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-16 14:52:35,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:35,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:35,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 14:52:35,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:52:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 14:52:36,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:52:36,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847094378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:36,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:52:36,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:52:36,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31998896] [2025-03-16 14:52:36,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:36,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:36,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:36,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:36,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:52:36,114 INFO L87 Difference]: Start difference. First operand 17191 states and 19264 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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:52:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:36,602 INFO L93 Difference]: Finished difference Result 36595 states and 40990 transitions. [2025-03-16 14:52:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:36,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 336 [2025-03-16 14:52:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:36,625 INFO L225 Difference]: With dead ends: 36595 [2025-03-16 14:52:36,625 INFO L226 Difference]: Without dead ends: 19405 [2025-03-16 14:52:36,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 336 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:52:36,640 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 84 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:36,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 362 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19405 states. [2025-03-16 14:52:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19405 to 18667. [2025-03-16 14:52:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18667 states, 18666 states have (on average 1.1153969784635165) internal successors, (20820), 18666 states have internal predecessors, (20820), 0 states have call successors, (0), 0 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:52:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18667 states to 18667 states and 20820 transitions. [2025-03-16 14:52:36,819 INFO L78 Accepts]: Start accepts. Automaton has 18667 states and 20820 transitions. Word has length 336 [2025-03-16 14:52:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:36,819 INFO L471 AbstractCegarLoop]: Abstraction has 18667 states and 20820 transitions. [2025-03-16 14:52:36,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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:52:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 18667 states and 20820 transitions. [2025-03-16 14:52:36,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-16 14:52:36,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:36,826 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:36,833 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:52:37,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:37,030 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:37,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1210616615, now seen corresponding path program 1 times [2025-03-16 14:52:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:37,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477754215] [2025-03-16 14:52:37,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:37,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:37,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-16 14:52:37,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-16 14:52:37,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:37,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 254 proven. 54 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-16 14:52:37,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:37,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477754215] [2025-03-16 14:52:37,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477754215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:37,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989879361] [2025-03-16 14:52:37,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:37,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:37,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:37,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:52:37,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:52:37,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-16 14:52:37,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-16 14:52:37,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:37,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:37,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 14:52:37,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:52:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-16 14:52:37,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:52:37,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989879361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:37,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:52:37,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:52:37,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182540757] [2025-03-16 14:52:37,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:37,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:37,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:37,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:37,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:52:37,916 INFO L87 Difference]: Start difference. First operand 18667 states and 20820 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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:52:38,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:38,377 INFO L93 Difference]: Finished difference Result 37886 states and 42216 transitions. [2025-03-16 14:52:38,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:38,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 357 [2025-03-16 14:52:38,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:38,393 INFO L225 Difference]: With dead ends: 37886 [2025-03-16 14:52:38,393 INFO L226 Difference]: Without dead ends: 19220 [2025-03-16 14:52:38,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 357 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:52:38,406 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 90 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:38,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 168 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19220 states. [2025-03-16 14:52:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19220 to 17563. [2025-03-16 14:52:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17563 states, 17562 states have (on average 1.1126864821774285) internal successors, (19541), 17562 states have internal predecessors, (19541), 0 states have call successors, (0), 0 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:52:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17563 states to 17563 states and 19541 transitions. [2025-03-16 14:52:38,533 INFO L78 Accepts]: Start accepts. Automaton has 17563 states and 19541 transitions. Word has length 357 [2025-03-16 14:52:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:38,534 INFO L471 AbstractCegarLoop]: Abstraction has 17563 states and 19541 transitions. [2025-03-16 14:52:38,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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:52:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 17563 states and 19541 transitions. [2025-03-16 14:52:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-16 14:52:38,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:38,540 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:52:38,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 14:52:38,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 14:52:38,741 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:38,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1103428493, now seen corresponding path program 1 times [2025-03-16 14:52:38,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:38,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329352825] [2025-03-16 14:52:38,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:38,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:38,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-16 14:52:38,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-16 14:52:38,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:38,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-16 14:52:38,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:38,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329352825] [2025-03-16 14:52:38,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329352825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:38,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:38,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:38,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949857443] [2025-03-16 14:52:38,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:38,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:38,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:38,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:38,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:38,896 INFO L87 Difference]: Start difference. First operand 17563 states and 19541 transitions. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 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:52:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:39,614 INFO L93 Difference]: Finished difference Result 43991 states and 48865 transitions. [2025-03-16 14:52:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:39,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 374 [2025-03-16 14:52:39,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:39,638 INFO L225 Difference]: With dead ends: 43991 [2025-03-16 14:52:39,638 INFO L226 Difference]: Without dead ends: 26429 [2025-03-16 14:52:39,652 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:52:39,652 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 221 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:39,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 72 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26429 states. [2025-03-16 14:52:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26429 to 23649. [2025-03-16 14:52:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23649 states, 23648 states have (on average 1.1092692828146145) internal successors, (26232), 23648 states have internal predecessors, (26232), 0 states have call successors, (0), 0 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:52:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23649 states to 23649 states and 26232 transitions. [2025-03-16 14:52:39,890 INFO L78 Accepts]: Start accepts. Automaton has 23649 states and 26232 transitions. Word has length 374 [2025-03-16 14:52:39,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:39,890 INFO L471 AbstractCegarLoop]: Abstraction has 23649 states and 26232 transitions. [2025-03-16 14:52:39,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 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:52:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 23649 states and 26232 transitions. [2025-03-16 14:52:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-16 14:52:39,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:39,897 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:52:39,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:52:39,897 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:39,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:39,898 INFO L85 PathProgramCache]: Analyzing trace with hash 907340937, now seen corresponding path program 1 times [2025-03-16 14:52:39,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:39,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433151027] [2025-03-16 14:52:39,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:39,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:39,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-16 14:52:39,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-16 14:52:39,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:39,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 267 proven. 78 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 14:52:40,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:40,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433151027] [2025-03-16 14:52:40,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433151027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:40,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231386551] [2025-03-16 14:52:40,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:40,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:40,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:40,515 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:52:40,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:52:40,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-16 14:52:40,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-16 14:52:40,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:40,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:40,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 14:52:40,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:52:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 202 proven. 143 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 14:52:41,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:52:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 297 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 14:52:41,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231386551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:52:41,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:52:41,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-03-16 14:52:41,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160501674] [2025-03-16 14:52:41,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:52:41,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 14:52:41,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:41,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 14:52:41,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:52:41,486 INFO L87 Difference]: Start difference. First operand 23649 states and 26232 transitions. Second operand has 11 states, 11 states have (on average 75.9090909090909) internal successors, (835), 11 states have internal predecessors, (835), 0 states have call successors, (0), 0 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:52:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:45,356 INFO L93 Difference]: Finished difference Result 59854 states and 66344 transitions. [2025-03-16 14:52:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 14:52:45,356 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 75.9090909090909) internal successors, (835), 11 states have internal predecessors, (835), 0 states have call successors, (0), 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 374 [2025-03-16 14:52:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:45,390 INFO L225 Difference]: With dead ends: 59854 [2025-03-16 14:52:45,390 INFO L226 Difference]: Without dead ends: 35654 [2025-03-16 14:52:45,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 756 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-03-16 14:52:45,402 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 2997 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 6391 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2997 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 7315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 6391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:45,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2997 Valid, 223 Invalid, 7315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 6391 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-16 14:52:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35654 states. [2025-03-16 14:52:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35654 to 18661. [2025-03-16 14:52:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18661 states, 18660 states have (on average 1.0986602357984994) internal successors, (20501), 18660 states have internal predecessors, (20501), 0 states have call successors, (0), 0 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:52:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18661 states to 18661 states and 20501 transitions. [2025-03-16 14:52:45,624 INFO L78 Accepts]: Start accepts. Automaton has 18661 states and 20501 transitions. Word has length 374 [2025-03-16 14:52:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:45,625 INFO L471 AbstractCegarLoop]: Abstraction has 18661 states and 20501 transitions. [2025-03-16 14:52:45,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 75.9090909090909) internal successors, (835), 11 states have internal predecessors, (835), 0 states have call successors, (0), 0 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:52:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18661 states and 20501 transitions. [2025-03-16 14:52:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-16 14:52:45,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:45,631 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, 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, 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:52:45,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 14:52:45,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:45,831 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:45,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:45,832 INFO L85 PathProgramCache]: Analyzing trace with hash -893092530, now seen corresponding path program 1 times [2025-03-16 14:52:45,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:45,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550470242] [2025-03-16 14:52:45,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:45,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:45,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-16 14:52:45,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-16 14:52:45,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:45,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 143 proven. 202 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-16 14:52:46,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:46,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550470242] [2025-03-16 14:52:46,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550470242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:46,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595036886] [2025-03-16 14:52:46,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:46,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:46,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:46,051 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:52:46,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 14:52:46,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-16 14:52:46,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-16 14:52:46,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:46,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:46,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:52:46,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:52:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-16 14:52:46,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:52:46,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595036886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:46,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:52:46,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:52:46,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049806114] [2025-03-16 14:52:46,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:46,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:46,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:46,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:46,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:52:46,342 INFO L87 Difference]: Start difference. First operand 18661 states and 20501 transitions. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 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:52:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:47,149 INFO L93 Difference]: Finished difference Result 38619 states and 42440 transitions. [2025-03-16 14:52:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:47,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 380 [2025-03-16 14:52:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:47,172 INFO L225 Difference]: With dead ends: 38619 [2025-03-16 14:52:47,172 INFO L226 Difference]: Without dead ends: 20327 [2025-03-16 14:52:47,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:52:47,186 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 220 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:47,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 109 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:47,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20327 states. [2025-03-16 14:52:47,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20327 to 19399. [2025-03-16 14:52:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19399 states, 19398 states have (on average 1.0964016908959686) internal successors, (21268), 19398 states have internal predecessors, (21268), 0 states have call successors, (0), 0 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:52:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19399 states to 19399 states and 21268 transitions. [2025-03-16 14:52:47,357 INFO L78 Accepts]: Start accepts. Automaton has 19399 states and 21268 transitions. Word has length 380 [2025-03-16 14:52:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:47,357 INFO L471 AbstractCegarLoop]: Abstraction has 19399 states and 21268 transitions. [2025-03-16 14:52:47,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 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:52:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 19399 states and 21268 transitions. [2025-03-16 14:52:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-16 14:52:47,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:47,364 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:47,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 14:52:47,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:47,565 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:47,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:47,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1656119577, now seen corresponding path program 1 times [2025-03-16 14:52:47,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:47,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452957853] [2025-03-16 14:52:47,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:47,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:47,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-16 14:52:47,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-16 14:52:47,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:47,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 143 proven. 229 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 14:52:47,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:47,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452957853] [2025-03-16 14:52:47,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452957853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:47,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731519821] [2025-03-16 14:52:47,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:47,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:47,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:47,838 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:52:47,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 14:52:47,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-16 14:52:47,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-16 14:52:47,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:47,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:47,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 14:52:47,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:52:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 248 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:48,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:52:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 248 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:50,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731519821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:52:50,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:52:50,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2025-03-16 14:52:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983180763] [2025-03-16 14:52:50,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:52:50,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 14:52:50,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:50,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 14:52:50,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-16 14:52:50,636 INFO L87 Difference]: Start difference. First operand 19399 states and 21268 transitions. Second operand has 12 states, 12 states have (on average 80.66666666666667) internal successors, (968), 11 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:52:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:54,978 INFO L93 Difference]: Finished difference Result 53771 states and 58683 transitions. [2025-03-16 14:52:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-16 14:52:54,978 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 80.66666666666667) internal successors, (968), 11 states have internal predecessors, (968), 0 states have call successors, (0), 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 416 [2025-03-16 14:52:54,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:55,010 INFO L225 Difference]: With dead ends: 53771 [2025-03-16 14:52:55,010 INFO L226 Difference]: Without dead ends: 34557 [2025-03-16 14:52:55,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 14:52:55,023 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4318 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6240 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4318 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 7427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 6240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:55,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4318 Valid, 153 Invalid, 7427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 6240 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-16 14:52:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34557 states. [2025-03-16 14:52:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34557 to 22892. [2025-03-16 14:52:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22892 states, 22891 states have (on average 1.0747455331789786) internal successors, (24602), 22891 states have internal predecessors, (24602), 0 states have call successors, (0), 0 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:52:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22892 states to 22892 states and 24602 transitions. [2025-03-16 14:52:55,233 INFO L78 Accepts]: Start accepts. Automaton has 22892 states and 24602 transitions. Word has length 416 [2025-03-16 14:52:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:55,233 INFO L471 AbstractCegarLoop]: Abstraction has 22892 states and 24602 transitions. [2025-03-16 14:52:55,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 80.66666666666667) internal successors, (968), 11 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:52:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 22892 states and 24602 transitions. [2025-03-16 14:52:55,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2025-03-16 14:52:55,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:55,243 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:55,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 14:52:55,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:55,444 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:55,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1573167874, now seen corresponding path program 1 times [2025-03-16 14:52:55,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:55,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449198383] [2025-03-16 14:52:55,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:55,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-03-16 14:52:55,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-03-16 14:52:55,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:55,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-16 14:52:55,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:55,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449198383] [2025-03-16 14:52:55,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449198383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:55,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:55,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504867379] [2025-03-16 14:52:55,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:55,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:55,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:55,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:55,758 INFO L87 Difference]: Start difference. First operand 22892 states and 24602 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 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:52:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:56,234 INFO L93 Difference]: Finished difference Result 43950 states and 47291 transitions. [2025-03-16 14:52:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:56,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 510 [2025-03-16 14:52:56,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:56,261 INFO L225 Difference]: With dead ends: 43950 [2025-03-16 14:52:56,261 INFO L226 Difference]: Without dead ends: 22901 [2025-03-16 14:52:56,275 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:52:56,276 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 65 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:56,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 157 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22901 states. [2025-03-16 14:52:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22901 to 22156. [2025-03-16 14:52:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22156 states, 22155 states have (on average 1.072444143534191) internal successors, (23760), 22155 states have internal predecessors, (23760), 0 states have call successors, (0), 0 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:52:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22156 states to 22156 states and 23760 transitions. [2025-03-16 14:52:56,449 INFO L78 Accepts]: Start accepts. Automaton has 22156 states and 23760 transitions. Word has length 510 [2025-03-16 14:52:56,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:56,449 INFO L471 AbstractCegarLoop]: Abstraction has 22156 states and 23760 transitions. [2025-03-16 14:52:56,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 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:52:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 22156 states and 23760 transitions. [2025-03-16 14:52:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-03-16 14:52:56,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:56,457 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:56,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 14:52:56,457 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:56,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:56,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2140773631, now seen corresponding path program 1 times [2025-03-16 14:52:56,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:56,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77679533] [2025-03-16 14:52:56,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:56,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:56,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-03-16 14:52:56,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-03-16 14:52:56,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:56,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 514 proven. 3 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-16 14:52:56,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:56,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77679533] [2025-03-16 14:52:56,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77679533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:56,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224109405] [2025-03-16 14:52:56,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:56,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:56,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:56,843 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:52:56,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 14:52:56,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-03-16 14:52:56,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-03-16 14:52:56,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:56,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:56,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:52:56,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:52:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-16 14:52:57,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:52:57,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224109405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:57,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:52:57,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-16 14:52:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748254605] [2025-03-16 14:52:57,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:57,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:57,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:57,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:57,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:52:57,157 INFO L87 Difference]: Start difference. First operand 22156 states and 23760 transitions. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 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:52:57,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:57,845 INFO L93 Difference]: Finished difference Result 45040 states and 48306 transitions. [2025-03-16 14:52:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:57,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 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 511 [2025-03-16 14:52:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:57,869 INFO L225 Difference]: With dead ends: 45040 [2025-03-16 14:52:57,869 INFO L226 Difference]: Without dead ends: 23069 [2025-03-16 14:52:57,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:52:57,885 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 257 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:57,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 154 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23069 states. [2025-03-16 14:52:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23069 to 21040. [2025-03-16 14:52:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21040 states, 21039 states have (on average 1.0683492561433527) internal successors, (22477), 21039 states have internal predecessors, (22477), 0 states have call successors, (0), 0 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:52:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21040 states to 21040 states and 22477 transitions. [2025-03-16 14:52:58,061 INFO L78 Accepts]: Start accepts. Automaton has 21040 states and 22477 transitions. Word has length 511 [2025-03-16 14:52:58,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:58,061 INFO L471 AbstractCegarLoop]: Abstraction has 21040 states and 22477 transitions. [2025-03-16 14:52:58,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 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:52:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 21040 states and 22477 transitions. [2025-03-16 14:52:58,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-16 14:52:58,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:58,070 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:52:58,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 14:52:58,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 14:52:58,271 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:58,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash -948409470, now seen corresponding path program 1 times [2025-03-16 14:52:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:58,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777017843] [2025-03-16 14:52:58,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:58,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-16 14:52:58,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-16 14:52:58,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:58,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 609 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:59,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:59,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777017843] [2025-03-16 14:52:59,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777017843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:59,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779589195] [2025-03-16 14:52:59,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:59,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:59,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:59,340 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:52:59,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 14:52:59,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-16 14:52:59,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-16 14:52:59,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:59,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:59,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:52:59,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:52:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-16 14:52:59,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:52:59,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779589195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:59,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:52:59,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-03-16 14:52:59,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959875417] [2025-03-16 14:52:59,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:59,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:59,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:59,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:59,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:52:59,543 INFO L87 Difference]: Start difference. First operand 21040 states and 22477 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:52:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:59,954 INFO L93 Difference]: Finished difference Result 42640 states and 45527 transitions. [2025-03-16 14:52:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:59,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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 538 [2025-03-16 14:52:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:59,975 INFO L225 Difference]: With dead ends: 42640 [2025-03-16 14:52:59,975 INFO L226 Difference]: Without dead ends: 23259 [2025-03-16 14:52:59,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:52:59,987 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 91 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:59,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 337 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:52:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23259 states. [2025-03-16 14:53:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23259 to 20672. [2025-03-16 14:53:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20672 states, 20671 states have (on average 1.0685985196652314) internal successors, (22089), 20671 states have internal predecessors, (22089), 0 states have call successors, (0), 0 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:53:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20672 states to 20672 states and 22089 transitions. [2025-03-16 14:53:00,183 INFO L78 Accepts]: Start accepts. Automaton has 20672 states and 22089 transitions. Word has length 538 [2025-03-16 14:53:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:00,183 INFO L471 AbstractCegarLoop]: Abstraction has 20672 states and 22089 transitions. [2025-03-16 14:53:00,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:53:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 20672 states and 22089 transitions. [2025-03-16 14:53:00,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-16 14:53:00,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:00,195 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:00,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 14:53:00,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 14:53:00,399 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:00,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1650993547, now seen corresponding path program 1 times [2025-03-16 14:53:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:00,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573451270] [2025-03-16 14:53:00,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:00,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:00,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-16 14:53:00,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-16 14:53:00,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:00,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 191 proven. 406 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 14:53:00,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:00,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573451270] [2025-03-16 14:53:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573451270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:53:00,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934640199] [2025-03-16 14:53:00,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:00,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:53:00,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:53:00,821 INFO L229 MonitoredProcess]: Starting monitored process 11 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:53:00,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 14:53:00,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-16 14:53:01,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-16 14:53:01,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:01,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:01,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 14:53:01,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:53:01,592 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 241 proven. 454 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-16 14:53:01,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:53:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 191 proven. 406 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 14:53:02,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934640199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:53:02,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:53:02,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-03-16 14:53:02,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580247237] [2025-03-16 14:53:02,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:53:02,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 14:53:02,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:02,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 14:53:02,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:53:02,666 INFO L87 Difference]: Start difference. First operand 20672 states and 22089 transitions. Second operand has 10 states, 10 states have (on average 80.4) internal successors, (804), 9 states have internal predecessors, (804), 0 states have call successors, (0), 0 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:53:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:04,528 INFO L93 Difference]: Finished difference Result 38559 states and 41005 transitions. [2025-03-16 14:53:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 14:53:04,529 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 80.4) internal successors, (804), 9 states have internal predecessors, (804), 0 states have call successors, (0), 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 571 [2025-03-16 14:53:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:04,562 INFO L225 Difference]: With dead ends: 38559 [2025-03-16 14:53:04,563 INFO L226 Difference]: Without dead ends: 38557 [2025-03-16 14:53:04,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1144 GetRequests, 1136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:53:04,569 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 695 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 3578 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 3932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 3578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:04,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 140 Invalid, 3932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 3578 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:53:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38557 states. [2025-03-16 14:53:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38557 to 13666. [2025-03-16 14:53:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13666 states, 13665 states have (on average 1.0708379070618368) internal successors, (14633), 13665 states have internal predecessors, (14633), 0 states have call successors, (0), 0 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:53:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13666 states to 13666 states and 14633 transitions. [2025-03-16 14:53:04,776 INFO L78 Accepts]: Start accepts. Automaton has 13666 states and 14633 transitions. Word has length 571 [2025-03-16 14:53:04,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:04,776 INFO L471 AbstractCegarLoop]: Abstraction has 13666 states and 14633 transitions. [2025-03-16 14:53:04,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.4) internal successors, (804), 9 states have internal predecessors, (804), 0 states have call successors, (0), 0 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:53:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 13666 states and 14633 transitions. [2025-03-16 14:53:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-03-16 14:53:04,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:04,784 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:04,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 14:53:04,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-16 14:53:04,985 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:04,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1417004513, now seen corresponding path program 1 times [2025-03-16 14:53:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:04,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914867654] [2025-03-16 14:53:04,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:05,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-03-16 14:53:05,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-03-16 14:53:05,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:05,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:05,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-03-16 14:53:05,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:05,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914867654] [2025-03-16 14:53:05,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914867654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:05,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:05,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:05,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466666558] [2025-03-16 14:53:05,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:05,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:53:05,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:05,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:53:05,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:05,330 INFO L87 Difference]: Start difference. First operand 13666 states and 14633 transitions. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:53:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:06,055 INFO L93 Difference]: Finished difference Result 29918 states and 31981 transitions. [2025-03-16 14:53:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:53:06,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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 585 [2025-03-16 14:53:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:06,071 INFO L225 Difference]: With dead ends: 29918 [2025-03-16 14:53:06,071 INFO L226 Difference]: Without dead ends: 15883 [2025-03-16 14:53:06,080 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:53:06,080 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 185 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:06,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 68 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:53:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2025-03-16 14:53:06,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 13664. [2025-03-16 14:53:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13664 states, 13663 states have (on average 1.070043182317207) internal successors, (14620), 13663 states have internal predecessors, (14620), 0 states have call successors, (0), 0 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:53:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13664 states to 13664 states and 14620 transitions. [2025-03-16 14:53:06,235 INFO L78 Accepts]: Start accepts. Automaton has 13664 states and 14620 transitions. Word has length 585 [2025-03-16 14:53:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:06,236 INFO L471 AbstractCegarLoop]: Abstraction has 13664 states and 14620 transitions. [2025-03-16 14:53:06,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:53:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 13664 states and 14620 transitions. [2025-03-16 14:53:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-03-16 14:53:06,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:06,244 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:53:06,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 14:53:06,245 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:06,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash 664027130, now seen corresponding path program 1 times [2025-03-16 14:53:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:06,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271961204] [2025-03-16 14:53:06,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:06,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-03-16 14:53:06,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-03-16 14:53:06,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:06,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 890 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-16 14:53:06,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:06,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271961204] [2025-03-16 14:53:06,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271961204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:06,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:06,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:06,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596979588] [2025-03-16 14:53:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:06,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:06,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:06,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:06,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:06,600 INFO L87 Difference]: Start difference. First operand 13664 states and 14620 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 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:53:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:07,076 INFO L93 Difference]: Finished difference Result 28251 states and 30123 transitions. [2025-03-16 14:53:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 703 [2025-03-16 14:53:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:07,088 INFO L225 Difference]: With dead ends: 28251 [2025-03-16 14:53:07,089 INFO L226 Difference]: Without dead ends: 14588 [2025-03-16 14:53:07,096 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:53:07,096 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:07,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 62 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:53:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14588 states. [2025-03-16 14:53:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14588 to 12560. [2025-03-16 14:53:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12560 states, 12559 states have (on average 1.0648937017278446) internal successors, (13374), 12559 states have internal predecessors, (13374), 0 states have call successors, (0), 0 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:53:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12560 states to 12560 states and 13374 transitions. [2025-03-16 14:53:07,241 INFO L78 Accepts]: Start accepts. Automaton has 12560 states and 13374 transitions. Word has length 703 [2025-03-16 14:53:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:07,241 INFO L471 AbstractCegarLoop]: Abstraction has 12560 states and 13374 transitions. [2025-03-16 14:53:07,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 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:53:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 12560 states and 13374 transitions. [2025-03-16 14:53:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2025-03-16 14:53:07,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:07,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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:07,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 14:53:07,256 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:07,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:07,257 INFO L85 PathProgramCache]: Analyzing trace with hash -981911775, now seen corresponding path program 1 times [2025-03-16 14:53:07,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:07,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22630093] [2025-03-16 14:53:07,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:07,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:07,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 834 statements into 1 equivalence classes. [2025-03-16 14:53:07,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 834 of 834 statements. [2025-03-16 14:53:07,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:07,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 1314 proven. 73 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2025-03-16 14:53:08,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:08,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22630093] [2025-03-16 14:53:08,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22630093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:53:08,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004416438] [2025-03-16 14:53:08,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:08,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:53:08,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:53:08,191 INFO L229 MonitoredProcess]: Starting monitored process 12 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:53:08,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 14:53:08,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 834 statements into 1 equivalence classes. [2025-03-16 14:53:08,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 834 of 834 statements. [2025-03-16 14:53:08,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:08,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:08,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 14:53:08,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:53:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 975 proven. 496 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-16 14:53:09,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:53:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 975 proven. 496 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-16 14:53:11,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004416438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:53:11,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:53:11,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 13 [2025-03-16 14:53:11,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701072276] [2025-03-16 14:53:11,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:53:11,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 14:53:11,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:11,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 14:53:11,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:53:11,406 INFO L87 Difference]: Start difference. First operand 12560 states and 13374 transitions. Second operand has 13 states, 13 states have (on average 98.38461538461539) internal successors, (1279), 13 states have internal predecessors, (1279), 0 states have call successors, (0), 0 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:53:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:15,599 INFO L93 Difference]: Finished difference Result 32350 states and 34389 transitions. [2025-03-16 14:53:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-16 14:53:15,599 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 98.38461538461539) internal successors, (1279), 13 states have internal predecessors, (1279), 0 states have call successors, (0), 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 834 [2025-03-16 14:53:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:15,616 INFO L225 Difference]: With dead ends: 32350 [2025-03-16 14:53:15,616 INFO L226 Difference]: Without dead ends: 19791 [2025-03-16 14:53:15,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1722 GetRequests, 1683 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=449, Invalid=1191, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 14:53:15,625 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 4210 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8450 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4210 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 9262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 8450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:15,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4210 Valid, 212 Invalid, 9262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 8450 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-16 14:53:15,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19791 states. [2025-03-16 14:53:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19791 to 9418. [2025-03-16 14:53:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9418 states, 9417 states have (on average 1.0630774131889136) internal successors, (10011), 9417 states have internal predecessors, (10011), 0 states have call successors, (0), 0 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:53:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9418 states to 9418 states and 10011 transitions. [2025-03-16 14:53:15,720 INFO L78 Accepts]: Start accepts. Automaton has 9418 states and 10011 transitions. Word has length 834 [2025-03-16 14:53:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:15,720 INFO L471 AbstractCegarLoop]: Abstraction has 9418 states and 10011 transitions. [2025-03-16 14:53:15,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 98.38461538461539) internal successors, (1279), 13 states have internal predecessors, (1279), 0 states have call successors, (0), 0 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:53:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 9418 states and 10011 transitions. [2025-03-16 14:53:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2025-03-16 14:53:15,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:15,728 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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:53:15,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-16 14:53:15,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-16 14:53:15,929 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:15,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1193631343, now seen corresponding path program 1 times [2025-03-16 14:53:15,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:15,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093158685] [2025-03-16 14:53:15,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:15,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:15,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 891 statements into 1 equivalence classes. [2025-03-16 14:53:16,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 891 of 891 statements. [2025-03-16 14:53:16,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:16,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2440 backedges. 1638 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2025-03-16 14:53:16,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:16,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093158685] [2025-03-16 14:53:16,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093158685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:16,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:16,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:16,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103184559] [2025-03-16 14:53:16,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:16,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:16,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:16,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:16,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:16,441 INFO L87 Difference]: Start difference. First operand 9418 states and 10011 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 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:53:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:16,878 INFO L93 Difference]: Finished difference Result 19578 states and 20823 transitions. [2025-03-16 14:53:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:16,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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 891 [2025-03-16 14:53:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:16,887 INFO L225 Difference]: With dead ends: 19578 [2025-03-16 14:53:16,887 INFO L226 Difference]: Without dead ends: 10713 [2025-03-16 14:53:16,891 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:53:16,892 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 126 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:16,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 123 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:53:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10713 states. [2025-03-16 14:53:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10713 to 9418. [2025-03-16 14:53:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9418 states, 9417 states have (on average 1.0625464585324413) internal successors, (10006), 9417 states have internal predecessors, (10006), 0 states have call successors, (0), 0 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:53:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9418 states to 9418 states and 10006 transitions. [2025-03-16 14:53:16,969 INFO L78 Accepts]: Start accepts. Automaton has 9418 states and 10006 transitions. Word has length 891 [2025-03-16 14:53:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:16,969 INFO L471 AbstractCegarLoop]: Abstraction has 9418 states and 10006 transitions. [2025-03-16 14:53:16,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 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:53:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 9418 states and 10006 transitions. [2025-03-16 14:53:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2025-03-16 14:53:16,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:16,993 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:53:16,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 14:53:16,993 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:16,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1086270318, now seen corresponding path program 1 times [2025-03-16 14:53:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063449420] [2025-03-16 14:53:16,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:17,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 914 statements into 1 equivalence classes. [2025-03-16 14:53:17,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 914 of 914 statements. [2025-03-16 14:53:17,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:17,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3097 backedges. 2039 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-16 14:53:17,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:17,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063449420] [2025-03-16 14:53:17,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063449420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:17,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:17,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:17,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614032489] [2025-03-16 14:53:17,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:17,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:17,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:17,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:17,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:17,235 INFO L87 Difference]: Start difference. First operand 9418 states and 10006 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:53:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:17,606 INFO L93 Difference]: Finished difference Result 18654 states and 19817 transitions. [2025-03-16 14:53:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:17,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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 914 [2025-03-16 14:53:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:17,614 INFO L225 Difference]: With dead ends: 18654 [2025-03-16 14:53:17,614 INFO L226 Difference]: Without dead ends: 9605 [2025-03-16 14:53:17,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:17,619 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 112 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:17,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 333 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:53:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9605 states. [2025-03-16 14:53:17,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9605 to 8498. [2025-03-16 14:53:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8498 states, 8497 states have (on average 1.0620218900788514) internal successors, (9024), 8497 states have internal predecessors, (9024), 0 states have call successors, (0), 0 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:53:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8498 states to 8498 states and 9024 transitions. [2025-03-16 14:53:17,681 INFO L78 Accepts]: Start accepts. Automaton has 8498 states and 9024 transitions. Word has length 914 [2025-03-16 14:53:17,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:17,681 INFO L471 AbstractCegarLoop]: Abstraction has 8498 states and 9024 transitions. [2025-03-16 14:53:17,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:53:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 8498 states and 9024 transitions. [2025-03-16 14:53:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2025-03-16 14:53:17,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:17,690 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-16 14:53:17,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 14:53:17,690 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:17,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:17,690 INFO L85 PathProgramCache]: Analyzing trace with hash 350940045, now seen corresponding path program 1 times [2025-03-16 14:53:17,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:17,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976640143] [2025-03-16 14:53:17,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:17,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:17,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1066 statements into 1 equivalence classes. [2025-03-16 14:53:17,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1066 of 1066 statements. [2025-03-16 14:53:17,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:17,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 2832 proven. 0 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2025-03-16 14:53:18,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:18,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976640143] [2025-03-16 14:53:18,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976640143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:18,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:18,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:53:18,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257963536] [2025-03-16 14:53:18,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:18,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:53:18,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:18,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:53:18,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:18,432 INFO L87 Difference]: Start difference. First operand 8498 states and 9024 transitions. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 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:53:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:19,079 INFO L93 Difference]: Finished difference Result 19393 states and 20615 transitions. [2025-03-16 14:53:19,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:53:19,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 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 1066 [2025-03-16 14:53:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:19,090 INFO L225 Difference]: With dead ends: 19393 [2025-03-16 14:53:19,090 INFO L226 Difference]: Without dead ends: 11448 [2025-03-16 14:53:19,096 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:53:19,096 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 181 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:19,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 107 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:53:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11448 states. [2025-03-16 14:53:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11448 to 10342. [2025-03-16 14:53:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10342 states, 10341 states have (on average 1.0621796731457307) internal successors, (10984), 10341 states have internal predecessors, (10984), 0 states have call successors, (0), 0 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:53:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10342 states to 10342 states and 10984 transitions. [2025-03-16 14:53:19,190 INFO L78 Accepts]: Start accepts. Automaton has 10342 states and 10984 transitions. Word has length 1066 [2025-03-16 14:53:19,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:19,190 INFO L471 AbstractCegarLoop]: Abstraction has 10342 states and 10984 transitions. [2025-03-16 14:53:19,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 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:53:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 10342 states and 10984 transitions. [2025-03-16 14:53:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1074 [2025-03-16 14:53:19,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:19,201 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2025-03-16 14:53:19,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 14:53:19,201 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:19,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:19,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2014171519, now seen corresponding path program 1 times [2025-03-16 14:53:19,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:19,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739350899] [2025-03-16 14:53:19,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:19,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:19,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1073 statements into 1 equivalence classes. [2025-03-16 14:53:19,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1073 of 1073 statements. [2025-03-16 14:53:19,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:19,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3397 backedges. 2489 proven. 0 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2025-03-16 14:53:20,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:20,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739350899] [2025-03-16 14:53:20,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739350899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:20,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:20,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:53:20,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454975781] [2025-03-16 14:53:20,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:20,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:53:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:20,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:53:20,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:20,086 INFO L87 Difference]: Start difference. First operand 10342 states and 10984 transitions. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:53:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:20,624 INFO L93 Difference]: Finished difference Result 16988 states and 18008 transitions. [2025-03-16 14:53:20,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:53:20,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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 1073 [2025-03-16 14:53:20,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:20,626 INFO L225 Difference]: With dead ends: 16988 [2025-03-16 14:53:20,626 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:53:20,631 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:53:20,631 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 201 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:20,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 31 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:53:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:53:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:53:20,633 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:53:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:53:20,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1073 [2025-03-16 14:53:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:20,634 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:53:20,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:53:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:53:20,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:53:20,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:53:20,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 14:53:20,640 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:20,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.