./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label04.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/Problem16_label04.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 90fb180caa8b6a5816e65dbd5894ace691fe27eeb9d4238d5c5bc9791f06c4a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:11:45,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:11:45,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:11:45,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:11:45,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:11:45,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:11:45,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:11:45,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:11:45,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:11:45,944 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:11:45,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:11:45,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:11:45,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:11:45,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:11:45,945 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:11:45,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:11:45,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:11:45,945 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:11:45,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:11:45,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:11:45,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:11:45,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:11:45,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:11:45,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:11:45,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:11:45,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:11:45,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:11:45,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:11:45,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:11:45,947 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 -> 90fb180caa8b6a5816e65dbd5894ace691fe27eeb9d4238d5c5bc9791f06c4a2 [2025-03-16 15:11:46,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:11:46,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:11:46,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:11:46,184 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:11:46,185 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:11:46,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label04.c [2025-03-16 15:11:47,292 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6360905a0/58a2573aaba84be79ecf9cdacd610bc7/FLAGcece8357a [2025-03-16 15:11:47,595 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:11:47,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label04.c [2025-03-16 15:11:47,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6360905a0/58a2573aaba84be79ecf9cdacd610bc7/FLAGcece8357a [2025-03-16 15:11:47,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6360905a0/58a2573aaba84be79ecf9cdacd610bc7 [2025-03-16 15:11:47,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:11:47,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:11:47,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:11:47,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:11:47,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:11:47,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:11:47" (1/1) ... [2025-03-16 15:11:47,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340f9b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:47, skipping insertion in model container [2025-03-16 15:11:47,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:11:47" (1/1) ... [2025-03-16 15:11:47,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:11:48,075 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/Problem16_label04.c[3124,3137] [2025-03-16 15:11:48,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:11:48,301 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:11:48,313 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/Problem16_label04.c[3124,3137] [2025-03-16 15:11:48,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:11:48,425 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:11:48,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48 WrapperNode [2025-03-16 15:11:48,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:11:48,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:11:48,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:11:48,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:11:48,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (1/1) ... [2025-03-16 15:11:48,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (1/1) ... [2025-03-16 15:11:48,561 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-16 15:11:48,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:11:48,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:11:48,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:11:48,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:11:48,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (1/1) ... [2025-03-16 15:11:48,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (1/1) ... [2025-03-16 15:11:48,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (1/1) ... [2025-03-16 15:11:48,620 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 15:11:48,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (1/1) ... [2025-03-16 15:11:48,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (1/1) ... [2025-03-16 15:11:48,651 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (1/1) ... [2025-03-16 15:11:48,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (1/1) ... [2025-03-16 15:11:48,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (1/1) ... [2025-03-16 15:11:48,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (1/1) ... [2025-03-16 15:11:48,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:11:48,683 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:11:48,683 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:11:48,684 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:11:48,684 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (1/1) ... [2025-03-16 15:11:48,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:11:48,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:48,708 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 15:11:48,713 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 15:11:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:11:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:11:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:11:48,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:11:48,779 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:11:48,781 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:11:50,311 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-16 15:11:50,379 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-16 15:11:50,379 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:11:50,399 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:11:50,400 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:11:50,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:50 BoogieIcfgContainer [2025-03-16 15:11:50,401 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:11:50,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:11:50,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:11:50,406 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:11:50,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:11:47" (1/3) ... [2025-03-16 15:11:50,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d28610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:11:50, skipping insertion in model container [2025-03-16 15:11:50,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:48" (2/3) ... [2025-03-16 15:11:50,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d28610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:11:50, skipping insertion in model container [2025-03-16 15:11:50,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:50" (3/3) ... [2025-03-16 15:11:50,409 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label04.c [2025-03-16 15:11:50,421 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:11:50,422 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label04.c that has 1 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:11:50,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:11:50,491 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;@55eebaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:11:50,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:11:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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 15:11:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 15:11:50,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:50,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:50,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:50,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1922676748, now seen corresponding path program 1 times [2025-03-16 15:11:50,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:50,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574371666] [2025-03-16 15:11:50,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:50,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 15:11:50,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 15:11:50,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:50,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:50,632 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 15:11:50,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:50,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574371666] [2025-03-16 15:11:50,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574371666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:50,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:50,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553176523] [2025-03-16 15:11:50,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:50,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:11:50,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:50,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:11:50,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:11:50,661 INFO L87 Difference]: Start difference. First operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 0 states have call successors, (0), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:50,711 INFO L93 Difference]: Finished difference Result 669 states and 1321 transitions. [2025-03-16 15:11:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:11:50,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-16 15:11:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:50,720 INFO L225 Difference]: With dead ends: 669 [2025-03-16 15:11:50,722 INFO L226 Difference]: Without dead ends: 332 [2025-03-16 15:11:50,727 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 15:11:50,729 INFO L435 NwaCegarLoop]: 599 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, 599 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 15:11:50,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:11:50,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-16 15:11:50,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-16 15:11:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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 15:11:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2025-03-16 15:11:50,790 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 27 [2025-03-16 15:11:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:50,791 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2025-03-16 15:11:50,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2025-03-16 15:11:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 15:11:50,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:50,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:50,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:11:50,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:50,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash -437212820, now seen corresponding path program 1 times [2025-03-16 15:11:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:50,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579544869] [2025-03-16 15:11:50,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:50,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:50,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 15:11:50,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 15:11:50,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:50,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:50,948 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 15:11:50,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:50,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579544869] [2025-03-16 15:11:50,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579544869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:50,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:50,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:50,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408657488] [2025-03-16 15:11:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:50,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:50,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:50,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:50,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:50,952 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:52,111 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2025-03-16 15:11:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:52,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-16 15:11:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:52,115 INFO L225 Difference]: With dead ends: 992 [2025-03-16 15:11:52,115 INFO L226 Difference]: Without dead ends: 661 [2025-03-16 15:11:52,116 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 15:11:52,116 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 343 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:52,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 200 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:11:52,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-16 15:11:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2025-03-16 15:11:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5196969696969698) internal successors, (1003), 660 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states 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 15:11:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1003 transitions. [2025-03-16 15:11:52,143 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1003 transitions. Word has length 27 [2025-03-16 15:11:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:52,143 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1003 transitions. [2025-03-16 15:11:52,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1003 transitions. [2025-03-16 15:11:52,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 15:11:52,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:52,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:11:52,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:11:52,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:52,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:52,147 INFO L85 PathProgramCache]: Analyzing trace with hash -507228426, now seen corresponding path program 1 times [2025-03-16 15:11:52,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:52,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29406604] [2025-03-16 15:11:52,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:52,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:52,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 15:11:52,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 15:11:52,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:52,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:52,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:52,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29406604] [2025-03-16 15:11:52,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29406604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:52,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:52,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:52,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188197112] [2025-03-16 15:11:52,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:52,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:11:52,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:52,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:11:52,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:11:52,519 INFO L87 Difference]: Start difference. First operand 661 states and 1003 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:54,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:54,249 INFO L93 Difference]: Finished difference Result 2308 states and 3413 transitions. [2025-03-16 15:11:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:11:54,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-16 15:11:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:54,256 INFO L225 Difference]: With dead ends: 2308 [2025-03-16 15:11:54,256 INFO L226 Difference]: Without dead ends: 1648 [2025-03-16 15:11:54,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:11:54,257 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1007 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:54,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 41 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:11:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-16 15:11:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2025-03-16 15:11:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.4019429265330905) internal successors, (2309), 1647 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states 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 15:11:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2309 transitions. [2025-03-16 15:11:54,308 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2309 transitions. Word has length 95 [2025-03-16 15:11:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:54,308 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2309 transitions. [2025-03-16 15:11:54,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2309 transitions. [2025-03-16 15:11:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-16 15:11:54,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:54,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:11:54,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:11:54,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:54,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:54,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1846424556, now seen corresponding path program 1 times [2025-03-16 15:11:54,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:54,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104824174] [2025-03-16 15:11:54,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:54,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:54,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-16 15:11:54,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-16 15:11:54,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:54,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:54,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:54,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104824174] [2025-03-16 15:11:54,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104824174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:54,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:54,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:54,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429420438] [2025-03-16 15:11:54,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:54,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:54,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:54,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:54,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:54,471 INFO L87 Difference]: Start difference. First operand 1648 states and 2309 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:55,574 INFO L93 Difference]: Finished difference Result 3624 states and 5241 transitions. [2025-03-16 15:11:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:55,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2025-03-16 15:11:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:55,583 INFO L225 Difference]: With dead ends: 3624 [2025-03-16 15:11:55,583 INFO L226 Difference]: Without dead ends: 2306 [2025-03-16 15:11:55,586 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 15:11:55,588 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:55,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 76 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:11:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-16 15:11:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2306. [2025-03-16 15:11:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.350108459869848) internal successors, (3112), 2305 states have internal predecessors, (3112), 0 states have call successors, (0), 0 states 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 15:11:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3112 transitions. [2025-03-16 15:11:55,637 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3112 transitions. Word has length 158 [2025-03-16 15:11:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:55,637 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 3112 transitions. [2025-03-16 15:11:55,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3112 transitions. [2025-03-16 15:11:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-16 15:11:55,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:55,643 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:55,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:11:55,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:55,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:55,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1941257408, now seen corresponding path program 1 times [2025-03-16 15:11:55,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:55,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088876980] [2025-03-16 15:11:55,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:55,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:55,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-16 15:11:55,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-16 15:11:55,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:55,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 15:11:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088876980] [2025-03-16 15:11:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088876980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:55,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:55,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492521491] [2025-03-16 15:11:55,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:55,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:55,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:55,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:55,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:55,804 INFO L87 Difference]: Start difference. First operand 2306 states and 3112 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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 15:11:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:56,708 INFO L93 Difference]: Finished difference Result 5598 states and 7698 transitions. [2025-03-16 15:11:56,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:56,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 193 [2025-03-16 15:11:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:56,720 INFO L225 Difference]: With dead ends: 5598 [2025-03-16 15:11:56,721 INFO L226 Difference]: Without dead ends: 3622 [2025-03-16 15:11:56,723 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 15:11:56,725 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:56,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 154 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:11:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-03-16 15:11:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 2964. [2025-03-16 15:11:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2964 states, 2963 states have (on average 1.2443469456631793) internal successors, (3687), 2963 states have internal predecessors, (3687), 0 states have call successors, (0), 0 states 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 15:11:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 3687 transitions. [2025-03-16 15:11:56,773 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 3687 transitions. Word has length 193 [2025-03-16 15:11:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:56,774 INFO L471 AbstractCegarLoop]: Abstraction has 2964 states and 3687 transitions. [2025-03-16 15:11:56,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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 15:11:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 3687 transitions. [2025-03-16 15:11:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-16 15:11:56,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:56,777 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:56,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:11:56,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:56,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1118435834, now seen corresponding path program 1 times [2025-03-16 15:11:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:56,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082196848] [2025-03-16 15:11:56,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:56,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-16 15:11:56,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-16 15:11:56,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:56,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:56,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:56,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082196848] [2025-03-16 15:11:56,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082196848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:56,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:56,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:56,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369871097] [2025-03-16 15:11:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:56,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:56,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:56,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:56,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:56,909 INFO L87 Difference]: Start difference. First operand 2964 states and 3687 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states 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 15:11:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:57,705 INFO L93 Difference]: Finished difference Result 6914 states and 8656 transitions. [2025-03-16 15:11:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:57,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-16 15:11:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:57,716 INFO L225 Difference]: With dead ends: 6914 [2025-03-16 15:11:57,716 INFO L226 Difference]: Without dead ends: 3951 [2025-03-16 15:11:57,719 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 15:11:57,719 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 287 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:57,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 537 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:11:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-03-16 15:11:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2025-03-16 15:11:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.0736708860759494) internal successors, (4241), 3950 states have internal predecessors, (4241), 0 states have call successors, (0), 0 states 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 15:11:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4241 transitions. [2025-03-16 15:11:57,769 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4241 transitions. Word has length 210 [2025-03-16 15:11:57,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:57,770 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4241 transitions. [2025-03-16 15:11:57,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states 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 15:11:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4241 transitions. [2025-03-16 15:11:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-16 15:11:57,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:57,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:11:57,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:11:57,772 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:57,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:57,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1178877680, now seen corresponding path program 1 times [2025-03-16 15:11:57,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:57,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47462178] [2025-03-16 15:11:57,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:57,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:57,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-16 15:11:57,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-16 15:11:57,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:57,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 15:11:58,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47462178] [2025-03-16 15:11:58,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47462178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747447510] [2025-03-16 15:11:58,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:58,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:58,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:58,055 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 15:11:58,056 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 15:11:58,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-16 15:11:58,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-16 15:11:58,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:58,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:58,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:11:58,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 15:11:58,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:11:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747447510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:58,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:11:58,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 15:11:58,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664096812] [2025-03-16 15:11:58,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:58,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:58,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:58,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:58,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:11:58,402 INFO L87 Difference]: Start difference. First operand 3951 states and 4241 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:59,057 INFO L93 Difference]: Finished difference Result 4611 states and 4920 transitions. [2025-03-16 15:11:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:59,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2025-03-16 15:11:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:59,068 INFO L225 Difference]: With dead ends: 4611 [2025-03-16 15:11:59,068 INFO L226 Difference]: Without dead ends: 4609 [2025-03-16 15:11:59,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:11:59,070 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 117 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:59,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 82 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:11:59,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2025-03-16 15:11:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4280. [2025-03-16 15:11:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.0710446365973358) internal successors, (4583), 4279 states have internal predecessors, (4583), 0 states have call successors, (0), 0 states 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 15:11:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 4583 transitions. [2025-03-16 15:11:59,122 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 4583 transitions. Word has length 262 [2025-03-16 15:11:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:59,123 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 4583 transitions. [2025-03-16 15:11:59,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 4583 transitions. [2025-03-16 15:11:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-16 15:11:59,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:59,131 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:11:59,137 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 15:11:59,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:59,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:59,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2023115821, now seen corresponding path program 1 times [2025-03-16 15:11:59,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:59,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181316646] [2025-03-16 15:11:59,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:59,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:59,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-16 15:11:59,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-16 15:11:59,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:59,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 15:11:59,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:59,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181316646] [2025-03-16 15:11:59,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181316646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:59,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:59,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:59,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713027417] [2025-03-16 15:11:59,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:59,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:59,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:59,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:59,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:59,689 INFO L87 Difference]: Start difference. First operand 4280 states and 4583 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:00,406 INFO L93 Difference]: Finished difference Result 10204 states and 10951 transitions. [2025-03-16 15:12:00,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:00,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 498 [2025-03-16 15:12:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:00,418 INFO L225 Difference]: With dead ends: 10204 [2025-03-16 15:12:00,418 INFO L226 Difference]: Without dead ends: 5925 [2025-03-16 15:12:00,422 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 15:12:00,423 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 219 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:00,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 434 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:12:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5925 states. [2025-03-16 15:12:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5925 to 5596. [2025-03-16 15:12:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.059159964253798) internal successors, (5926), 5595 states have internal predecessors, (5926), 0 states have call successors, (0), 0 states 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 15:12:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 5926 transitions. [2025-03-16 15:12:00,482 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 5926 transitions. Word has length 498 [2025-03-16 15:12:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:00,483 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 5926 transitions. [2025-03-16 15:12:00,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 5926 transitions. [2025-03-16 15:12:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-03-16 15:12:00,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:00,491 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:00,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:12:00,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:00,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash 90117632, now seen corresponding path program 1 times [2025-03-16 15:12:00,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:00,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828046949] [2025-03-16 15:12:00,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:00,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:00,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-03-16 15:12:00,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-03-16 15:12:00,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:00,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 15:12:00,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:00,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828046949] [2025-03-16 15:12:00,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828046949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:00,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:00,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:00,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097947813] [2025-03-16 15:12:00,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:00,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:00,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:00,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:00,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:00,808 INFO L87 Difference]: Start difference. First operand 5596 states and 5926 transitions. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states 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 15:12:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:01,531 INFO L93 Difference]: Finished difference Result 12836 states and 13637 transitions. [2025-03-16 15:12:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:01,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 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 561 [2025-03-16 15:12:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:01,548 INFO L225 Difference]: With dead ends: 12836 [2025-03-16 15:12:01,548 INFO L226 Difference]: Without dead ends: 7570 [2025-03-16 15:12:01,552 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 15:12:01,553 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 178 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:01,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 415 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:12:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2025-03-16 15:12:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 7241. [2025-03-16 15:12:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7241 states, 7240 states have (on average 1.043232044198895) internal successors, (7553), 7240 states have internal predecessors, (7553), 0 states have call successors, (0), 0 states 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 15:12:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 7553 transitions. [2025-03-16 15:12:01,627 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 7553 transitions. Word has length 561 [2025-03-16 15:12:01,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:01,627 INFO L471 AbstractCegarLoop]: Abstraction has 7241 states and 7553 transitions. [2025-03-16 15:12:01,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states 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 15:12:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 7553 transitions. [2025-03-16 15:12:01,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 721 [2025-03-16 15:12:01,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:01,644 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:01,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:12:01,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:01,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:01,645 INFO L85 PathProgramCache]: Analyzing trace with hash -863468940, now seen corresponding path program 1 times [2025-03-16 15:12:01,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:01,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087073192] [2025-03-16 15:12:01,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:01,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:01,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 720 statements into 1 equivalence classes. [2025-03-16 15:12:01,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 720 of 720 statements. [2025-03-16 15:12:01,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:01,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-03-16 15:12:01,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:01,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087073192] [2025-03-16 15:12:01,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087073192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:01,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:01,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:01,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143287209] [2025-03-16 15:12:01,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:01,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:01,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:01,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:01,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:01,990 INFO L87 Difference]: Start difference. First operand 7241 states and 7553 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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 15:12:02,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:02,660 INFO L93 Difference]: Finished difference Result 16784 states and 17502 transitions. [2025-03-16 15:12:02,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:02,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 720 [2025-03-16 15:12:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:02,674 INFO L225 Difference]: With dead ends: 16784 [2025-03-16 15:12:02,674 INFO L226 Difference]: Without dead ends: 9544 [2025-03-16 15:12:02,679 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 15:12:02,680 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 306 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:02,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 442 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9544 states. [2025-03-16 15:12:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9544 to 9215. [2025-03-16 15:12:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.038962448448014) internal successors, (9573), 9214 states have internal predecessors, (9573), 0 states have call successors, (0), 0 states 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 15:12:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9573 transitions. [2025-03-16 15:12:02,780 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9573 transitions. Word has length 720 [2025-03-16 15:12:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:02,781 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9573 transitions. [2025-03-16 15:12:02,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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 15:12:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9573 transitions. [2025-03-16 15:12:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-03-16 15:12:02,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:02,793 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:02,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:12:02,793 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:02,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1051800045, now seen corresponding path program 1 times [2025-03-16 15:12:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:02,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160472146] [2025-03-16 15:12:02,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:02,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:02,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-03-16 15:12:02,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-03-16 15:12:02,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:02,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 78 proven. 573 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-16 15:12:03,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:03,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160472146] [2025-03-16 15:12:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160472146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:03,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241213855] [2025-03-16 15:12:03,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:03,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:03,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:03,586 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 15:12:03,599 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 15:12:03,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-03-16 15:12:03,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-03-16 15:12:03,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:03,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:03,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:12:03,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2025-03-16 15:12:03,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:12:03,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241213855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:03,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:12:03,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:12:03,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434210213] [2025-03-16 15:12:03,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:03,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:03,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:03,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:03,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:12:03,838 INFO L87 Difference]: Start difference. First operand 9215 states and 9573 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states 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 15:12:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:04,400 INFO L93 Difference]: Finished difference Result 18100 states and 18814 transitions. [2025-03-16 15:12:04,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:04,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 838 [2025-03-16 15:12:04,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:04,414 INFO L225 Difference]: With dead ends: 18100 [2025-03-16 15:12:04,415 INFO L226 Difference]: Without dead ends: 9215 [2025-03-16 15:12:04,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 838 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:12:04,421 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 339 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:04,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 375 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:04,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9215 states. [2025-03-16 15:12:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9215 to 9215. [2025-03-16 15:12:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.0336444540915997) internal successors, (9524), 9214 states have internal predecessors, (9524), 0 states have call successors, (0), 0 states 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 15:12:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9524 transitions. [2025-03-16 15:12:04,486 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9524 transitions. Word has length 838 [2025-03-16 15:12:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:04,487 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9524 transitions. [2025-03-16 15:12:04,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states 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 15:12:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9524 transitions. [2025-03-16 15:12:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1252 [2025-03-16 15:12:04,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:04,516 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, 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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:04,523 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 15:12:04,716 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,SelfDestructingSolverStorable10 [2025-03-16 15:12:04,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:04,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2132612381, now seen corresponding path program 1 times [2025-03-16 15:12:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:04,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992533931] [2025-03-16 15:12:04,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:04,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:04,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1251 statements into 1 equivalence classes. [2025-03-16 15:12:04,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1251 of 1251 statements. [2025-03-16 15:12:04,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:04,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2798 backedges. 1579 proven. 0 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2025-03-16 15:12:05,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:05,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992533931] [2025-03-16 15:12:05,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992533931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:05,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:05,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:05,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923136072] [2025-03-16 15:12:05,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:05,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:05,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:05,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:05,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:05,636 INFO L87 Difference]: Start difference. First operand 9215 states and 9524 transitions. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states 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 15:12:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:06,175 INFO L93 Difference]: Finished difference Result 19745 states and 20449 transitions. [2025-03-16 15:12:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:06,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 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 1251 [2025-03-16 15:12:06,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:06,191 INFO L225 Difference]: With dead ends: 19745 [2025-03-16 15:12:06,191 INFO L226 Difference]: Without dead ends: 10860 [2025-03-16 15:12:06,199 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 15:12:06,199 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:06,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 443 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:06,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2025-03-16 15:12:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 9873. [2025-03-16 15:12:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9873 states, 9872 states have (on average 1.0310980551053484) internal successors, (10179), 9872 states have internal predecessors, (10179), 0 states have call successors, (0), 0 states 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 15:12:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9873 states to 9873 states and 10179 transitions. [2025-03-16 15:12:06,282 INFO L78 Accepts]: Start accepts. Automaton has 9873 states and 10179 transitions. Word has length 1251 [2025-03-16 15:12:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:06,283 INFO L471 AbstractCegarLoop]: Abstraction has 9873 states and 10179 transitions. [2025-03-16 15:12:06,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states 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 15:12:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 9873 states and 10179 transitions. [2025-03-16 15:12:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1270 [2025-03-16 15:12:06,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:06,296 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:06,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:12:06,297 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:06,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1152795474, now seen corresponding path program 1 times [2025-03-16 15:12:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:06,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215695491] [2025-03-16 15:12:06,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:06,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1269 statements into 1 equivalence classes. [2025-03-16 15:12:06,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1269 of 1269 statements. [2025-03-16 15:12:06,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:06,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2828 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 2647 trivial. 0 not checked. [2025-03-16 15:12:06,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:06,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215695491] [2025-03-16 15:12:06,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215695491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:06,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:06,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:06,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751090277] [2025-03-16 15:12:06,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:06,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:06,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:06,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:06,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:06,874 INFO L87 Difference]: Start difference. First operand 9873 states and 10179 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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 15:12:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:07,557 INFO L93 Difference]: Finished difference Result 21390 states and 22126 transitions. [2025-03-16 15:12:07,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:07,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 1269 [2025-03-16 15:12:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:07,572 INFO L225 Difference]: With dead ends: 21390 [2025-03-16 15:12:07,572 INFO L226 Difference]: Without dead ends: 11518 [2025-03-16 15:12:07,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:07,580 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 304 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:07,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 438 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11518 states. [2025-03-16 15:12:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11518 to 11189. [2025-03-16 15:12:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11189 states, 11188 states have (on average 1.0289595995709688) internal successors, (11512), 11188 states have internal predecessors, (11512), 0 states have call successors, (0), 0 states 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 15:12:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 11512 transitions. [2025-03-16 15:12:07,671 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 11512 transitions. Word has length 1269 [2025-03-16 15:12:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:07,672 INFO L471 AbstractCegarLoop]: Abstraction has 11189 states and 11512 transitions. [2025-03-16 15:12:07,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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 15:12:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 11512 transitions. [2025-03-16 15:12:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1277 [2025-03-16 15:12:07,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:07,689 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:12:07,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:12:07,689 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:07,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:07,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1537077647, now seen corresponding path program 1 times [2025-03-16 15:12:07,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:07,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560827849] [2025-03-16 15:12:07,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:07,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:07,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes. [2025-03-16 15:12:07,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements. [2025-03-16 15:12:07,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:07,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3351 backedges. 770 proven. 0 refuted. 0 times theorem prover too weak. 2581 trivial. 0 not checked. [2025-03-16 15:12:08,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:08,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560827849] [2025-03-16 15:12:08,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560827849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:08,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:08,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:12:08,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272393225] [2025-03-16 15:12:08,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:08,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:08,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:08,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:08,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:08,688 INFO L87 Difference]: Start difference. First operand 11189 states and 11512 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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 15:12:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:09,406 INFO L93 Difference]: Finished difference Result 11853 states and 12177 transitions. [2025-03-16 15:12:09,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:12:09,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 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 1276 [2025-03-16 15:12:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:09,422 INFO L225 Difference]: With dead ends: 11853 [2025-03-16 15:12:09,422 INFO L226 Difference]: Without dead ends: 11518 [2025-03-16 15:12:09,425 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 15:12:09,426 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 252 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:09,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 424 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:12:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11518 states. [2025-03-16 15:12:09,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11518 to 11189. [2025-03-16 15:12:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11189 states, 11188 states have (on average 1.0288702180908116) internal successors, (11511), 11188 states have internal predecessors, (11511), 0 states have call successors, (0), 0 states 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 15:12:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 11511 transitions. [2025-03-16 15:12:09,507 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 11511 transitions. Word has length 1276 [2025-03-16 15:12:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:09,507 INFO L471 AbstractCegarLoop]: Abstraction has 11189 states and 11511 transitions. [2025-03-16 15:12:09,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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 15:12:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 11511 transitions. [2025-03-16 15:12:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1339 [2025-03-16 15:12:09,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:09,522 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, 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, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:12:09,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:12:09,522 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:09,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1315569612, now seen corresponding path program 1 times [2025-03-16 15:12:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:09,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726212943] [2025-03-16 15:12:09,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:09,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:09,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1338 statements into 1 equivalence classes. [2025-03-16 15:12:09,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1338 of 1338 statements. [2025-03-16 15:12:09,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:09,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3650 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 3443 trivial. 0 not checked. [2025-03-16 15:12:10,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:10,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726212943] [2025-03-16 15:12:10,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726212943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:10,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:10,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:10,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131482030] [2025-03-16 15:12:10,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:10,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:10,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:10,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:10,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:10,308 INFO L87 Difference]: Start difference. First operand 11189 states and 11511 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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 15:12:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:10,618 INFO L93 Difference]: Finished difference Result 11525 states and 11847 transitions. [2025-03-16 15:12:10,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:10,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 1338 [2025-03-16 15:12:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:10,630 INFO L225 Difference]: With dead ends: 11525 [2025-03-16 15:12:10,631 INFO L226 Difference]: Without dead ends: 11189 [2025-03-16 15:12:10,633 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 15:12:10,634 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:10,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 440 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:12:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2025-03-16 15:12:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 11189. [2025-03-16 15:12:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11189 states, 11188 states have (on average 1.0287808366106543) internal successors, (11510), 11188 states have internal predecessors, (11510), 0 states have call successors, (0), 0 states 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 15:12:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 11510 transitions. [2025-03-16 15:12:10,705 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 11510 transitions. Word has length 1338 [2025-03-16 15:12:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:10,706 INFO L471 AbstractCegarLoop]: Abstraction has 11189 states and 11510 transitions. [2025-03-16 15:12:10,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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 15:12:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 11510 transitions. [2025-03-16 15:12:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2025-03-16 15:12:10,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:10,720 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, 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, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:12:10,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:12:10,721 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:10,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:10,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1279538562, now seen corresponding path program 1 times [2025-03-16 15:12:10,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:10,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247387446] [2025-03-16 15:12:10,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:10,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:10,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1359 statements into 1 equivalence classes. [2025-03-16 15:12:10,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1359 of 1359 statements. [2025-03-16 15:12:10,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:10,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3734 backedges. 1127 proven. 0 refuted. 0 times theorem prover too weak. 2607 trivial. 0 not checked. [2025-03-16 15:12:11,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:11,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247387446] [2025-03-16 15:12:11,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247387446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:11,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:11,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:11,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011184658] [2025-03-16 15:12:11,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:11,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:11,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:11,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:11,294 INFO L87 Difference]: Start difference. First operand 11189 states and 11510 transitions. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 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 15:12:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:11,871 INFO L93 Difference]: Finished difference Result 22706 states and 23354 transitions. [2025-03-16 15:12:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:11,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 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) Word has length 1359 [2025-03-16 15:12:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:11,880 INFO L225 Difference]: With dead ends: 22706 [2025-03-16 15:12:11,880 INFO L226 Difference]: Without dead ends: 10531 [2025-03-16 15:12:11,888 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 15:12:11,888 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 168 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:11,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 420 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10531 states. [2025-03-16 15:12:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10531 to 10531. [2025-03-16 15:12:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 1.0268755935422602) internal successors, (10813), 10530 states have internal predecessors, (10813), 0 states have call successors, (0), 0 states 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 15:12:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 10813 transitions. [2025-03-16 15:12:11,959 INFO L78 Accepts]: Start accepts. Automaton has 10531 states and 10813 transitions. Word has length 1359 [2025-03-16 15:12:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:11,960 INFO L471 AbstractCegarLoop]: Abstraction has 10531 states and 10813 transitions. [2025-03-16 15:12:11,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 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 15:12:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 10531 states and 10813 transitions. [2025-03-16 15:12:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1608 [2025-03-16 15:12:11,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:11,978 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:11,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:12:11,978 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:11,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:11,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1722789660, now seen corresponding path program 1 times [2025-03-16 15:12:11,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:11,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718338920] [2025-03-16 15:12:11,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:11,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:12,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1607 statements into 1 equivalence classes. [2025-03-16 15:12:12,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1607 of 1607 statements. [2025-03-16 15:12:12,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:12,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4008 backedges. 2923 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2025-03-16 15:12:13,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718338920] [2025-03-16 15:12:13,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718338920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:13,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:13,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:12:13,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885417065] [2025-03-16 15:12:13,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:13,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:13,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:13,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:13,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:13,387 INFO L87 Difference]: Start difference. First operand 10531 states and 10813 transitions. Second operand has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states 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 15:12:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:14,274 INFO L93 Difference]: Finished difference Result 20743 states and 21305 transitions. [2025-03-16 15:12:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:12:14,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 1607 [2025-03-16 15:12:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:14,283 INFO L225 Difference]: With dead ends: 20743 [2025-03-16 15:12:14,283 INFO L226 Difference]: Without dead ends: 10542 [2025-03-16 15:12:14,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:12:14,290 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 218 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:14,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 436 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:12:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10542 states. [2025-03-16 15:12:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10542 to 10531. [2025-03-16 15:12:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 1.0264957264957264) internal successors, (10809), 10530 states have internal predecessors, (10809), 0 states have call successors, (0), 0 states 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 15:12:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 10809 transitions. [2025-03-16 15:12:14,387 INFO L78 Accepts]: Start accepts. Automaton has 10531 states and 10809 transitions. Word has length 1607 [2025-03-16 15:12:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:14,387 INFO L471 AbstractCegarLoop]: Abstraction has 10531 states and 10809 transitions. [2025-03-16 15:12:14,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states 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 15:12:14,388 INFO L276 IsEmpty]: Start isEmpty. Operand 10531 states and 10809 transitions. [2025-03-16 15:12:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1693 [2025-03-16 15:12:14,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:14,420 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, 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, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:14,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:12:14,420 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:14,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash 499428213, now seen corresponding path program 1 times [2025-03-16 15:12:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:14,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948615733] [2025-03-16 15:12:14,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:14,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:14,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1692 statements into 1 equivalence classes. [2025-03-16 15:12:14,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1692 of 1692 statements. [2025-03-16 15:12:14,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:14,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5116 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 4883 trivial. 0 not checked. [2025-03-16 15:12:15,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:15,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948615733] [2025-03-16 15:12:15,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948615733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:15,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:15,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:15,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221064571] [2025-03-16 15:12:15,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:15,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:15,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:15,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:15,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:15,718 INFO L87 Difference]: Start difference. First operand 10531 states and 10809 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states 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 15:12:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:16,251 INFO L93 Difference]: Finished difference Result 20732 states and 21286 transitions. [2025-03-16 15:12:16,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:16,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 1692 [2025-03-16 15:12:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:16,259 INFO L225 Difference]: With dead ends: 20732 [2025-03-16 15:12:16,259 INFO L226 Difference]: Without dead ends: 10531 [2025-03-16 15:12:16,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 15:12:16,264 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 318 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:16,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 36 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10531 states. [2025-03-16 15:12:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10531 to 10202. [2025-03-16 15:12:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10201 states have (on average 1.024213312420351) internal successors, (10448), 10201 states have internal predecessors, (10448), 0 states have call successors, (0), 0 states 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 15:12:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 10448 transitions. [2025-03-16 15:12:16,328 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 10448 transitions. Word has length 1692 [2025-03-16 15:12:16,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:16,329 INFO L471 AbstractCegarLoop]: Abstraction has 10202 states and 10448 transitions. [2025-03-16 15:12:16,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states 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 15:12:16,329 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 10448 transitions. [2025-03-16 15:12:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-16 15:12:16,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:16,344 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, 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, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:16,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:12:16,344 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:16,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:16,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1322689425, now seen corresponding path program 1 times [2025-03-16 15:12:16,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:16,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760824476] [2025-03-16 15:12:16,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:16,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:16,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1717 statements into 1 equivalence classes. [2025-03-16 15:12:16,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1717 of 1717 statements. [2025-03-16 15:12:16,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:16,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5229 backedges. 3830 proven. 132 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2025-03-16 15:12:17,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:17,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760824476] [2025-03-16 15:12:17,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760824476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:17,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834665034] [2025-03-16 15:12:17,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:17,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:17,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:17,571 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 15:12:17,573 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 15:12:17,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1717 statements into 1 equivalence classes. [2025-03-16 15:12:17,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1717 of 1717 statements. [2025-03-16 15:12:17,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:17,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:17,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1981 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:12:17,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5229 backedges. 2280 proven. 201 refuted. 0 times theorem prover too weak. 2748 trivial. 0 not checked. [2025-03-16 15:12:19,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:12:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5229 backedges. 2280 proven. 201 refuted. 0 times theorem prover too weak. 2748 trivial. 0 not checked. [2025-03-16 15:12:23,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834665034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:12:23,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:12:23,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-16 15:12:23,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038296754] [2025-03-16 15:12:23,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:12:23,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:12:23,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:23,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:12:23,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:12:23,077 INFO L87 Difference]: Start difference. First operand 10202 states and 10448 transitions. Second operand has 9 states, 9 states have (on average 204.44444444444446) internal successors, (1840), 9 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states 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 15:12:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:27,117 INFO L93 Difference]: Finished difference Result 33236 states and 34114 transitions. [2025-03-16 15:12:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 15:12:27,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 204.44444444444446) internal successors, (1840), 9 states have internal predecessors, (1840), 0 states have call successors, (0), 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 1717 [2025-03-16 15:12:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:27,138 INFO L225 Difference]: With dead ends: 33236 [2025-03-16 15:12:27,138 INFO L226 Difference]: Without dead ends: 23364 [2025-03-16 15:12:27,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3459 GetRequests, 3441 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-03-16 15:12:27,149 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 3055 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 8023 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3055 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 8537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 8023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:27,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3055 Valid, 98 Invalid, 8537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 8023 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-16 15:12:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23364 states. [2025-03-16 15:12:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23364 to 17440. [2025-03-16 15:12:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17440 states, 17439 states have (on average 1.0250587763059809) internal successors, (17876), 17439 states have internal predecessors, (17876), 0 states have call successors, (0), 0 states 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 15:12:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17440 states to 17440 states and 17876 transitions. [2025-03-16 15:12:27,340 INFO L78 Accepts]: Start accepts. Automaton has 17440 states and 17876 transitions. Word has length 1717 [2025-03-16 15:12:27,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:27,341 INFO L471 AbstractCegarLoop]: Abstraction has 17440 states and 17876 transitions. [2025-03-16 15:12:27,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 204.44444444444446) internal successors, (1840), 9 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states 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 15:12:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 17440 states and 17876 transitions. [2025-03-16 15:12:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1810 [2025-03-16 15:12:27,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:27,362 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 9, 9, 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, 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, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:27,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:12:27,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:27,563 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:27,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:27,564 INFO L85 PathProgramCache]: Analyzing trace with hash -19222565, now seen corresponding path program 1 times [2025-03-16 15:12:27,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:27,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529119940] [2025-03-16 15:12:27,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:27,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:27,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1809 statements into 1 equivalence classes. [2025-03-16 15:12:27,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1809 of 1809 statements. [2025-03-16 15:12:27,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:27,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6142 backedges. 2525 proven. 0 refuted. 0 times theorem prover too weak. 3617 trivial. 0 not checked. [2025-03-16 15:12:28,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:28,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529119940] [2025-03-16 15:12:28,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529119940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:28,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:28,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844670554] [2025-03-16 15:12:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:28,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:28,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:28,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:28,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:28,816 INFO L87 Difference]: Start difference. First operand 17440 states and 17876 transitions. Second operand has 4 states, 4 states have (on average 182.5) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states 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 15:12:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:29,341 INFO L93 Difference]: Finished difference Result 34879 states and 35754 transitions. [2025-03-16 15:12:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:29,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 182.5) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 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 1809 [2025-03-16 15:12:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:29,356 INFO L225 Difference]: With dead ends: 34879 [2025-03-16 15:12:29,356 INFO L226 Difference]: Without dead ends: 17769 [2025-03-16 15:12:29,366 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 15:12:29,366 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 267 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:29,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 100 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17769 states. [2025-03-16 15:12:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17769 to 17769. [2025-03-16 15:12:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17769 states, 17768 states have (on average 1.02470733903647) internal successors, (18207), 17768 states have internal predecessors, (18207), 0 states have call successors, (0), 0 states 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 15:12:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17769 states to 17769 states and 18207 transitions. [2025-03-16 15:12:29,486 INFO L78 Accepts]: Start accepts. Automaton has 17769 states and 18207 transitions. Word has length 1809 [2025-03-16 15:12:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:29,486 INFO L471 AbstractCegarLoop]: Abstraction has 17769 states and 18207 transitions. [2025-03-16 15:12:29,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.5) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states 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 15:12:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 17769 states and 18207 transitions. [2025-03-16 15:12:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1873 [2025-03-16 15:12:29,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:29,508 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 9, 9, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:29,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:12:29,508 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:29,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:29,509 INFO L85 PathProgramCache]: Analyzing trace with hash -443318875, now seen corresponding path program 1 times [2025-03-16 15:12:29,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:29,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830140229] [2025-03-16 15:12:29,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:29,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:29,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1872 statements into 1 equivalence classes. [2025-03-16 15:12:29,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1872 of 1872 statements. [2025-03-16 15:12:29,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:29,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6422 backedges. 1646 proven. 0 refuted. 0 times theorem prover too weak. 4776 trivial. 0 not checked. [2025-03-16 15:12:31,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:31,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830140229] [2025-03-16 15:12:31,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830140229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:31,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:31,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:12:31,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663463641] [2025-03-16 15:12:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:31,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:31,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:31,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:31,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:31,505 INFO L87 Difference]: Start difference. First operand 17769 states and 18207 transitions. Second operand has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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 15:12:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:32,209 INFO L93 Difference]: Finished difference Result 36532 states and 37431 transitions. [2025-03-16 15:12:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:12:32,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 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 1872 [2025-03-16 15:12:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:32,268 INFO L225 Difference]: With dead ends: 36532 [2025-03-16 15:12:32,268 INFO L226 Difference]: Without dead ends: 19414 [2025-03-16 15:12:32,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 15:12:32,274 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 138 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:32,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 31 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19414 states. [2025-03-16 15:12:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19414 to 16782. [2025-03-16 15:12:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16782 states, 16781 states have (on average 1.0234193433049281) internal successors, (17174), 16781 states have internal predecessors, (17174), 0 states have call successors, (0), 0 states 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 15:12:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16782 states to 16782 states and 17174 transitions. [2025-03-16 15:12:32,383 INFO L78 Accepts]: Start accepts. Automaton has 16782 states and 17174 transitions. Word has length 1872 [2025-03-16 15:12:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:32,384 INFO L471 AbstractCegarLoop]: Abstraction has 16782 states and 17174 transitions. [2025-03-16 15:12:32,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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 15:12:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 16782 states and 17174 transitions. [2025-03-16 15:12:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1912 [2025-03-16 15:12:32,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:32,406 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 9, 9, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2025-03-16 15:12:32,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:12:32,406 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:32,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1625058594, now seen corresponding path program 1 times [2025-03-16 15:12:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:32,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209411884] [2025-03-16 15:12:32,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:32,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:32,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1911 statements into 1 equivalence classes. [2025-03-16 15:12:32,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1911 of 1911 statements. [2025-03-16 15:12:32,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:32,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6603 backedges. 3458 proven. 0 refuted. 0 times theorem prover too weak. 3145 trivial. 0 not checked. [2025-03-16 15:12:34,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:34,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209411884] [2025-03-16 15:12:34,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209411884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:34,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:34,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:34,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576539476] [2025-03-16 15:12:34,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:34,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:34,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:34,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:34,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:34,115 INFO L87 Difference]: Start difference. First operand 16782 states and 17174 transitions. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states 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 15:12:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:34,745 INFO L93 Difference]: Finished difference Result 35866 states and 36695 transitions. [2025-03-16 15:12:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:34,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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 1911 [2025-03-16 15:12:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:34,764 INFO L225 Difference]: With dead ends: 35866 [2025-03-16 15:12:34,764 INFO L226 Difference]: Without dead ends: 19743 [2025-03-16 15:12:34,776 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 15:12:34,778 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 208 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:34,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 45 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19743 states. [2025-03-16 15:12:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19743 to 17769. [2025-03-16 15:12:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17769 states, 17768 states have (on average 1.0228500675371455) internal successors, (18174), 17768 states have internal predecessors, (18174), 0 states have call successors, (0), 0 states 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 15:12:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17769 states to 17769 states and 18174 transitions. [2025-03-16 15:12:34,944 INFO L78 Accepts]: Start accepts. Automaton has 17769 states and 18174 transitions. Word has length 1911 [2025-03-16 15:12:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:34,944 INFO L471 AbstractCegarLoop]: Abstraction has 17769 states and 18174 transitions. [2025-03-16 15:12:34,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states 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 15:12:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 17769 states and 18174 transitions. [2025-03-16 15:12:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1953 [2025-03-16 15:12:34,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:34,967 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:34,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:12:34,967 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:34,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:34,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1679972264, now seen corresponding path program 1 times [2025-03-16 15:12:34,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:34,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304000617] [2025-03-16 15:12:34,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:34,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:35,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1952 statements into 1 equivalence classes. [2025-03-16 15:12:35,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1952 of 1952 statements. [2025-03-16 15:12:35,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:35,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7277 backedges. 5380 proven. 41 refuted. 0 times theorem prover too weak. 1856 trivial. 0 not checked. [2025-03-16 15:12:37,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:37,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304000617] [2025-03-16 15:12:37,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304000617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:37,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878845651] [2025-03-16 15:12:37,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:37,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:37,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:37,410 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 15:12:37,411 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 15:12:37,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1952 statements into 1 equivalence classes. [2025-03-16 15:12:37,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1952 of 1952 statements. [2025-03-16 15:12:37,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:37,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:37,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 2259 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:12:37,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7277 backedges. 4038 proven. 0 refuted. 0 times theorem prover too weak. 3239 trivial. 0 not checked. [2025-03-16 15:12:38,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:12:38,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878845651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:38,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:12:38,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:12:38,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929822348] [2025-03-16 15:12:38,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:38,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:38,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:38,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:38,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:12:38,190 INFO L87 Difference]: Start difference. First operand 17769 states and 18174 transitions. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states 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 15:12:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:38,745 INFO L93 Difference]: Finished difference Result 35208 states and 36018 transitions. [2025-03-16 15:12:38,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:38,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 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 1952 [2025-03-16 15:12:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:38,758 INFO L225 Difference]: With dead ends: 35208 [2025-03-16 15:12:38,758 INFO L226 Difference]: Without dead ends: 17769 [2025-03-16 15:12:38,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1956 GetRequests, 1952 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 15:12:38,766 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 120 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:38,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 425 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17769 states. [2025-03-16 15:12:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17769 to 17769. [2025-03-16 15:12:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17769 states, 17768 states have (on average 1.0219495722647456) internal successors, (18158), 17768 states have internal predecessors, (18158), 0 states have call successors, (0), 0 states 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 15:12:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17769 states to 17769 states and 18158 transitions. [2025-03-16 15:12:38,884 INFO L78 Accepts]: Start accepts. Automaton has 17769 states and 18158 transitions. Word has length 1952 [2025-03-16 15:12:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:38,885 INFO L471 AbstractCegarLoop]: Abstraction has 17769 states and 18158 transitions. [2025-03-16 15:12:38,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states 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 15:12:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 17769 states and 18158 transitions. [2025-03-16 15:12:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1974 [2025-03-16 15:12:38,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:38,906 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:38,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:12:39,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:39,107 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:39,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:39,108 INFO L85 PathProgramCache]: Analyzing trace with hash 931706301, now seen corresponding path program 1 times [2025-03-16 15:12:39,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:39,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573462138] [2025-03-16 15:12:39,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:39,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:39,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1973 statements into 1 equivalence classes. [2025-03-16 15:12:39,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1973 of 1973 statements. [2025-03-16 15:12:39,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:39,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 5037 proven. 153 refuted. 0 times theorem prover too weak. 1912 trivial. 0 not checked. [2025-03-16 15:12:40,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:40,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573462138] [2025-03-16 15:12:40,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573462138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:40,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894601620] [2025-03-16 15:12:40,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:40,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:40,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:40,982 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 15:12:40,983 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 15:12:41,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1973 statements into 1 equivalence classes. [2025-03-16 15:12:41,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1973 of 1973 statements. [2025-03-16 15:12:41,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:41,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:41,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 2274 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:12:41,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 4241 proven. 0 refuted. 0 times theorem prover too weak. 2861 trivial. 0 not checked. [2025-03-16 15:12:41,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:12:41,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894601620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:41,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:12:41,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:12:41,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701478043] [2025-03-16 15:12:41,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:41,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:41,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:41,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:41,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:41,483 INFO L87 Difference]: Start difference. First operand 17769 states and 18158 transitions. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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 15:12:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:42,094 INFO L93 Difference]: Finished difference Result 37182 states and 38039 transitions. [2025-03-16 15:12:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:42,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 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 1973 [2025-03-16 15:12:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:42,112 INFO L225 Difference]: With dead ends: 37182 [2025-03-16 15:12:42,112 INFO L226 Difference]: Without dead ends: 20072 [2025-03-16 15:12:42,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1978 GetRequests, 1973 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:42,124 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 221 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:42,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 424 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20072 states. [2025-03-16 15:12:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20072 to 19743. [2025-03-16 15:12:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19743 states, 19742 states have (on average 1.0214770539965556) internal successors, (20166), 19742 states have internal predecessors, (20166), 0 states have call successors, (0), 0 states 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 15:12:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19743 states to 19743 states and 20166 transitions. [2025-03-16 15:12:42,338 INFO L78 Accepts]: Start accepts. Automaton has 19743 states and 20166 transitions. Word has length 1973 [2025-03-16 15:12:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:42,339 INFO L471 AbstractCegarLoop]: Abstraction has 19743 states and 20166 transitions. [2025-03-16 15:12:42,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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 15:12:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 19743 states and 20166 transitions. [2025-03-16 15:12:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2005 [2025-03-16 15:12:42,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:42,383 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:12:42,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:12:42,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 15:12:42,584 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:42,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:42,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1872713535, now seen corresponding path program 1 times [2025-03-16 15:12:42,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:42,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916789077] [2025-03-16 15:12:42,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:42,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:42,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2004 statements into 1 equivalence classes. [2025-03-16 15:12:42,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2004 of 2004 statements. [2025-03-16 15:12:42,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:42,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 5535 proven. 91 refuted. 0 times theorem prover too weak. 1803 trivial. 0 not checked. [2025-03-16 15:12:44,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:44,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916789077] [2025-03-16 15:12:44,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916789077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:44,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334253542] [2025-03-16 15:12:44,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:44,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:44,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:44,488 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 15:12:44,489 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 15:12:44,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2004 statements into 1 equivalence classes. [2025-03-16 15:12:44,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2004 of 2004 statements. [2025-03-16 15:12:44,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:44,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:44,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 2308 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:12:44,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 4579 proven. 67 refuted. 0 times theorem prover too weak. 2783 trivial. 0 not checked. [2025-03-16 15:12:53,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:12:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 3571 proven. 0 refuted. 0 times theorem prover too weak. 3858 trivial. 0 not checked. [2025-03-16 15:12:56,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334253542] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:56,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:12:56,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-03-16 15:12:56,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250427317] [2025-03-16 15:12:56,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:56,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:56,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:56,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:56,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:12:56,777 INFO L87 Difference]: Start difference. First operand 19743 states and 20166 transitions. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states 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 15:12:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:57,433 INFO L93 Difference]: Finished difference Result 39156 states and 39989 transitions. [2025-03-16 15:12:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:57,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 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 2004 [2025-03-16 15:12:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:57,450 INFO L225 Difference]: With dead ends: 39156 [2025-03-16 15:12:57,450 INFO L226 Difference]: Without dead ends: 20072 [2025-03-16 15:12:57,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4012 GetRequests, 4005 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:12:57,460 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 268 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:57,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 34 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20072 states. [2025-03-16 15:12:57,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20072 to 19085. [2025-03-16 15:12:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19085 states, 19084 states have (on average 1.0169251729197233) internal successors, (19407), 19084 states have internal predecessors, (19407), 0 states have call successors, (0), 0 states 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 15:12:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19085 states to 19085 states and 19407 transitions. [2025-03-16 15:12:57,596 INFO L78 Accepts]: Start accepts. Automaton has 19085 states and 19407 transitions. Word has length 2004 [2025-03-16 15:12:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:57,596 INFO L471 AbstractCegarLoop]: Abstraction has 19085 states and 19407 transitions. [2025-03-16 15:12:57,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states 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 15:12:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 19085 states and 19407 transitions. [2025-03-16 15:12:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2055 [2025-03-16 15:12:57,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:57,619 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:57,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 15:12:57,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:57,820 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:57,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:57,820 INFO L85 PathProgramCache]: Analyzing trace with hash 10811159, now seen corresponding path program 1 times [2025-03-16 15:12:57,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:57,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757314997] [2025-03-16 15:12:57,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:57,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2054 statements into 1 equivalence classes. [2025-03-16 15:12:57,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2054 of 2054 statements. [2025-03-16 15:12:57,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:57,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7793 backedges. 4304 proven. 6 refuted. 0 times theorem prover too weak. 3483 trivial. 0 not checked. [2025-03-16 15:13:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757314997] [2025-03-16 15:13:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757314997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775802889] [2025-03-16 15:13:00,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:00,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:00,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:00,537 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 15:13:00,541 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 15:13:00,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2054 statements into 1 equivalence classes. [2025-03-16 15:13:00,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2054 of 2054 statements. [2025-03-16 15:13:00,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:00,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:00,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 2360 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:13:00,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7793 backedges. 4332 proven. 250 refuted. 0 times theorem prover too weak. 3211 trivial. 0 not checked. [2025-03-16 15:13:01,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:13:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7793 backedges. 3401 proven. 0 refuted. 0 times theorem prover too weak. 4392 trivial. 0 not checked. [2025-03-16 15:13:02,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775802889] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:02,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:13:02,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-16 15:13:02,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122235954] [2025-03-16 15:13:02,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:02,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:02,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:02,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:02,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:13:02,548 INFO L87 Difference]: Start difference. First operand 19085 states and 19407 transitions. Second operand has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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 15:13:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:03,145 INFO L93 Difference]: Finished difference Result 37840 states and 38482 transitions. [2025-03-16 15:13:03,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:03,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 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 2054 [2025-03-16 15:13:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:03,160 INFO L225 Difference]: With dead ends: 37840 [2025-03-16 15:13:03,160 INFO L226 Difference]: Without dead ends: 19085 [2025-03-16 15:13:03,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4114 GetRequests, 4109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:13:03,169 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:03,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 15 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:03,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19085 states. [2025-03-16 15:13:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19085 to 17769. [2025-03-16 15:13:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17769 states, 17768 states have (on average 1.015364700585322) internal successors, (18041), 17768 states have internal predecessors, (18041), 0 states have call successors, (0), 0 states 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 15:13:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17769 states to 17769 states and 18041 transitions. [2025-03-16 15:13:03,291 INFO L78 Accepts]: Start accepts. Automaton has 17769 states and 18041 transitions. Word has length 2054 [2025-03-16 15:13:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:03,291 INFO L471 AbstractCegarLoop]: Abstraction has 17769 states and 18041 transitions. [2025-03-16 15:13:03,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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 15:13:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 17769 states and 18041 transitions. [2025-03-16 15:13:03,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2122 [2025-03-16 15:13:03,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:03,315 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:03,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 15:13:03,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:03,516 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:03,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1746133463, now seen corresponding path program 1 times [2025-03-16 15:13:03,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:03,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564441448] [2025-03-16 15:13:03,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:03,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:03,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2121 statements into 1 equivalence classes. [2025-03-16 15:13:03,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2121 of 2121 statements. [2025-03-16 15:13:03,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:03,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8555 backedges. 4906 proven. 8 refuted. 0 times theorem prover too weak. 3641 trivial. 0 not checked. [2025-03-16 15:13:06,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:06,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564441448] [2025-03-16 15:13:06,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564441448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:06,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309425393] [2025-03-16 15:13:06,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:06,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:06,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:06,097 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 15:13:06,098 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 15:13:06,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2121 statements into 1 equivalence classes. [2025-03-16 15:13:06,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2121 of 2121 statements. [2025-03-16 15:13:06,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:06,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:06,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 2447 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:13:06,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8555 backedges. 4908 proven. 0 refuted. 0 times theorem prover too weak. 3647 trivial. 0 not checked. [2025-03-16 15:13:07,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:07,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309425393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:07,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:07,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 15:13:07,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597880829] [2025-03-16 15:13:07,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:07,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:07,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:07,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:07,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:13:07,076 INFO L87 Difference]: Start difference. First operand 17769 states and 18041 transitions. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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 15:13:07,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:07,715 INFO L93 Difference]: Finished difference Result 36195 states and 36763 transitions. [2025-03-16 15:13:07,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:07,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 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 2121 [2025-03-16 15:13:07,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:07,732 INFO L225 Difference]: With dead ends: 36195 [2025-03-16 15:13:07,732 INFO L226 Difference]: Without dead ends: 18756 [2025-03-16 15:13:07,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2128 GetRequests, 2125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:13:07,742 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 51 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:07,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 85 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18756 states. [2025-03-16 15:13:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18756 to 18427. [2025-03-16 15:13:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18427 states, 18426 states have (on average 1.0155215456420277) internal successors, (18712), 18426 states have internal predecessors, (18712), 0 states have call successors, (0), 0 states 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 15:13:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18427 states to 18427 states and 18712 transitions. [2025-03-16 15:13:07,874 INFO L78 Accepts]: Start accepts. Automaton has 18427 states and 18712 transitions. Word has length 2121 [2025-03-16 15:13:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:07,875 INFO L471 AbstractCegarLoop]: Abstraction has 18427 states and 18712 transitions. [2025-03-16 15:13:07,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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 15:13:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 18427 states and 18712 transitions. [2025-03-16 15:13:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2285 [2025-03-16 15:13:07,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:07,901 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:07,909 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 15:13:08,101 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,SelfDestructingSolverStorable26 [2025-03-16 15:13:08,101 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:08,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:08,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1404698375, now seen corresponding path program 1 times [2025-03-16 15:13:08,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:08,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376798741] [2025-03-16 15:13:08,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:08,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:08,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2284 statements into 1 equivalence classes. [2025-03-16 15:13:08,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2284 of 2284 statements. [2025-03-16 15:13:08,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:08,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat