./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label13.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/Problem17_label13.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 84be5ebe7d0e17b7dfbf14426aab6d066d24416ef8e3b409c38a918132f4bf30 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:16:58,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:16:58,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:16:58,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:16:58,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:16:58,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:16:58,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:16:58,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:16:58,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:16:58,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:16:58,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:16:58,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:16:58,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:16:58,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:16:58,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:16:58,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:16:58,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:16:58,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:16:58,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:16:58,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:16:58,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:16:58,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:16:58,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:16:58,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:16:58,354 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:16:58,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:16:58,354 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:16:58,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:16:58,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:16:58,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:16:58,355 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 -> 84be5ebe7d0e17b7dfbf14426aab6d066d24416ef8e3b409c38a918132f4bf30 [2025-03-16 15:16:58,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:16:58,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:16:58,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:16:58,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:16:58,584 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:16:58,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label13.c [2025-03-16 15:16:59,667 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4d8bcb2/50a39777292542c184af64699a8ef787/FLAGc90f9f088 [2025-03-16 15:17:00,120 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:17:00,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label13.c [2025-03-16 15:17:00,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4d8bcb2/50a39777292542c184af64699a8ef787/FLAGc90f9f088 [2025-03-16 15:17:00,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4d8bcb2/50a39777292542c184af64699a8ef787 [2025-03-16 15:17:00,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:17:00,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:17:00,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:17:00,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:17:00,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:17:00,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:17:00" (1/1) ... [2025-03-16 15:17:00,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca982f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:00, skipping insertion in model container [2025-03-16 15:17:00,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:17:00" (1/1) ... [2025-03-16 15:17:00,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:17:00,453 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/Problem17_label13.c[4647,4660] [2025-03-16 15:17:00,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:17:00,827 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:17:00,846 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/Problem17_label13.c[4647,4660] [2025-03-16 15:17:01,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:17:01,051 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:17:01,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:01 WrapperNode [2025-03-16 15:17:01,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:17:01,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:17:01,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:17:01,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:17:01,057 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:17:01" (1/1) ... [2025-03-16 15:17:01,086 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:17:01" (1/1) ... [2025-03-16 15:17:01,287 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-16 15:17:01,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:17:01,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:17:01,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:17:01,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:17:01,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:01" (1/1) ... [2025-03-16 15:17:01,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:01" (1/1) ... [2025-03-16 15:17:01,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:01" (1/1) ... [2025-03-16 15:17:01,454 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:17:01,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:01" (1/1) ... [2025-03-16 15:17:01,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:01" (1/1) ... [2025-03-16 15:17:01,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:01" (1/1) ... [2025-03-16 15:17:01,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:01" (1/1) ... [2025-03-16 15:17:01,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:01" (1/1) ... [2025-03-16 15:17:01,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:01" (1/1) ... [2025-03-16 15:17:01,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:17:01,601 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:17:01,602 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:17:01,602 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:17:01,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:01" (1/1) ... [2025-03-16 15:17:01,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:17:01,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:01,667 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:17:01,680 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:17:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:17:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:17:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:17:01,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:17:01,805 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:17:01,806 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:17:04,144 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-16 15:17:04,259 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-16 15:17:04,260 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:17:04,280 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:17:04,280 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:17:04,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:17:04 BoogieIcfgContainer [2025-03-16 15:17:04,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:17:04,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:17:04,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:17:04,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:17:04,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:17:00" (1/3) ... [2025-03-16 15:17:04,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6225bfec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:17:04, skipping insertion in model container [2025-03-16 15:17:04,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:01" (2/3) ... [2025-03-16 15:17:04,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6225bfec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:17:04, skipping insertion in model container [2025-03-16 15:17:04,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:17:04" (3/3) ... [2025-03-16 15:17:04,289 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label13.c [2025-03-16 15:17:04,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:17:04,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label13.c that has 1 procedures, 529 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:17:04,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:17:04,364 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;@173526cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:17:04,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:17:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have 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:17:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 15:17:04,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:04,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:04,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:04,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2005446042, now seen corresponding path program 1 times [2025-03-16 15:17:04,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:04,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612671176] [2025-03-16 15:17:04,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:04,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:04,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 15:17:04,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 15:17:04,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:04,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:04,494 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:17:04,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:04,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612671176] [2025-03-16 15:17:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612671176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:04,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:04,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:17:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84241358] [2025-03-16 15:17:04,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:04,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:17:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:04,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:17:04,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:17:04,517 INFO L87 Difference]: Start difference. First operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:04,574 INFO L93 Difference]: Finished difference Result 1057 states and 1999 transitions. [2025-03-16 15:17:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:17:04,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-16 15:17:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:04,586 INFO L225 Difference]: With dead ends: 1057 [2025-03-16 15:17:04,587 INFO L226 Difference]: Without dead ends: 526 [2025-03-16 15:17:04,591 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:17:04,595 INFO L435 NwaCegarLoop]: 938 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, 938 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:17:04,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:17:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-16 15:17:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-16 15:17:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have 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:17:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2025-03-16 15:17:04,650 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 29 [2025-03-16 15:17:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:04,651 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2025-03-16 15:17:04,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2025-03-16 15:17:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 15:17:04,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:04,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:04,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:17:04,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:04,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1238067011, now seen corresponding path program 1 times [2025-03-16 15:17:04,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:04,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524172586] [2025-03-16 15:17:04,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:04,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 15:17:04,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 15:17:04,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:04,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:04,802 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:17:04,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:04,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524172586] [2025-03-16 15:17:04,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524172586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:04,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:04,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:17:04,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697815233] [2025-03-16 15:17:04,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:04,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:04,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:04,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:04,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:04,805 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:06,690 INFO L93 Difference]: Finished difference Result 1499 states and 2693 transitions. [2025-03-16 15:17:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:06,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-16 15:17:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:06,694 INFO L225 Difference]: With dead ends: 1499 [2025-03-16 15:17:06,694 INFO L226 Difference]: Without dead ends: 974 [2025-03-16 15:17:06,695 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:17:06,695 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 444 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:06,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 497 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:17:06,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-16 15:17:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 971. [2025-03-16 15:17:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5082474226804123) internal successors, (1463), 970 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have 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:17:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1463 transitions. [2025-03-16 15:17:06,727 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1463 transitions. Word has length 29 [2025-03-16 15:17:06,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:06,727 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1463 transitions. [2025-03-16 15:17:06,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:06,727 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1463 transitions. [2025-03-16 15:17:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 15:17:06,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:06,729 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:06,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:17:06,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:06,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1417515357, now seen corresponding path program 1 times [2025-03-16 15:17:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232080705] [2025-03-16 15:17:06,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:06,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 15:17:06,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 15:17:06,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:06,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:17:06,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:06,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232080705] [2025-03-16 15:17:06,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232080705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:06,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:06,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:06,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034707343] [2025-03-16 15:17:06,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:06,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:06,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:06,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:06,985 INFO L87 Difference]: Start difference. First operand 971 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have 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:17:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:08,614 INFO L93 Difference]: Finished difference Result 2813 states and 4241 transitions. [2025-03-16 15:17:08,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:08,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-16 15:17:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:08,621 INFO L225 Difference]: With dead ends: 2813 [2025-03-16 15:17:08,621 INFO L226 Difference]: Without dead ends: 1843 [2025-03-16 15:17:08,622 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:17:08,622 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 461 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:08,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 919 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:17:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-16 15:17:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1841. [2025-03-16 15:17:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3603260869565217) internal successors, (2503), 1840 states have internal predecessors, (2503), 0 states have call successors, (0), 0 states have 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:17:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2503 transitions. [2025-03-16 15:17:08,652 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2503 transitions. Word has length 99 [2025-03-16 15:17:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:08,652 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2503 transitions. [2025-03-16 15:17:08,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have 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:17:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2503 transitions. [2025-03-16 15:17:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 15:17:08,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:08,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:08,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:17:08,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:08,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1444939672, now seen corresponding path program 1 times [2025-03-16 15:17:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:08,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251589997] [2025-03-16 15:17:08,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:08,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 15:17:08,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 15:17:08,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:08,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:17:08,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:08,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251589997] [2025-03-16 15:17:08,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251589997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:08,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:08,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:17:08,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041437398] [2025-03-16 15:17:08,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:08,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:08,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:08,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:08,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:08,827 INFO L87 Difference]: Start difference. First operand 1841 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have 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:17:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:10,242 INFO L93 Difference]: Finished difference Result 5394 states and 7325 transitions. [2025-03-16 15:17:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:10,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-16 15:17:10,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:10,250 INFO L225 Difference]: With dead ends: 5394 [2025-03-16 15:17:10,250 INFO L226 Difference]: Without dead ends: 2700 [2025-03-16 15:17:10,253 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:17:10,254 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:10,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:17:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2025-03-16 15:17:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2025-03-16 15:17:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2699 states have (on average 1.1919229344201556) internal successors, (3217), 2699 states have internal predecessors, (3217), 0 states have call successors, (0), 0 states have 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:17:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3217 transitions. [2025-03-16 15:17:10,288 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3217 transitions. Word has length 121 [2025-03-16 15:17:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:10,289 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 3217 transitions. [2025-03-16 15:17:10,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have 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:17:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3217 transitions. [2025-03-16 15:17:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 15:17:10,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:10,291 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:10,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:17:10,291 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:10,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:10,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1378293342, now seen corresponding path program 1 times [2025-03-16 15:17:10,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:10,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214097763] [2025-03-16 15:17:10,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:10,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:10,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 15:17:10,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 15:17:10,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:10,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:17:10,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:10,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214097763] [2025-03-16 15:17:10,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214097763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:10,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:10,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:10,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684028102] [2025-03-16 15:17:10,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:10,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:10,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:10,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:10,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:10,559 INFO L87 Difference]: Start difference. First operand 2700 states and 3217 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have 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:17:11,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:11,877 INFO L93 Difference]: Finished difference Result 7107 states and 8597 transitions. [2025-03-16 15:17:11,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:11,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2025-03-16 15:17:11,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:11,888 INFO L225 Difference]: With dead ends: 7107 [2025-03-16 15:17:11,888 INFO L226 Difference]: Without dead ends: 4408 [2025-03-16 15:17:11,890 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:17:11,891 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:11,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:17:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2025-03-16 15:17:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4408. [2025-03-16 15:17:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4408 states, 4407 states have (on average 1.1706376219650556) internal successors, (5159), 4407 states have internal predecessors, (5159), 0 states have call successors, (0), 0 states have 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:17:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5159 transitions. [2025-03-16 15:17:11,944 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5159 transitions. Word has length 181 [2025-03-16 15:17:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:11,945 INFO L471 AbstractCegarLoop]: Abstraction has 4408 states and 5159 transitions. [2025-03-16 15:17:11,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have 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:17:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5159 transitions. [2025-03-16 15:17:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 15:17:11,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:11,948 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:11,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:17:11,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:11,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash 261805501, now seen corresponding path program 1 times [2025-03-16 15:17:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468049300] [2025-03-16 15:17:11,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:11,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 15:17:12,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 15:17:12,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:12,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 15:17:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:12,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468049300] [2025-03-16 15:17:12,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468049300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:12,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:12,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:12,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284415247] [2025-03-16 15:17:12,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:12,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:12,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:12,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:12,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:12,102 INFO L87 Difference]: Start difference. First operand 4408 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:17:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:13,339 INFO L93 Difference]: Finished difference Result 10935 states and 12969 transitions. [2025-03-16 15:17:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:13,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 183 [2025-03-16 15:17:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:13,354 INFO L225 Difference]: With dead ends: 10935 [2025-03-16 15:17:13,354 INFO L226 Difference]: Without dead ends: 6527 [2025-03-16 15:17:13,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:13,358 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 420 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:13,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:17:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6527 states. [2025-03-16 15:17:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6527 to 4381. [2025-03-16 15:17:13,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 4380 states have (on average 1.1684931506849314) internal successors, (5118), 4380 states have internal predecessors, (5118), 0 states have call successors, (0), 0 states have 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:17:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 5118 transitions. [2025-03-16 15:17:13,410 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 5118 transitions. Word has length 183 [2025-03-16 15:17:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:13,410 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 5118 transitions. [2025-03-16 15:17:13,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:17:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 5118 transitions. [2025-03-16 15:17:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-16 15:17:13,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:13,412 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:17:13,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:17:13,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:13,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:13,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1099116539, now seen corresponding path program 1 times [2025-03-16 15:17:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:13,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081001877] [2025-03-16 15:17:13,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:13,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:13,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-16 15:17:13,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-16 15:17:13,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:13,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:17:13,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:13,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081001877] [2025-03-16 15:17:13,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081001877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:13,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:13,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:13,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868850212] [2025-03-16 15:17:13,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:13,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:13,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:13,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:13,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:13,575 INFO L87 Difference]: Start difference. First operand 4381 states and 5118 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have 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:17:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:14,913 INFO L93 Difference]: Finished difference Result 10044 states and 11705 transitions. [2025-03-16 15:17:14,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:14,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 249 [2025-03-16 15:17:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:14,924 INFO L225 Difference]: With dead ends: 10044 [2025-03-16 15:17:14,925 INFO L226 Difference]: Without dead ends: 5664 [2025-03-16 15:17:14,928 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:17:14,929 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 406 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:14,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 892 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:17:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2025-03-16 15:17:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5233. [2025-03-16 15:17:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 5232 states have (on average 1.1588302752293578) internal successors, (6063), 5232 states have internal predecessors, (6063), 0 states have call successors, (0), 0 states have 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:17:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 6063 transitions. [2025-03-16 15:17:14,988 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 6063 transitions. Word has length 249 [2025-03-16 15:17:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:14,988 INFO L471 AbstractCegarLoop]: Abstraction has 5233 states and 6063 transitions. [2025-03-16 15:17:14,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have 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:17:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 6063 transitions. [2025-03-16 15:17:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-16 15:17:14,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:14,992 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:14,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:17:14,992 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:14,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:14,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2011136542, now seen corresponding path program 1 times [2025-03-16 15:17:14,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:14,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255230962] [2025-03-16 15:17:14,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:14,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:15,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 15:17:15,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 15:17:15,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:15,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 15:17:15,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:15,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255230962] [2025-03-16 15:17:15,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255230962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940923403] [2025-03-16 15:17:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:15,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:15,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:15,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:15,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:15,202 INFO L87 Difference]: Start difference. First operand 5233 states and 6063 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have 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:17:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:16,562 INFO L93 Difference]: Finished difference Result 13048 states and 15221 transitions. [2025-03-16 15:17:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:16,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-03-16 15:17:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:16,576 INFO L225 Difference]: With dead ends: 13048 [2025-03-16 15:17:16,576 INFO L226 Difference]: Without dead ends: 6941 [2025-03-16 15:17:16,580 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:17:16,581 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 493 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:16,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 628 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:17:16,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6941 states. [2025-03-16 15:17:16,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6941 to 6511. [2025-03-16 15:17:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6511 states, 6510 states have (on average 1.152073732718894) internal successors, (7500), 6510 states have internal predecessors, (7500), 0 states have call successors, (0), 0 states have 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:17:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6511 states to 6511 states and 7500 transitions. [2025-03-16 15:17:16,653 INFO L78 Accepts]: Start accepts. Automaton has 6511 states and 7500 transitions. Word has length 261 [2025-03-16 15:17:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:16,655 INFO L471 AbstractCegarLoop]: Abstraction has 6511 states and 7500 transitions. [2025-03-16 15:17:16,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have 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:17:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 6511 states and 7500 transitions. [2025-03-16 15:17:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-16 15:17:16,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:16,660 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:16,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:17:16,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:16,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:16,662 INFO L85 PathProgramCache]: Analyzing trace with hash -195848241, now seen corresponding path program 1 times [2025-03-16 15:17:16,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:16,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533440784] [2025-03-16 15:17:16,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:16,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:16,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-16 15:17:16,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-16 15:17:16,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:16,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:17:16,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:16,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533440784] [2025-03-16 15:17:16,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533440784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:16,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:16,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:16,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044095252] [2025-03-16 15:17:16,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:16,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:16,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:16,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:16,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:16,885 INFO L87 Difference]: Start difference. First operand 6511 states and 7500 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:18,103 INFO L93 Difference]: Finished difference Result 16009 states and 18476 transitions. [2025-03-16 15:17:18,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:18,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 284 [2025-03-16 15:17:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:18,120 INFO L225 Difference]: With dead ends: 16009 [2025-03-16 15:17:18,120 INFO L226 Difference]: Without dead ends: 9499 [2025-03-16 15:17:18,126 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:17:18,127 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 415 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:18,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 336 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:17:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2025-03-16 15:17:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 8643. [2025-03-16 15:17:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8643 states, 8642 states have (on average 1.1545938440175885) internal successors, (9978), 8642 states have internal predecessors, (9978), 0 states have call successors, (0), 0 states have 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:17:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8643 states to 8643 states and 9978 transitions. [2025-03-16 15:17:18,201 INFO L78 Accepts]: Start accepts. Automaton has 8643 states and 9978 transitions. Word has length 284 [2025-03-16 15:17:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:18,201 INFO L471 AbstractCegarLoop]: Abstraction has 8643 states and 9978 transitions. [2025-03-16 15:17:18,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 8643 states and 9978 transitions. [2025-03-16 15:17:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-16 15:17:18,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:18,205 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:17:18,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:17:18,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:18,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:18,208 INFO L85 PathProgramCache]: Analyzing trace with hash 373271554, now seen corresponding path program 1 times [2025-03-16 15:17:18,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:18,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737672024] [2025-03-16 15:17:18,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:18,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-16 15:17:18,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-16 15:17:18,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:18,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:17:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:18,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737672024] [2025-03-16 15:17:18,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737672024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:18,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:18,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:17:18,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106808635] [2025-03-16 15:17:18,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:18,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:18,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:18,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:18,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:17:18,474 INFO L87 Difference]: Start difference. First operand 8643 states and 9978 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:20,775 INFO L93 Difference]: Finished difference Result 30560 states and 35506 transitions. [2025-03-16 15:17:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:20,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2025-03-16 15:17:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:20,808 INFO L225 Difference]: With dead ends: 30560 [2025-03-16 15:17:20,808 INFO L226 Difference]: Without dead ends: 21063 [2025-03-16 15:17:20,814 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:17:20,815 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 878 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2649 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 2649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:20,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 269 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 2649 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:17:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21063 states. [2025-03-16 15:17:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21063 to 21021. [2025-03-16 15:17:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21021 states, 21020 states have (on average 1.1422930542340628) internal successors, (24011), 21020 states have internal predecessors, (24011), 0 states have call successors, (0), 0 states have 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:17:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21021 states to 21021 states and 24011 transitions. [2025-03-16 15:17:20,990 INFO L78 Accepts]: Start accepts. Automaton has 21021 states and 24011 transitions. Word has length 289 [2025-03-16 15:17:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:20,991 INFO L471 AbstractCegarLoop]: Abstraction has 21021 states and 24011 transitions. [2025-03-16 15:17:20,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 21021 states and 24011 transitions. [2025-03-16 15:17:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 15:17:20,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:20,995 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:20,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:17:20,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:20,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash 211466532, now seen corresponding path program 1 times [2025-03-16 15:17:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874921557] [2025-03-16 15:17:20,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:21,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 15:17:21,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 15:17:21,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:21,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 247 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:17:21,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874921557] [2025-03-16 15:17:21,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874921557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:21,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862555995] [2025-03-16 15:17:21,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:21,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:21,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:21,485 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:17:21,487 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:17:21,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 15:17:21,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 15:17:21,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:21,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:21,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:17:21,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 242 proven. 82 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 15:17:22,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:17:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 242 proven. 82 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 15:17:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862555995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:17:22,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:17:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-16 15:17:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731391468] [2025-03-16 15:17:22,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:17:22,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:17:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:22,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:17:22,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:17:22,883 INFO L87 Difference]: Start difference. First operand 21021 states and 24011 transitions. Second operand has 9 states, 9 states have (on average 89.77777777777777) internal successors, (808), 9 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have 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:17:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:33,061 INFO L93 Difference]: Finished difference Result 92411 states and 105635 transitions. [2025-03-16 15:17:33,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 15:17:33,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 89.77777777777777) internal successors, (808), 9 states have internal predecessors, (808), 0 states have call successors, (0), 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 324 [2025-03-16 15:17:33,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:33,156 INFO L225 Difference]: With dead ends: 92411 [2025-03-16 15:17:33,156 INFO L226 Difference]: Without dead ends: 67984 [2025-03-16 15:17:33,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 656 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2025-03-16 15:17:33,175 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 8158 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 13180 mSolverCounterSat, 2722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8158 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 15902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2722 IncrementalHoareTripleChecker+Valid, 13180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:33,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8158 Valid, 524 Invalid, 15902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2722 Valid, 13180 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2025-03-16 15:17:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67984 states. [2025-03-16 15:17:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67984 to 53385. [2025-03-16 15:17:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53385 states, 53384 states have (on average 1.1439382586542783) internal successors, (61068), 53384 states have internal predecessors, (61068), 0 states have call successors, (0), 0 states have 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:17:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53385 states to 53385 states and 61068 transitions. [2025-03-16 15:17:33,844 INFO L78 Accepts]: Start accepts. Automaton has 53385 states and 61068 transitions. Word has length 324 [2025-03-16 15:17:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:33,845 INFO L471 AbstractCegarLoop]: Abstraction has 53385 states and 61068 transitions. [2025-03-16 15:17:33,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.77777777777777) internal successors, (808), 9 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have 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:17:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 53385 states and 61068 transitions. [2025-03-16 15:17:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-16 15:17:33,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:33,852 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:17:33,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:17:34,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 15:17:34,057 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:34,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash -125993048, now seen corresponding path program 1 times [2025-03-16 15:17:34,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:34,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306953543] [2025-03-16 15:17:34,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:34,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:34,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-16 15:17:34,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-16 15:17:34,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:34,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-16 15:17:34,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:34,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306953543] [2025-03-16 15:17:34,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306953543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:34,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:34,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:34,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157345835] [2025-03-16 15:17:34,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:34,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:34,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:34,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:34,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:34,324 INFO L87 Difference]: Start difference. First operand 53385 states and 61068 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:35,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:35,894 INFO L93 Difference]: Finished difference Result 119090 states and 136468 transitions. [2025-03-16 15:17:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:35,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 392 [2025-03-16 15:17:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:35,976 INFO L225 Difference]: With dead ends: 119090 [2025-03-16 15:17:35,976 INFO L226 Difference]: Without dead ends: 65706 [2025-03-16 15:17:36,016 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:17:36,018 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 319 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:36,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 785 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:17:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65706 states. [2025-03-16 15:17:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65706 to 63581. [2025-03-16 15:17:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63581 states, 63580 states have (on average 1.1144856873230575) internal successors, (70859), 63580 states have internal predecessors, (70859), 0 states have call successors, (0), 0 states have 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:17:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63581 states to 63581 states and 70859 transitions. [2025-03-16 15:17:36,810 INFO L78 Accepts]: Start accepts. Automaton has 63581 states and 70859 transitions. Word has length 392 [2025-03-16 15:17:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:36,810 INFO L471 AbstractCegarLoop]: Abstraction has 63581 states and 70859 transitions. [2025-03-16 15:17:36,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 63581 states and 70859 transitions. [2025-03-16 15:17:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-16 15:17:36,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:36,908 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:17:36,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:17:36,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:36,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:36,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1277480489, now seen corresponding path program 1 times [2025-03-16 15:17:36,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:36,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364239926] [2025-03-16 15:17:36,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:36,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-16 15:17:36,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-16 15:17:36,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:36,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 597 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 15:17:37,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:37,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364239926] [2025-03-16 15:17:37,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364239926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:37,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:37,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:17:37,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012381327] [2025-03-16 15:17:37,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:37,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:37,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:37,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:37,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:17:37,221 INFO L87 Difference]: Start difference. First operand 63581 states and 70859 transitions. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have 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:17:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:39,021 INFO L93 Difference]: Finished difference Result 127161 states and 141717 transitions. [2025-03-16 15:17:39,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 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 406 [2025-03-16 15:17:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:39,085 INFO L225 Difference]: With dead ends: 127161 [2025-03-16 15:17:39,085 INFO L226 Difference]: Without dead ends: 63581 [2025-03-16 15:17:39,121 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:17:39,122 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 820 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:39,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 742 Invalid, 2297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:17:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63581 states. [2025-03-16 15:17:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63581 to 63156. [2025-03-16 15:17:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63156 states, 63155 states have (on average 1.1141635658301006) internal successors, (70365), 63155 states have internal predecessors, (70365), 0 states have call successors, (0), 0 states have 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:17:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63156 states to 63156 states and 70365 transitions. [2025-03-16 15:17:39,996 INFO L78 Accepts]: Start accepts. Automaton has 63156 states and 70365 transitions. Word has length 406 [2025-03-16 15:17:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:39,996 INFO L471 AbstractCegarLoop]: Abstraction has 63156 states and 70365 transitions. [2025-03-16 15:17:39,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have 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:17:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 63156 states and 70365 transitions. [2025-03-16 15:17:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-16 15:17:40,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:40,006 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:17:40,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:17:40,006 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:40,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:40,007 INFO L85 PathProgramCache]: Analyzing trace with hash -818601278, now seen corresponding path program 1 times [2025-03-16 15:17:40,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:40,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322489831] [2025-03-16 15:17:40,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:40,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:40,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-16 15:17:40,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-16 15:17:40,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:40,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 348 proven. 181 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-16 15:17:40,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:40,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322489831] [2025-03-16 15:17:40,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322489831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:40,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400748444] [2025-03-16 15:17:40,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:40,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:40,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:40,707 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:17:40,709 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:17:40,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-16 15:17:40,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-16 15:17:40,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:40,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:40,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:17:40,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-16 15:17:41,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:17:41,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400748444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:41,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:17:41,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-16 15:17:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146344998] [2025-03-16 15:17:41,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:41,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:41,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:41,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:17:41,135 INFO L87 Difference]: Start difference. First operand 63156 states and 70365 transitions. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:17:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:43,614 INFO L93 Difference]: Finished difference Result 163780 states and 182719 transitions. [2025-03-16 15:17:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:43,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 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 454 [2025-03-16 15:17:43,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:43,720 INFO L225 Difference]: With dead ends: 163780 [2025-03-16 15:17:43,720 INFO L226 Difference]: Without dead ends: 100625 [2025-03-16 15:17:43,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:17:43,739 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 760 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:43,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 177 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 2345 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:17:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100625 states. [2025-03-16 15:17:44,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100625 to 98493. [2025-03-16 15:17:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98493 states, 98492 states have (on average 1.111207001583885) internal successors, (109445), 98492 states have internal predecessors, (109445), 0 states have call successors, (0), 0 states have 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:17:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98493 states to 98493 states and 109445 transitions. [2025-03-16 15:17:44,644 INFO L78 Accepts]: Start accepts. Automaton has 98493 states and 109445 transitions. Word has length 454 [2025-03-16 15:17:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:44,645 INFO L471 AbstractCegarLoop]: Abstraction has 98493 states and 109445 transitions. [2025-03-16 15:17:44,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:17:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 98493 states and 109445 transitions. [2025-03-16 15:17:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-16 15:17:44,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:44,654 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:17:44,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:17:44,854 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,SelfDestructingSolverStorable13 [2025-03-16 15:17:44,854 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:44,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:44,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1225376488, now seen corresponding path program 1 times [2025-03-16 15:17:44,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:44,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754648181] [2025-03-16 15:17:44,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:44,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:44,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-16 15:17:44,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-16 15:17:44,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:44,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-16 15:17:45,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:45,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754648181] [2025-03-16 15:17:45,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754648181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:45,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:45,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:45,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759250817] [2025-03-16 15:17:45,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:45,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:45,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:45,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:45,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:45,003 INFO L87 Difference]: Start difference. First operand 98493 states and 109445 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have 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:17:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:46,798 INFO L93 Difference]: Finished difference Result 202508 states and 224563 transitions. [2025-03-16 15:17:46,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:46,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 485 [2025-03-16 15:17:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:46,902 INFO L225 Difference]: With dead ends: 202508 [2025-03-16 15:17:46,902 INFO L226 Difference]: Without dead ends: 100173 [2025-03-16 15:17:46,944 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:17:46,944 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 490 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:46,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 640 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:17:46,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100173 states. [2025-03-16 15:17:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100173 to 90361. [2025-03-16 15:17:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90361 states, 90360 states have (on average 1.1029327135900842) internal successors, (99661), 90360 states have internal predecessors, (99661), 0 states have call successors, (0), 0 states have 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:17:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90361 states to 90361 states and 99661 transitions. [2025-03-16 15:17:47,739 INFO L78 Accepts]: Start accepts. Automaton has 90361 states and 99661 transitions. Word has length 485 [2025-03-16 15:17:47,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:47,739 INFO L471 AbstractCegarLoop]: Abstraction has 90361 states and 99661 transitions. [2025-03-16 15:17:47,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have 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:17:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 90361 states and 99661 transitions. [2025-03-16 15:17:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-16 15:17:47,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:47,747 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:17:47,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:17:47,748 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:47,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2080328739, now seen corresponding path program 1 times [2025-03-16 15:17:47,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:47,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007896061] [2025-03-16 15:17:47,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:47,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:47,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-16 15:17:47,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-16 15:17:47,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:47,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 424 proven. 175 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 15:17:48,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:48,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007896061] [2025-03-16 15:17:48,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007896061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:48,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687804953] [2025-03-16 15:17:48,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:48,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:48,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:48,917 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:17:48,918 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:17:48,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-16 15:17:49,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-16 15:17:49,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:49,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:49,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:17:49,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 15:17:49,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:17:49,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687804953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:49,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:17:49,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-16 15:17:49,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10222697] [2025-03-16 15:17:49,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:49,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:49,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:49,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:49,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:17:49,312 INFO L87 Difference]: Start difference. First operand 90361 states and 99661 transitions. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have 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:17:50,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:50,996 INFO L93 Difference]: Finished difference Result 184132 states and 202951 transitions. [2025-03-16 15:17:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:50,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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 487 [2025-03-16 15:17:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:51,099 INFO L225 Difference]: With dead ends: 184132 [2025-03-16 15:17:51,100 INFO L226 Difference]: Without dead ends: 93772 [2025-03-16 15:17:51,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:17:51,157 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 870 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:51,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 290 Invalid, 2324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:17:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93772 states. [2025-03-16 15:17:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93772 to 92921. [2025-03-16 15:17:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92921 states, 92920 states have (on average 1.1012806715454153) internal successors, (102331), 92920 states have internal predecessors, (102331), 0 states have call successors, (0), 0 states have 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:17:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92921 states to 92921 states and 102331 transitions. [2025-03-16 15:17:52,010 INFO L78 Accepts]: Start accepts. Automaton has 92921 states and 102331 transitions. Word has length 487 [2025-03-16 15:17:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:52,010 INFO L471 AbstractCegarLoop]: Abstraction has 92921 states and 102331 transitions. [2025-03-16 15:17:52,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have 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:17:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 92921 states and 102331 transitions. [2025-03-16 15:17:52,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-03-16 15:17:52,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:52,019 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:52,025 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:17:52,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:52,220 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:52,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1330303314, now seen corresponding path program 1 times [2025-03-16 15:17:52,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:52,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798677570] [2025-03-16 15:17:52,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:52,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:52,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-16 15:17:52,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-16 15:17:52,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:52,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-16 15:17:52,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:52,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798677570] [2025-03-16 15:17:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798677570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:52,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:17:52,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294916402] [2025-03-16 15:17:52,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:52,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:52,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:52,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:52,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:52,380 INFO L87 Difference]: Start difference. First operand 92921 states and 102331 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:53,311 INFO L93 Difference]: Finished difference Result 179868 states and 197832 transitions. [2025-03-16 15:17:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:53,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 512 [2025-03-16 15:17:53,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:53,397 INFO L225 Difference]: With dead ends: 179868 [2025-03-16 15:17:53,397 INFO L226 Difference]: Without dead ends: 86944 [2025-03-16 15:17:53,446 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:17:53,446 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 610 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:53,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 93 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:17:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86944 states. [2025-03-16 15:17:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86944 to 86078. [2025-03-16 15:17:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86078 states, 86077 states have (on average 1.09723851900043) internal successors, (94447), 86077 states have internal predecessors, (94447), 0 states have call successors, (0), 0 states have 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:17:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86078 states to 86078 states and 94447 transitions. [2025-03-16 15:17:54,296 INFO L78 Accepts]: Start accepts. Automaton has 86078 states and 94447 transitions. Word has length 512 [2025-03-16 15:17:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:54,296 INFO L471 AbstractCegarLoop]: Abstraction has 86078 states and 94447 transitions. [2025-03-16 15:17:54,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 86078 states and 94447 transitions. [2025-03-16 15:17:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-16 15:17:54,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:54,306 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:54,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:17:54,306 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:54,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1059916551, now seen corresponding path program 1 times [2025-03-16 15:17:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:54,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053017366] [2025-03-16 15:17:54,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:54,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-16 15:17:54,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-16 15:17:54,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:54,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 171 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:17:54,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053017366] [2025-03-16 15:17:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053017366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842631384] [2025-03-16 15:17:54,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:54,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:54,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:54,821 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:17:54,822 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:17:54,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-16 15:17:55,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-16 15:17:55,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:55,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:55,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:17:55,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 171 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:17:55,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:17:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:17:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842631384] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:55,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:17:55,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2025-03-16 15:17:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078182786] [2025-03-16 15:17:55,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:55,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:17:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:55,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:17:55,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:17:55,805 INFO L87 Difference]: Start difference. First operand 86078 states and 94447 transitions. Second operand has 5 states, 5 states have (on average 103.2) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:58,519 INFO L93 Difference]: Finished difference Result 191330 states and 210072 transitions. [2025-03-16 15:17:58,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:17:58,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 103.2) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 516 [2025-03-16 15:17:58,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:58,652 INFO L225 Difference]: With dead ends: 191330 [2025-03-16 15:17:58,652 INFO L226 Difference]: Without dead ends: 104828 [2025-03-16 15:17:58,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1028 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:17:58,714 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1023 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 3013 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 3665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 3013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:58,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 147 Invalid, 3665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 3013 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:17:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104828 states. [2025-03-16 15:17:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104828 to 99291. [2025-03-16 15:17:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99291 states, 99290 states have (on average 1.0790210494511028) internal successors, (107136), 99290 states have internal predecessors, (107136), 0 states have call successors, (0), 0 states have 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:18:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99291 states to 99291 states and 107136 transitions. [2025-03-16 15:18:00,092 INFO L78 Accepts]: Start accepts. Automaton has 99291 states and 107136 transitions. Word has length 516 [2025-03-16 15:18:00,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:00,092 INFO L471 AbstractCegarLoop]: Abstraction has 99291 states and 107136 transitions. [2025-03-16 15:18:00,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.2) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 99291 states and 107136 transitions. [2025-03-16 15:18:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-16 15:18:00,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:00,101 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:00,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 15:18:00,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 15:18:00,302 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:00,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1925116189, now seen corresponding path program 1 times [2025-03-16 15:18:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221364622] [2025-03-16 15:18:00,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:00,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-16 15:18:00,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-16 15:18:00,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:00,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-03-16 15:18:00,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:00,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221364622] [2025-03-16 15:18:00,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221364622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:00,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:00,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:00,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390559162] [2025-03-16 15:18:00,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:00,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:00,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:00,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:00,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:00,438 INFO L87 Difference]: Start difference. First operand 99291 states and 107136 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:18:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:01,949 INFO L93 Difference]: Finished difference Result 193008 states and 208156 transitions. [2025-03-16 15:18:01,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:01,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 543 [2025-03-16 15:18:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:02,060 INFO L225 Difference]: With dead ends: 193008 [2025-03-16 15:18:02,061 INFO L226 Difference]: Without dead ends: 93718 [2025-03-16 15:18:02,107 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:18:02,107 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 484 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:02,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 624 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:18:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93718 states. [2025-03-16 15:18:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93718 to 93288. [2025-03-16 15:18:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93288 states, 93287 states have (on average 1.0720036017880306) internal successors, (100004), 93287 states have internal predecessors, (100004), 0 states have call successors, (0), 0 states have 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:18:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93288 states to 93288 states and 100004 transitions. [2025-03-16 15:18:03,101 INFO L78 Accepts]: Start accepts. Automaton has 93288 states and 100004 transitions. Word has length 543 [2025-03-16 15:18:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:03,102 INFO L471 AbstractCegarLoop]: Abstraction has 93288 states and 100004 transitions. [2025-03-16 15:18:03,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:18:03,102 INFO L276 IsEmpty]: Start isEmpty. Operand 93288 states and 100004 transitions. [2025-03-16 15:18:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-16 15:18:03,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:03,115 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-16 15:18:03,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:18:03,115 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:03,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:03,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1442180659, now seen corresponding path program 1 times [2025-03-16 15:18:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:03,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870420675] [2025-03-16 15:18:03,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:03,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-16 15:18:03,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-16 15:18:03,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:03,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 787 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-16 15:18:03,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:03,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870420675] [2025-03-16 15:18:03,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870420675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:03,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:03,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523668368] [2025-03-16 15:18:03,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:03,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:03,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:03,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:03,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:03,582 INFO L87 Difference]: Start difference. First operand 93288 states and 100004 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:18:04,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:04,937 INFO L93 Difference]: Finished difference Result 201884 states and 217136 transitions. [2025-03-16 15:18:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:04,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 576 [2025-03-16 15:18:04,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:05,069 INFO L225 Difference]: With dead ends: 201884 [2025-03-16 15:18:05,069 INFO L226 Difference]: Without dead ends: 108597 [2025-03-16 15:18:05,123 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:18:05,124 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 290 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:05,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 265 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:18:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108597 states. [2025-03-16 15:18:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108597 to 104760. [2025-03-16 15:18:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104760 states, 104759 states have (on average 1.0637749501236171) internal successors, (111440), 104759 states have internal predecessors, (111440), 0 states have call successors, (0), 0 states have 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:18:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104760 states to 104760 states and 111440 transitions. [2025-03-16 15:18:06,628 INFO L78 Accepts]: Start accepts. Automaton has 104760 states and 111440 transitions. Word has length 576 [2025-03-16 15:18:06,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:06,628 INFO L471 AbstractCegarLoop]: Abstraction has 104760 states and 111440 transitions. [2025-03-16 15:18:06,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:18:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 104760 states and 111440 transitions. [2025-03-16 15:18:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2025-03-16 15:18:06,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:06,638 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:18:06,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:18:06,639 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:06,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:06,639 INFO L85 PathProgramCache]: Analyzing trace with hash -181834100, now seen corresponding path program 1 times [2025-03-16 15:18:06,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:06,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229115596] [2025-03-16 15:18:06,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:06,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:06,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 583 statements into 1 equivalence classes. [2025-03-16 15:18:06,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 583 of 583 statements. [2025-03-16 15:18:06,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:06,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 784 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-16 15:18:06,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:06,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229115596] [2025-03-16 15:18:06,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229115596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:06,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:06,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:06,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926531371] [2025-03-16 15:18:06,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:06,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:06,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:06,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:06,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:06,885 INFO L87 Difference]: Start difference. First operand 104760 states and 111440 transitions. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have 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:18:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:08,490 INFO L93 Difference]: Finished difference Result 219736 states and 233719 transitions. [2025-03-16 15:18:08,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:08,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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 583 [2025-03-16 15:18:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:08,628 INFO L225 Difference]: With dead ends: 219736 [2025-03-16 15:18:08,628 INFO L226 Difference]: Without dead ends: 114552 [2025-03-16 15:18:08,701 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:18:08,701 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 320 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:08,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 660 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:18:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114552 states. [2025-03-16 15:18:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114552 to 107306. [2025-03-16 15:18:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107306 states, 107305 states have (on average 1.0594380504170355) internal successors, (113683), 107305 states have internal predecessors, (113683), 0 states have call successors, (0), 0 states have 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:18:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107306 states to 107306 states and 113683 transitions. [2025-03-16 15:18:10,011 INFO L78 Accepts]: Start accepts. Automaton has 107306 states and 113683 transitions. Word has length 583 [2025-03-16 15:18:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:10,011 INFO L471 AbstractCegarLoop]: Abstraction has 107306 states and 113683 transitions. [2025-03-16 15:18:10,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have 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:18:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 107306 states and 113683 transitions. [2025-03-16 15:18:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-03-16 15:18:10,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:10,019 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:18:10,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:18:10,019 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:10,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:10,020 INFO L85 PathProgramCache]: Analyzing trace with hash 702833561, now seen corresponding path program 1 times [2025-03-16 15:18:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:10,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718842285] [2025-03-16 15:18:10,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:10,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:10,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-16 15:18:10,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-16 15:18:10,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:10,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 997 backedges. 458 proven. 465 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-16 15:18:11,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:11,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718842285] [2025-03-16 15:18:11,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718842285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:18:11,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108566689] [2025-03-16 15:18:11,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:11,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:18:11,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:18:11,078 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:18:11,078 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:18:11,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-16 15:18:11,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-16 15:18:11,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:11,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:11,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:18:11,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:18:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 997 backedges. 969 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 15:18:11,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:18:11,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108566689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:11,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:18:11,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-16 15:18:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618000877] [2025-03-16 15:18:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:11,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:18:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:11,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:18:11,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:18:11,887 INFO L87 Difference]: Start difference. First operand 107306 states and 113683 transitions. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:18:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:14,187 INFO L93 Difference]: Finished difference Result 231218 states and 244650 transitions. [2025-03-16 15:18:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:18:14,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 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 584 [2025-03-16 15:18:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:14,318 INFO L225 Difference]: With dead ends: 231218 [2025-03-16 15:18:14,318 INFO L226 Difference]: Without dead ends: 123913 [2025-03-16 15:18:14,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:18:14,377 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1465 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 3002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:14,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 211 Invalid, 3002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:18:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123913 states. [2025-03-16 15:18:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123913 to 112423. [2025-03-16 15:18:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112423 states, 112422 states have (on average 1.0588941666221914) internal successors, (119043), 112422 states have internal predecessors, (119043), 0 states have call successors, (0), 0 states have 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:18:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112423 states to 112423 states and 119043 transitions. [2025-03-16 15:18:15,965 INFO L78 Accepts]: Start accepts. Automaton has 112423 states and 119043 transitions. Word has length 584 [2025-03-16 15:18:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:15,965 INFO L471 AbstractCegarLoop]: Abstraction has 112423 states and 119043 transitions. [2025-03-16 15:18:15,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:18:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 112423 states and 119043 transitions. [2025-03-16 15:18:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-16 15:18:15,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:15,973 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:15,979 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:18:16,173 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,SelfDestructingSolverStorable21 [2025-03-16 15:18:16,174 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:16,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:16,174 INFO L85 PathProgramCache]: Analyzing trace with hash -165270800, now seen corresponding path program 1 times [2025-03-16 15:18:16,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:16,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966318968] [2025-03-16 15:18:16,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:16,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-16 15:18:16,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-16 15:18:16,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:16,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:18:16,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:16,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966318968] [2025-03-16 15:18:16,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966318968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:16,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:16,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:16,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101788594] [2025-03-16 15:18:16,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:16,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:16,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:16,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:16,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:16,456 INFO L87 Difference]: Start difference. First operand 112423 states and 119043 transitions. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have 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:18:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:17,872 INFO L93 Difference]: Finished difference Result 233374 states and 247274 transitions. [2025-03-16 15:18:17,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:17,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 591 [2025-03-16 15:18:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:18,000 INFO L225 Difference]: With dead ends: 233374 [2025-03-16 15:18:18,001 INFO L226 Difference]: Without dead ends: 120527 [2025-03-16 15:18:18,059 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:18:18,060 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 428 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:18,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 172 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:18:18,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120527 states. [2025-03-16 15:18:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120527 to 115835. [2025-03-16 15:18:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115835 states, 115834 states have (on average 1.0581090180775938) internal successors, (122565), 115834 states have internal predecessors, (122565), 0 states have call successors, (0), 0 states have 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:18:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115835 states to 115835 states and 122565 transitions. [2025-03-16 15:18:19,478 INFO L78 Accepts]: Start accepts. Automaton has 115835 states and 122565 transitions. Word has length 591 [2025-03-16 15:18:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:19,479 INFO L471 AbstractCegarLoop]: Abstraction has 115835 states and 122565 transitions. [2025-03-16 15:18:19,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have 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:18:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 115835 states and 122565 transitions. [2025-03-16 15:18:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2025-03-16 15:18:19,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:19,491 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:19,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:18:19,491 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:19,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1606231234, now seen corresponding path program 1 times [2025-03-16 15:18:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:19,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318772696] [2025-03-16 15:18:19,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:19,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:19,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-03-16 15:18:19,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-03-16 15:18:19,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:19,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 838 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:18:20,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:20,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318772696] [2025-03-16 15:18:20,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318772696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:20,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:20,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 15:18:20,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33495093] [2025-03-16 15:18:20,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:20,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:18:20,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:20,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:18:20,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:18:20,371 INFO L87 Difference]: Start difference. First operand 115835 states and 122565 transitions. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)