./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.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 71881827e42af7e93d8d7789f21cf70c42c80b5b7128690239afcf02ba9daf37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:10:57,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:10:57,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:10:57,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:10:57,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:10:57,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:10:57,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:10:57,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:10:57,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:10:57,333 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:10:57,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:10:57,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:10:57,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:10:57,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:10:57,334 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:10:57,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:10:57,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:10:57,335 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:10:57,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:10:57,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:10:57,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:10:57,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:10:57,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:10:57,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:10:57,335 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:10:57,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:10:57,335 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:10:57,335 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:10:57,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:10:57,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:10:57,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:10:57,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:10:57,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:10:57,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:10:57,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:10:57,336 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:10:57,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:10:57,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:10:57,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:10:57,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:10:57,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:10:57,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:10:57,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:10:57,337 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 -> 71881827e42af7e93d8d7789f21cf70c42c80b5b7128690239afcf02ba9daf37 [2025-03-16 19:10:57,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:10:57,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:10:57,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:10:57,570 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:10:57,570 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:10:57,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c [2025-03-16 19:10:58,698 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fade4e1b/60d26e8ad6044bdab0503caae7e04420/FLAG9a61772fc [2025-03-16 19:10:58,955 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:10:58,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c [2025-03-16 19:10:58,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fade4e1b/60d26e8ad6044bdab0503caae7e04420/FLAG9a61772fc [2025-03-16 19:10:59,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fade4e1b/60d26e8ad6044bdab0503caae7e04420 [2025-03-16 19:10:59,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:10:59,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:10:59,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:10:59,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:10:59,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:10:59,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c453938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59, skipping insertion in model container [2025-03-16 19:10:59,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:10:59,430 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/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c[15103,15116] [2025-03-16 19:10:59,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:10:59,440 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:10:59,483 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/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c[15103,15116] [2025-03-16 19:10:59,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:10:59,500 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:10:59,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59 WrapperNode [2025-03-16 19:10:59,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:10:59,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:10:59,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:10:59,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:10:59,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,528 INFO L138 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 393 [2025-03-16 19:10:59,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:10:59,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:10:59,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:10:59,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:10:59,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,546 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 19:10:59,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:10:59,557 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:10:59,557 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:10:59,557 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:10:59,557 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (1/1) ... [2025-03-16 19:10:59,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:10:59,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:10:59,579 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 19:10:59,583 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 19:10:59,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:10:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:10:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:10:59,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:10:59,676 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:10:59,678 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:11:00,002 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-16 19:11:00,003 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:11:00,010 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:11:00,011 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:11:00,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:11:00 BoogieIcfgContainer [2025-03-16 19:11:00,012 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:11:00,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:11:00,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:11:00,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:11:00,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:10:59" (1/3) ... [2025-03-16 19:11:00,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e78009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:11:00, skipping insertion in model container [2025-03-16 19:11:00,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:10:59" (2/3) ... [2025-03-16 19:11:00,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e78009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:11:00, skipping insertion in model container [2025-03-16 19:11:00,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:11:00" (3/3) ... [2025-03-16 19:11:00,019 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c [2025-03-16 19:11:00,030 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:11:00,033 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c that has 1 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:11:00,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:11:00,086 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;@637cde87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:11:00,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:11:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 93 states have (on average 1.7956989247311828) internal successors, (167), 94 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:00,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 19:11:00,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:00,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:00,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:00,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:00,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1002060135, now seen corresponding path program 1 times [2025-03-16 19:11:00,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:00,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548674469] [2025-03-16 19:11:00,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:00,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:00,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 19:11:00,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 19:11:00,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:00,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:00,326 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 19:11:00,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:00,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548674469] [2025-03-16 19:11:00,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548674469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:00,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:00,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:11:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182813050] [2025-03-16 19:11:00,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:00,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:11:00,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:00,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:11:00,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:11:00,350 INFO L87 Difference]: Start difference. First operand has 95 states, 93 states have (on average 1.7956989247311828) internal successors, (167), 94 states have internal predecessors, (167), 0 states have call successors, (0), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:00,362 INFO L93 Difference]: Finished difference Result 145 states and 249 transitions. [2025-03-16 19:11:00,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:11:00,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-16 19:11:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:00,368 INFO L225 Difference]: With dead ends: 145 [2025-03-16 19:11:00,368 INFO L226 Difference]: Without dead ends: 93 [2025-03-16 19:11:00,370 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 19:11:00,372 INFO L435 NwaCegarLoop]: 163 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, 163 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 19:11:00,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-16 19:11:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-16 19:11:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.7717391304347827) internal successors, (163), 92 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 163 transitions. [2025-03-16 19:11:00,403 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 163 transitions. Word has length 22 [2025-03-16 19:11:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:00,404 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 163 transitions. [2025-03-16 19:11:00,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 163 transitions. [2025-03-16 19:11:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 19:11:00,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:00,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:00,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:11:00,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:00,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1846532006, now seen corresponding path program 1 times [2025-03-16 19:11:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:00,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101989819] [2025-03-16 19:11:00,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:00,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 19:11:00,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 19:11:00,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:00,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:00,727 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 19:11:00,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:00,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101989819] [2025-03-16 19:11:00,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101989819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:00,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:00,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:11:00,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556626330] [2025-03-16 19:11:00,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:00,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:11:00,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:00,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:11:00,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:11:00,729 INFO L87 Difference]: Start difference. First operand 93 states and 163 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:00,807 INFO L93 Difference]: Finished difference Result 145 states and 245 transitions. [2025-03-16 19:11:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:11:00,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-16 19:11:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:00,810 INFO L225 Difference]: With dead ends: 145 [2025-03-16 19:11:00,810 INFO L226 Difference]: Without dead ends: 93 [2025-03-16 19:11:00,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:11:00,811 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:00,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-16 19:11:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-16 19:11:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2025-03-16 19:11:00,817 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 22 [2025-03-16 19:11:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:00,817 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2025-03-16 19:11:00,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2025-03-16 19:11:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:11:00,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:00,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:00,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:11:00,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:00,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:00,822 INFO L85 PathProgramCache]: Analyzing trace with hash -846777481, now seen corresponding path program 1 times [2025-03-16 19:11:00,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:00,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244955112] [2025-03-16 19:11:00,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:00,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:00,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:11:00,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:11:00,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:00,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:01,059 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 19:11:01,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:01,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244955112] [2025-03-16 19:11:01,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244955112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:01,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901129523] [2025-03-16 19:11:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:01,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:01,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:01,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:01,062 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:01,360 INFO L93 Difference]: Finished difference Result 681 states and 1071 transitions. [2025-03-16 19:11:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:11:01,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-16 19:11:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:01,364 INFO L225 Difference]: With dead ends: 681 [2025-03-16 19:11:01,367 INFO L226 Difference]: Without dead ends: 632 [2025-03-16 19:11:01,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:11:01,368 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1077 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:01,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 2058 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:01,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-16 19:11:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 140. [2025-03-16 19:11:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4316546762589928) internal successors, (199), 139 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 199 transitions. [2025-03-16 19:11:01,391 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 199 transitions. Word has length 61 [2025-03-16 19:11:01,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:01,391 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 199 transitions. [2025-03-16 19:11:01,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:01,391 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 199 transitions. [2025-03-16 19:11:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:11:01,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:01,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:01,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:11:01,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:01,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1968200804, now seen corresponding path program 1 times [2025-03-16 19:11:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:01,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761309383] [2025-03-16 19:11:01,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:01,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:11:01,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:11:01,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:01,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:01,505 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 19:11:01,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:01,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761309383] [2025-03-16 19:11:01,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761309383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:01,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:01,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:01,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599619250] [2025-03-16 19:11:01,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:01,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:01,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:01,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:01,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:01,509 INFO L87 Difference]: Start difference. First operand 140 states and 199 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:01,528 INFO L93 Difference]: Finished difference Result 321 states and 490 transitions. [2025-03-16 19:11:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:01,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-16 19:11:01,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:01,529 INFO L225 Difference]: With dead ends: 321 [2025-03-16 19:11:01,529 INFO L226 Difference]: Without dead ends: 225 [2025-03-16 19:11:01,530 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 19:11:01,530 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 52 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:01,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 191 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-16 19:11:01,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 221. [2025-03-16 19:11:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 327 transitions. [2025-03-16 19:11:01,537 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 327 transitions. Word has length 63 [2025-03-16 19:11:01,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:01,538 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 327 transitions. [2025-03-16 19:11:01,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:01,538 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 327 transitions. [2025-03-16 19:11:01,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:11:01,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:01,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:01,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:11:01,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:01,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:01,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1967158119, now seen corresponding path program 1 times [2025-03-16 19:11:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:01,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368583746] [2025-03-16 19:11:01,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:01,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:01,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:11:01,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:11:01,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:01,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:01,851 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 19:11:01,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:01,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368583746] [2025-03-16 19:11:01,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368583746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:01,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:01,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:01,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164923263] [2025-03-16 19:11:01,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:01,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:01,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:01,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:01,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:01,852 INFO L87 Difference]: Start difference. First operand 221 states and 327 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:02,054 INFO L93 Difference]: Finished difference Result 400 states and 611 transitions. [2025-03-16 19:11:02,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-16 19:11:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:02,056 INFO L225 Difference]: With dead ends: 400 [2025-03-16 19:11:02,056 INFO L226 Difference]: Without dead ends: 223 [2025-03-16 19:11:02,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:11:02,057 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 315 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:02,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 494 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-16 19:11:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2025-03-16 19:11:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4772727272727273) internal successors, (325), 220 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 325 transitions. [2025-03-16 19:11:02,073 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 325 transitions. Word has length 63 [2025-03-16 19:11:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:02,074 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 325 transitions. [2025-03-16 19:11:02,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2025-03-16 19:11:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:11:02,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:02,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:02,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:11:02,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:02,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash -851374486, now seen corresponding path program 1 times [2025-03-16 19:11:02,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:02,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532172894] [2025-03-16 19:11:02,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:02,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:02,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:11:02,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:11:02,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:02,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:02,272 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 19:11:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:02,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532172894] [2025-03-16 19:11:02,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532172894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:02,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:02,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:11:02,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288594647] [2025-03-16 19:11:02,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:02,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:11:02,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:02,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:11:02,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:11:02,273 INFO L87 Difference]: Start difference. First operand 221 states and 325 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:02,286 INFO L93 Difference]: Finished difference Result 227 states and 332 transitions. [2025-03-16 19:11:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:11:02,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-16 19:11:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:02,288 INFO L225 Difference]: With dead ends: 227 [2025-03-16 19:11:02,288 INFO L226 Difference]: Without dead ends: 225 [2025-03-16 19:11:02,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:11:02,288 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:02,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-16 19:11:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-03-16 19:11:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.4642857142857142) internal successors, (328), 224 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 328 transitions. [2025-03-16 19:11:02,300 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 328 transitions. Word has length 64 [2025-03-16 19:11:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:02,300 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 328 transitions. [2025-03-16 19:11:02,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 328 transitions. [2025-03-16 19:11:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:11:02,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:02,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:02,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:11:02,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:02,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:02,306 INFO L85 PathProgramCache]: Analyzing trace with hash -653402469, now seen corresponding path program 1 times [2025-03-16 19:11:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:02,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377582515] [2025-03-16 19:11:02,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:02,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:02,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:11:02,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:11:02,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:02,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:02,366 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 19:11:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377582515] [2025-03-16 19:11:02,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377582515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:02,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:02,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:02,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830344374] [2025-03-16 19:11:02,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:02,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:02,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:02,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:02,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:02,368 INFO L87 Difference]: Start difference. First operand 225 states and 328 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:02,388 INFO L93 Difference]: Finished difference Result 571 states and 868 transitions. [2025-03-16 19:11:02,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:02,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:11:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:02,391 INFO L225 Difference]: With dead ends: 571 [2025-03-16 19:11:02,392 INFO L226 Difference]: Without dead ends: 390 [2025-03-16 19:11:02,392 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 19:11:02,392 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 67 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:02,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 263 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-16 19:11:02,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2025-03-16 19:11:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.496124031007752) internal successors, (579), 387 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 579 transitions. [2025-03-16 19:11:02,406 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 579 transitions. Word has length 65 [2025-03-16 19:11:02,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:02,406 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 579 transitions. [2025-03-16 19:11:02,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 579 transitions. [2025-03-16 19:11:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:11:02,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:02,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:02,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:11:02,409 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:02,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 189956507, now seen corresponding path program 1 times [2025-03-16 19:11:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:02,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276749282] [2025-03-16 19:11:02,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:02,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:11:02,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:11:02,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:02,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:02,469 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 19:11:02,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:02,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276749282] [2025-03-16 19:11:02,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276749282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:02,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:02,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:02,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676354306] [2025-03-16 19:11:02,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:02,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:02,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:02,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:02,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:02,472 INFO L87 Difference]: Start difference. First operand 388 states and 579 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:02,491 INFO L93 Difference]: Finished difference Result 1044 states and 1593 transitions. [2025-03-16 19:11:02,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:02,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:11:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:02,495 INFO L225 Difference]: With dead ends: 1044 [2025-03-16 19:11:02,495 INFO L226 Difference]: Without dead ends: 700 [2025-03-16 19:11:02,495 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 19:11:02,496 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 65 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:02,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 265 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-16 19:11:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 698. [2025-03-16 19:11:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.5050215208034434) internal successors, (1049), 697 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1049 transitions. [2025-03-16 19:11:02,525 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1049 transitions. Word has length 65 [2025-03-16 19:11:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:02,525 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1049 transitions. [2025-03-16 19:11:02,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1049 transitions. [2025-03-16 19:11:02,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:11:02,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:02,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:02,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:11:02,528 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:02,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:02,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1013179547, now seen corresponding path program 1 times [2025-03-16 19:11:02,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:02,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456724902] [2025-03-16 19:11:02,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:02,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:02,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:11:02,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:11:02,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:02,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:02,582 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 19:11:02,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:02,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456724902] [2025-03-16 19:11:02,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456724902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:02,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:02,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:02,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961421627] [2025-03-16 19:11:02,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:02,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:02,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:02,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:02,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:02,584 INFO L87 Difference]: Start difference. First operand 698 states and 1049 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:02,609 INFO L93 Difference]: Finished difference Result 1942 states and 2947 transitions. [2025-03-16 19:11:02,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:02,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:11:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:02,613 INFO L225 Difference]: With dead ends: 1942 [2025-03-16 19:11:02,613 INFO L226 Difference]: Without dead ends: 1288 [2025-03-16 19:11:02,614 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 19:11:02,615 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 63 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:02,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 267 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-03-16 19:11:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1286. [2025-03-16 19:11:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1285 states have (on average 1.4980544747081712) internal successors, (1925), 1285 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1925 transitions. [2025-03-16 19:11:02,648 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1925 transitions. Word has length 65 [2025-03-16 19:11:02,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:02,648 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1925 transitions. [2025-03-16 19:11:02,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1925 transitions. [2025-03-16 19:11:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:11:02,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:02,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:02,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:11:02,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:02,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:02,650 INFO L85 PathProgramCache]: Analyzing trace with hash 946997147, now seen corresponding path program 1 times [2025-03-16 19:11:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:02,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863702791] [2025-03-16 19:11:02,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:02,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:02,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:11:02,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:11:02,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:02,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:02,708 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 19:11:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:02,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863702791] [2025-03-16 19:11:02,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863702791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:02,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:02,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:02,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636422369] [2025-03-16 19:11:02,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:02,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:02,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:02,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:02,711 INFO L87 Difference]: Start difference. First operand 1286 states and 1925 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:02,745 INFO L93 Difference]: Finished difference Result 3642 states and 5463 transitions. [2025-03-16 19:11:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:02,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:11:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:02,752 INFO L225 Difference]: With dead ends: 3642 [2025-03-16 19:11:02,753 INFO L226 Difference]: Without dead ends: 2400 [2025-03-16 19:11:02,754 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 19:11:02,754 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 61 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:02,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 269 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2025-03-16 19:11:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2398. [2025-03-16 19:11:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2397 states have (on average 1.4806007509386734) internal successors, (3549), 2397 states have internal predecessors, (3549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3549 transitions. [2025-03-16 19:11:02,803 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3549 transitions. Word has length 65 [2025-03-16 19:11:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:02,804 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 3549 transitions. [2025-03-16 19:11:02,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3549 transitions. [2025-03-16 19:11:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:11:02,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:02,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:02,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:11:02,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:02,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:02,805 INFO L85 PathProgramCache]: Analyzing trace with hash 397208219, now seen corresponding path program 1 times [2025-03-16 19:11:02,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:02,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709442084] [2025-03-16 19:11:02,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:02,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:02,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:11:02,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:11:02,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:02,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:02,842 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 19:11:02,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:02,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709442084] [2025-03-16 19:11:02,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709442084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:02,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:02,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:02,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446330740] [2025-03-16 19:11:02,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:02,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:02,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:02,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:02,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:02,844 INFO L87 Difference]: Start difference. First operand 2398 states and 3549 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:02,901 INFO L93 Difference]: Finished difference Result 6850 states and 10111 transitions. [2025-03-16 19:11:02,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:02,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:11:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:02,915 INFO L225 Difference]: With dead ends: 6850 [2025-03-16 19:11:02,915 INFO L226 Difference]: Without dead ends: 4496 [2025-03-16 19:11:02,918 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 19:11:02,918 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 59 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:02,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 271 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2025-03-16 19:11:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4494. [2025-03-16 19:11:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4494 states, 4493 states have (on average 1.4558201647006455) internal successors, (6541), 4493 states have internal predecessors, (6541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4494 states to 4494 states and 6541 transitions. [2025-03-16 19:11:03,021 INFO L78 Accepts]: Start accepts. Automaton has 4494 states and 6541 transitions. Word has length 65 [2025-03-16 19:11:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:03,021 INFO L471 AbstractCegarLoop]: Abstraction has 4494 states and 6541 transitions. [2025-03-16 19:11:03,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4494 states and 6541 transitions. [2025-03-16 19:11:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:11:03,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:03,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:03,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:11:03,022 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:03,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:03,022 INFO L85 PathProgramCache]: Analyzing trace with hash -678115493, now seen corresponding path program 1 times [2025-03-16 19:11:03,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:03,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980181236] [2025-03-16 19:11:03,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:03,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:11:03,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:11:03,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:03,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:03,078 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 19:11:03,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:03,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980181236] [2025-03-16 19:11:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980181236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:03,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:03,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:03,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320750015] [2025-03-16 19:11:03,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:03,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:03,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:03,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:03,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:03,080 INFO L87 Difference]: Start difference. First operand 4494 states and 6541 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:03,160 INFO L93 Difference]: Finished difference Result 9109 states and 13395 transitions. [2025-03-16 19:11:03,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:03,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-16 19:11:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:03,180 INFO L225 Difference]: With dead ends: 9109 [2025-03-16 19:11:03,180 INFO L226 Difference]: Without dead ends: 6610 [2025-03-16 19:11:03,184 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 19:11:03,185 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 66 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:03,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 264 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:03,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6610 states. [2025-03-16 19:11:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6610 to 6608. [2025-03-16 19:11:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6608 states, 6607 states have (on average 1.4504313606780688) internal successors, (9583), 6607 states have internal predecessors, (9583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6608 states to 6608 states and 9583 transitions. [2025-03-16 19:11:03,326 INFO L78 Accepts]: Start accepts. Automaton has 6608 states and 9583 transitions. Word has length 67 [2025-03-16 19:11:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:03,327 INFO L471 AbstractCegarLoop]: Abstraction has 6608 states and 9583 transitions. [2025-03-16 19:11:03,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6608 states and 9583 transitions. [2025-03-16 19:11:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:11:03,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:03,332 INFO L218 NwaCegarLoop]: trace histogram [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 19:11:03,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:11:03,332 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:03,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:03,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1671821835, now seen corresponding path program 1 times [2025-03-16 19:11:03,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:03,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359551068] [2025-03-16 19:11:03,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:03,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:03,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:11:03,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:11:03,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:03,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:11:03,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:03,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359551068] [2025-03-16 19:11:03,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359551068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:03,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:03,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:03,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889803585] [2025-03-16 19:11:03,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:03,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:03,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:03,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:03,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:03,494 INFO L87 Difference]: Start difference. First operand 6608 states and 9583 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:04,075 INFO L93 Difference]: Finished difference Result 47326 states and 68694 transitions. [2025-03-16 19:11:04,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:04,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 85 [2025-03-16 19:11:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:04,156 INFO L225 Difference]: With dead ends: 47326 [2025-03-16 19:11:04,156 INFO L226 Difference]: Without dead ends: 40764 [2025-03-16 19:11:04,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:11:04,173 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 844 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:04,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1149 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:04,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40764 states. [2025-03-16 19:11:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40764 to 13168. [2025-03-16 19:11:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13168 states, 13167 states have (on average 1.4447482342219184) internal successors, (19023), 13167 states have internal predecessors, (19023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13168 states to 13168 states and 19023 transitions. [2025-03-16 19:11:04,646 INFO L78 Accepts]: Start accepts. Automaton has 13168 states and 19023 transitions. Word has length 85 [2025-03-16 19:11:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:04,646 INFO L471 AbstractCegarLoop]: Abstraction has 13168 states and 19023 transitions. [2025-03-16 19:11:04,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 13168 states and 19023 transitions. [2025-03-16 19:11:04,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:11:04,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:04,648 INFO L218 NwaCegarLoop]: trace histogram [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 19:11:04,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:11:04,648 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:04,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:04,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1779786485, now seen corresponding path program 1 times [2025-03-16 19:11:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:04,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858507983] [2025-03-16 19:11:04,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:04,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:11:04,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:11:04,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:04,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:11:04,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:04,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858507983] [2025-03-16 19:11:04,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858507983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:04,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:04,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:04,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550343096] [2025-03-16 19:11:04,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:04,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:04,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:04,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:04,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:04,774 INFO L87 Difference]: Start difference. First operand 13168 states and 19023 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:05,460 INFO L93 Difference]: Finished difference Result 53886 states and 78134 transitions. [2025-03-16 19:11:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:05,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 85 [2025-03-16 19:11:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:05,556 INFO L225 Difference]: With dead ends: 53886 [2025-03-16 19:11:05,556 INFO L226 Difference]: Without dead ends: 47324 [2025-03-16 19:11:05,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:11:05,573 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 868 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:05,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1052 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47324 states. [2025-03-16 19:11:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47324 to 23024. [2025-03-16 19:11:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23024 states, 23023 states have (on average 1.4378230465186987) internal successors, (33103), 23023 states have internal predecessors, (33103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23024 states to 23024 states and 33103 transitions. [2025-03-16 19:11:06,283 INFO L78 Accepts]: Start accepts. Automaton has 23024 states and 33103 transitions. Word has length 85 [2025-03-16 19:11:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:06,283 INFO L471 AbstractCegarLoop]: Abstraction has 23024 states and 33103 transitions. [2025-03-16 19:11:06,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 23024 states and 33103 transitions. [2025-03-16 19:11:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:11:06,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:06,286 INFO L218 NwaCegarLoop]: trace histogram [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 19:11:06,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:11:06,287 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:06,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:06,287 INFO L85 PathProgramCache]: Analyzing trace with hash -956563445, now seen corresponding path program 1 times [2025-03-16 19:11:06,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:06,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537953905] [2025-03-16 19:11:06,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:06,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:11:06,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:11:06,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:06,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:11:06,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:06,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537953905] [2025-03-16 19:11:06,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537953905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:06,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:06,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:06,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193787869] [2025-03-16 19:11:06,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:06,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:06,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:06,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:06,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:06,429 INFO L87 Difference]: Start difference. First operand 23024 states and 33103 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:07,176 INFO L93 Difference]: Finished difference Result 60446 states and 87574 transitions. [2025-03-16 19:11:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:07,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 85 [2025-03-16 19:11:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:07,278 INFO L225 Difference]: With dead ends: 60446 [2025-03-16 19:11:07,278 INFO L226 Difference]: Without dead ends: 53884 [2025-03-16 19:11:07,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:11:07,292 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 908 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:07,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 1015 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53884 states. [2025-03-16 19:11:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53884 to 29584. [2025-03-16 19:11:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29584 states, 29583 states have (on average 1.4380894432613325) internal successors, (42543), 29583 states have internal predecessors, (42543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29584 states to 29584 states and 42543 transitions. [2025-03-16 19:11:08,147 INFO L78 Accepts]: Start accepts. Automaton has 29584 states and 42543 transitions. Word has length 85 [2025-03-16 19:11:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:08,147 INFO L471 AbstractCegarLoop]: Abstraction has 29584 states and 42543 transitions. [2025-03-16 19:11:08,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 29584 states and 42543 transitions. [2025-03-16 19:11:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:11:08,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:08,151 INFO L218 NwaCegarLoop]: trace histogram [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 19:11:08,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:11:08,151 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:08,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1022745845, now seen corresponding path program 1 times [2025-03-16 19:11:08,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:08,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144126267] [2025-03-16 19:11:08,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:08,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:08,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:11:08,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:11:08,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:08,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:11:08,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:08,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144126267] [2025-03-16 19:11:08,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144126267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:08,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:08,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:08,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762225131] [2025-03-16 19:11:08,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:08,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:08,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:08,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:08,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:08,313 INFO L87 Difference]: Start difference. First operand 29584 states and 42543 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:09,261 INFO L93 Difference]: Finished difference Result 67006 states and 97014 transitions. [2025-03-16 19:11:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:09,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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 85 [2025-03-16 19:11:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:09,346 INFO L225 Difference]: With dead ends: 67006 [2025-03-16 19:11:09,346 INFO L226 Difference]: Without dead ends: 60444 [2025-03-16 19:11:09,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:11:09,362 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 957 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:09,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1025 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60444 states. [2025-03-16 19:11:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60444 to 36144. [2025-03-16 19:11:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36144 states, 36143 states have (on average 1.4382591373156628) internal successors, (51983), 36143 states have internal predecessors, (51983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36144 states to 36144 states and 51983 transitions. [2025-03-16 19:11:10,158 INFO L78 Accepts]: Start accepts. Automaton has 36144 states and 51983 transitions. Word has length 85 [2025-03-16 19:11:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:10,159 INFO L471 AbstractCegarLoop]: Abstraction has 36144 states and 51983 transitions. [2025-03-16 19:11:10,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 36144 states and 51983 transitions. [2025-03-16 19:11:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:11:10,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:10,162 INFO L218 NwaCegarLoop]: trace histogram [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 19:11:10,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:11:10,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:10,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1572534773, now seen corresponding path program 1 times [2025-03-16 19:11:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:10,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251149776] [2025-03-16 19:11:10,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:10,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:10,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:11:10,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:11:10,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:10,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 19:11:10,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:10,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251149776] [2025-03-16 19:11:10,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251149776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:10,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:10,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:10,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627270561] [2025-03-16 19:11:10,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:10,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:10,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:10,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:10,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:10,299 INFO L87 Difference]: Start difference. First operand 36144 states and 51983 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:11,205 INFO L93 Difference]: Finished difference Result 73566 states and 106454 transitions. [2025-03-16 19:11:11,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:11,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 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 85 [2025-03-16 19:11:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:11,283 INFO L225 Difference]: With dead ends: 73566 [2025-03-16 19:11:11,283 INFO L226 Difference]: Without dead ends: 67004 [2025-03-16 19:11:11,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:11:11,300 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 860 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:11,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1148 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67004 states. [2025-03-16 19:11:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67004 to 42704. [2025-03-16 19:11:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42704 states, 42703 states have (on average 1.4383766948457954) internal successors, (61423), 42703 states have internal predecessors, (61423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42704 states to 42704 states and 61423 transitions. [2025-03-16 19:11:12,519 INFO L78 Accepts]: Start accepts. Automaton has 42704 states and 61423 transitions. Word has length 85 [2025-03-16 19:11:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:12,519 INFO L471 AbstractCegarLoop]: Abstraction has 42704 states and 61423 transitions. [2025-03-16 19:11:12,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 42704 states and 61423 transitions. [2025-03-16 19:11:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:11:12,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:12,523 INFO L218 NwaCegarLoop]: trace histogram [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 19:11:12,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:11:12,523 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:12,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash 479446731, now seen corresponding path program 1 times [2025-03-16 19:11:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:12,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367407066] [2025-03-16 19:11:12,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:12,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:12,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:11:12,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:11:12,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:12,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:11:12,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:12,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367407066] [2025-03-16 19:11:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367407066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:12,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:12,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:11:12,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369876748] [2025-03-16 19:11:12,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:12,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:11:12,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:12,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:11:12,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:11:12,689 INFO L87 Difference]: Start difference. First operand 42704 states and 61423 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:14,103 INFO L93 Difference]: Finished difference Result 76222 states and 110390 transitions. [2025-03-16 19:11:14,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:11:14,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 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 87 [2025-03-16 19:11:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:14,196 INFO L225 Difference]: With dead ends: 76222 [2025-03-16 19:11:14,196 INFO L226 Difference]: Without dead ends: 71612 [2025-03-16 19:11:14,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:11:14,223 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 838 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:14,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1309 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:11:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71612 states. [2025-03-16 19:11:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71612 to 47312. [2025-03-16 19:11:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47312 states, 47311 states have (on average 1.4403204328803028) internal successors, (68143), 47311 states have internal predecessors, (68143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47312 states to 47312 states and 68143 transitions. [2025-03-16 19:11:15,298 INFO L78 Accepts]: Start accepts. Automaton has 47312 states and 68143 transitions. Word has length 87 [2025-03-16 19:11:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:15,298 INFO L471 AbstractCegarLoop]: Abstraction has 47312 states and 68143 transitions. [2025-03-16 19:11:15,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 47312 states and 68143 transitions. [2025-03-16 19:11:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:11:15,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:15,302 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:15,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:11:15,302 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:15,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash 340196909, now seen corresponding path program 1 times [2025-03-16 19:11:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:15,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412272111] [2025-03-16 19:11:15,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:15,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:15,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:11:15,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:11:15,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:15,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:15,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412272111] [2025-03-16 19:11:15,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412272111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:15,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:15,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:15,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198239167] [2025-03-16 19:11:15,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:15,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:15,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:15,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:15,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:15,382 INFO L87 Difference]: Start difference. First operand 47312 states and 68143 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:15,967 INFO L93 Difference]: Finished difference Result 81897 states and 118567 transitions. [2025-03-16 19:11:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:15,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 19:11:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:16,005 INFO L225 Difference]: With dead ends: 81897 [2025-03-16 19:11:16,006 INFO L226 Difference]: Without dead ends: 34631 [2025-03-16 19:11:16,036 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 19:11:16,037 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 58 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:16,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 280 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34631 states. [2025-03-16 19:11:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34631 to 34629. [2025-03-16 19:11:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34629 states, 34628 states have (on average 1.4435716761002657) internal successors, (49988), 34628 states have internal predecessors, (49988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34629 states to 34629 states and 49988 transitions. [2025-03-16 19:11:16,662 INFO L78 Accepts]: Start accepts. Automaton has 34629 states and 49988 transitions. Word has length 87 [2025-03-16 19:11:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:16,662 INFO L471 AbstractCegarLoop]: Abstraction has 34629 states and 49988 transitions. [2025-03-16 19:11:16,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 34629 states and 49988 transitions. [2025-03-16 19:11:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:11:16,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:16,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:16,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:11:16,664 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:16,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:16,664 INFO L85 PathProgramCache]: Analyzing trace with hash 662358640, now seen corresponding path program 1 times [2025-03-16 19:11:16,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:16,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447281922] [2025-03-16 19:11:16,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:16,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:16,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:11:16,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:11:16,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:16,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:16,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:16,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447281922] [2025-03-16 19:11:16,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447281922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:16,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:16,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:16,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480210942] [2025-03-16 19:11:16,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:16,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:16,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:16,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:16,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:16,736 INFO L87 Difference]: Start difference. First operand 34629 states and 49988 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:17,070 INFO L93 Difference]: Finished difference Result 51913 states and 74950 transitions. [2025-03-16 19:11:17,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:17,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 19:11:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:17,086 INFO L225 Difference]: With dead ends: 51913 [2025-03-16 19:11:17,086 INFO L226 Difference]: Without dead ends: 17351 [2025-03-16 19:11:17,095 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 19:11:17,095 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 53 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:17,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 265 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17351 states. [2025-03-16 19:11:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17351 to 17349. [2025-03-16 19:11:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17349 states, 17348 states have (on average 1.4288678810237492) internal successors, (24788), 17348 states have internal predecessors, (24788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17349 states to 17349 states and 24788 transitions. [2025-03-16 19:11:17,388 INFO L78 Accepts]: Start accepts. Automaton has 17349 states and 24788 transitions. Word has length 88 [2025-03-16 19:11:17,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:17,389 INFO L471 AbstractCegarLoop]: Abstraction has 17349 states and 24788 transitions. [2025-03-16 19:11:17,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 17349 states and 24788 transitions. [2025-03-16 19:11:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:11:17,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:17,390 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:17,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:11:17,391 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:17,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash 890655113, now seen corresponding path program 1 times [2025-03-16 19:11:17,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:17,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535023271] [2025-03-16 19:11:17,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:17,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:11:17,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:11:17,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:17,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:17,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:17,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535023271] [2025-03-16 19:11:17,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535023271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:17,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:17,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:17,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650392618] [2025-03-16 19:11:17,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:17,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:17,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:17,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:17,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:17,451 INFO L87 Difference]: Start difference. First operand 17349 states and 24788 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:17,581 INFO L93 Difference]: Finished difference Result 25993 states and 37150 transitions. [2025-03-16 19:11:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:17,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-16 19:11:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:17,594 INFO L225 Difference]: With dead ends: 25993 [2025-03-16 19:11:17,594 INFO L226 Difference]: Without dead ends: 8711 [2025-03-16 19:11:17,605 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 19:11:17,606 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 50 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:17,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 250 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:17,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8711 states. [2025-03-16 19:11:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8711 to 8709. [2025-03-16 19:11:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8709 states, 8708 states have (on average 1.4134129536058797) internal successors, (12308), 8708 states have internal predecessors, (12308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8709 states to 8709 states and 12308 transitions. [2025-03-16 19:11:17,762 INFO L78 Accepts]: Start accepts. Automaton has 8709 states and 12308 transitions. Word has length 90 [2025-03-16 19:11:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:17,762 INFO L471 AbstractCegarLoop]: Abstraction has 8709 states and 12308 transitions. [2025-03-16 19:11:17,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8709 states and 12308 transitions. [2025-03-16 19:11:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:11:17,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:17,764 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:17,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:11:17,764 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:17,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1376461730, now seen corresponding path program 1 times [2025-03-16 19:11:17,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:17,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267951482] [2025-03-16 19:11:17,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:17,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:17,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:11:17,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:11:17,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:17,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:17,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:17,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267951482] [2025-03-16 19:11:17,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267951482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:17,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:17,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:17,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942755787] [2025-03-16 19:11:17,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:17,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:17,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:17,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:17,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:17,832 INFO L87 Difference]: Start difference. First operand 8709 states and 12308 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:17,900 INFO L93 Difference]: Finished difference Result 13033 states and 18430 transitions. [2025-03-16 19:11:17,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:17,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-16 19:11:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:17,906 INFO L225 Difference]: With dead ends: 13033 [2025-03-16 19:11:17,906 INFO L226 Difference]: Without dead ends: 4391 [2025-03-16 19:11:17,911 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 19:11:17,914 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 47 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:17,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 235 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4391 states. [2025-03-16 19:11:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4391 to 4389. [2025-03-16 19:11:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4389 states, 4388 states have (on average 1.3965360072926163) internal successors, (6128), 4388 states have internal predecessors, (6128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 4389 states and 6128 transitions. [2025-03-16 19:11:17,992 INFO L78 Accepts]: Start accepts. Automaton has 4389 states and 6128 transitions. Word has length 92 [2025-03-16 19:11:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:17,992 INFO L471 AbstractCegarLoop]: Abstraction has 4389 states and 6128 transitions. [2025-03-16 19:11:17,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:17,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4389 states and 6128 transitions. [2025-03-16 19:11:17,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:11:17,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:17,994 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:17,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:11:17,994 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:17,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash 58511547, now seen corresponding path program 1 times [2025-03-16 19:11:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095425903] [2025-03-16 19:11:17,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:18,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:11:18,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:11:18,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:18,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:18,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095425903] [2025-03-16 19:11:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095425903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:18,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:18,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760485467] [2025-03-16 19:11:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:18,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:18,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:18,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:18,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:18,058 INFO L87 Difference]: Start difference. First operand 4389 states and 6128 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:18,096 INFO L93 Difference]: Finished difference Result 6553 states and 9160 transitions. [2025-03-16 19:11:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:18,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-16 19:11:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:18,100 INFO L225 Difference]: With dead ends: 6553 [2025-03-16 19:11:18,100 INFO L226 Difference]: Without dead ends: 2231 [2025-03-16 19:11:18,103 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 19:11:18,103 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 44 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:18,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 220 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2025-03-16 19:11:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2229. [2025-03-16 19:11:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2228 states have (on average 1.377019748653501) internal successors, (3068), 2228 states have internal predecessors, (3068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 3068 transitions. [2025-03-16 19:11:18,142 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 3068 transitions. Word has length 94 [2025-03-16 19:11:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:18,142 INFO L471 AbstractCegarLoop]: Abstraction has 2229 states and 3068 transitions. [2025-03-16 19:11:18,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 3068 transitions. [2025-03-16 19:11:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:11:18,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:18,143 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:18,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:11:18,144 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:18,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:18,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1036064556, now seen corresponding path program 1 times [2025-03-16 19:11:18,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:18,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176508946] [2025-03-16 19:11:18,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:18,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:18,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:11:18,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:11:18,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:18,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:18,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176508946] [2025-03-16 19:11:18,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176508946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:11:18,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:11:18,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:11:18,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342091789] [2025-03-16 19:11:18,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:11:18,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:11:18,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:18,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:11:18,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:11:18,210 INFO L87 Difference]: Start difference. First operand 2229 states and 3068 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:18,232 INFO L93 Difference]: Finished difference Result 3313 states and 4570 transitions. [2025-03-16 19:11:18,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:11:18,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 19:11:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:18,235 INFO L225 Difference]: With dead ends: 3313 [2025-03-16 19:11:18,235 INFO L226 Difference]: Without dead ends: 1151 [2025-03-16 19:11:18,236 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 19:11:18,237 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 41 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:18,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 205 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:11:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2025-03-16 19:11:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1149. [2025-03-16 19:11:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.352787456445993) internal successors, (1553), 1148 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1553 transitions. [2025-03-16 19:11:18,258 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1553 transitions. Word has length 96 [2025-03-16 19:11:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:18,258 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1553 transitions. [2025-03-16 19:11:18,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1553 transitions. [2025-03-16 19:11:18,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:11:18,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:18,259 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:18,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:11:18,259 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:18,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1406467053, now seen corresponding path program 1 times [2025-03-16 19:11:18,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:18,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985129424] [2025-03-16 19:11:18,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:18,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:11:18,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:11:18,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:18,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:18,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:18,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985129424] [2025-03-16 19:11:18,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985129424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:11:18,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691955458] [2025-03-16 19:11:18,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:18,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:11:18,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:11:18,824 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 19:11:18,826 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 19:11:18,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:11:18,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:11:18,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:18,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:18,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 19:11:18,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:11:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:11:19,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:11:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:11:19,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691955458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:11:19,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:11:19,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 4] total 17 [2025-03-16 19:11:19,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194206030] [2025-03-16 19:11:19,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:11:19,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:11:19,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:19,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:11:19,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:11:19,311 INFO L87 Difference]: Start difference. First operand 1149 states and 1553 transitions. Second operand has 17 states, 17 states have (on average 16.529411764705884) internal successors, (281), 17 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:21,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:21,464 INFO L93 Difference]: Finished difference Result 9688 states and 13203 transitions. [2025-03-16 19:11:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-16 19:11:21,464 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 16.529411764705884) internal successors, (281), 17 states have internal predecessors, (281), 0 states have call successors, (0), 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 98 [2025-03-16 19:11:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:21,473 INFO L225 Difference]: With dead ends: 9688 [2025-03-16 19:11:21,473 INFO L226 Difference]: Without dead ends: 8606 [2025-03-16 19:11:21,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=696, Invalid=3210, Unknown=0, NotChecked=0, Total=3906 [2025-03-16 19:11:21,478 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 2322 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2322 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:21,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2322 Valid, 811 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:11:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8606 states. [2025-03-16 19:11:21,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8606 to 8554. [2025-03-16 19:11:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8554 states, 8553 states have (on average 1.3129895942943997) internal successors, (11230), 8553 states have internal predecessors, (11230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8554 states to 8554 states and 11230 transitions. [2025-03-16 19:11:21,734 INFO L78 Accepts]: Start accepts. Automaton has 8554 states and 11230 transitions. Word has length 98 [2025-03-16 19:11:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:21,735 INFO L471 AbstractCegarLoop]: Abstraction has 8554 states and 11230 transitions. [2025-03-16 19:11:21,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.529411764705884) internal successors, (281), 17 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8554 states and 11230 transitions. [2025-03-16 19:11:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:11:21,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:21,736 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:21,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:11:21,940 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,SelfDestructingSolverStorable24 [2025-03-16 19:11:21,941 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:21,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1662443019, now seen corresponding path program 1 times [2025-03-16 19:11:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:21,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200664528] [2025-03-16 19:11:21,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:21,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:21,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:11:21,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:11:21,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:21,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:22,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200664528] [2025-03-16 19:11:22,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200664528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:11:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790192380] [2025-03-16 19:11:22,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:22,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:11:22,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:11:22,235 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 19:11:22,237 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 19:11:22,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:11:22,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:11:22,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:22,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:22,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:11:22,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:11:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:22,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:11:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:23,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790192380] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:11:23,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:11:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-16 19:11:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082031148] [2025-03-16 19:11:23,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:11:23,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 19:11:23,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:23,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 19:11:23,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:11:23,658 INFO L87 Difference]: Start difference. First operand 8554 states and 11230 transitions. Second operand has 20 states, 20 states have (on average 12.0) internal successors, (240), 19 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:24,381 INFO L93 Difference]: Finished difference Result 24647 states and 32491 transitions. [2025-03-16 19:11:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:11:24,382 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 12.0) internal successors, (240), 19 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 19:11:24,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:24,400 INFO L225 Difference]: With dead ends: 24647 [2025-03-16 19:11:24,401 INFO L226 Difference]: Without dead ends: 17441 [2025-03-16 19:11:24,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:11:24,410 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 779 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:24,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 638 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:11:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2025-03-16 19:11:24,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 17177. [2025-03-16 19:11:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17177 states, 17176 states have (on average 1.2943060083837914) internal successors, (22231), 17176 states have internal predecessors, (22231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17177 states to 17177 states and 22231 transitions. [2025-03-16 19:11:24,916 INFO L78 Accepts]: Start accepts. Automaton has 17177 states and 22231 transitions. Word has length 99 [2025-03-16 19:11:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:24,917 INFO L471 AbstractCegarLoop]: Abstraction has 17177 states and 22231 transitions. [2025-03-16 19:11:24,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.0) internal successors, (240), 19 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 17177 states and 22231 transitions. [2025-03-16 19:11:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:11:24,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:24,918 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:24,925 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 19:11:25,119 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,SelfDestructingSolverStorable25 [2025-03-16 19:11:25,120 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:25,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1069736117, now seen corresponding path program 1 times [2025-03-16 19:11:25,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:25,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775188634] [2025-03-16 19:11:25,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:25,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:25,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:11:25,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:11:25,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:25,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:25,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:25,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775188634] [2025-03-16 19:11:25,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775188634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:11:25,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264048843] [2025-03-16 19:11:25,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:25,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:11:25,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:11:25,753 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 19:11:25,754 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 19:11:25,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:11:25,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:11:25,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:25,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:25,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 19:11:25,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:11:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:26,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:11:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:27,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264048843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:11:27,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:11:27,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2025-03-16 19:11:27,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157549496] [2025-03-16 19:11:27,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:11:27,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 19:11:27,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:27,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 19:11:27,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:11:27,059 INFO L87 Difference]: Start difference. First operand 17177 states and 22231 transitions. Second operand has 33 states, 33 states have (on average 8.090909090909092) internal successors, (267), 32 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:29,385 INFO L93 Difference]: Finished difference Result 56131 states and 73137 transitions. [2025-03-16 19:11:29,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-16 19:11:29,386 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.090909090909092) internal successors, (267), 32 states have internal predecessors, (267), 0 states have call successors, (0), 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 19:11:29,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:29,429 INFO L225 Difference]: With dead ends: 56131 [2025-03-16 19:11:29,429 INFO L226 Difference]: Without dead ends: 39485 [2025-03-16 19:11:29,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=859, Invalid=4111, Unknown=0, NotChecked=0, Total=4970 [2025-03-16 19:11:29,448 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 2135 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2135 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:29,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2135 Valid, 1578 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:11:29,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39485 states. [2025-03-16 19:11:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39485 to 34377. [2025-03-16 19:11:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34377 states, 34376 states have (on average 1.2822608796835002) internal successors, (44079), 34376 states have internal predecessors, (44079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34377 states to 34377 states and 44079 transitions. [2025-03-16 19:11:30,169 INFO L78 Accepts]: Start accepts. Automaton has 34377 states and 44079 transitions. Word has length 99 [2025-03-16 19:11:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:30,169 INFO L471 AbstractCegarLoop]: Abstraction has 34377 states and 44079 transitions. [2025-03-16 19:11:30,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.090909090909092) internal successors, (267), 32 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 34377 states and 44079 transitions. [2025-03-16 19:11:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:11:30,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:30,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:11:30,178 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 19:11:30,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:11:30,371 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:30,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:30,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1628658948, now seen corresponding path program 1 times [2025-03-16 19:11:30,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:30,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505105612] [2025-03-16 19:11:30,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:30,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:11:30,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:11:30,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:30,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:30,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505105612] [2025-03-16 19:11:30,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505105612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:11:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532353512] [2025-03-16 19:11:30,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:30,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:11:30,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:11:30,591 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 19:11:30,593 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 19:11:30,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:11:30,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:11:30,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:30,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:30,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 19:11:30,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:11:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:31,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:11:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:31,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532353512] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:11:31,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:11:31,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 30 [2025-03-16 19:11:31,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934744006] [2025-03-16 19:11:31,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:11:31,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 19:11:31,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:31,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 19:11:31,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2025-03-16 19:11:31,893 INFO L87 Difference]: Start difference. First operand 34377 states and 44079 transitions. Second operand has 31 states, 31 states have (on average 8.387096774193548) internal successors, (260), 30 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:36,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:36,406 INFO L93 Difference]: Finished difference Result 157247 states and 202054 transitions. [2025-03-16 19:11:36,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-16 19:11:36,406 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.387096774193548) internal successors, (260), 30 states have internal predecessors, (260), 0 states have call successors, (0), 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 100 [2025-03-16 19:11:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:36,549 INFO L225 Difference]: With dead ends: 157247 [2025-03-16 19:11:36,549 INFO L226 Difference]: Without dead ends: 126251 [2025-03-16 19:11:36,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2204 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1309, Invalid=6881, Unknown=0, NotChecked=0, Total=8190 [2025-03-16 19:11:36,602 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 2645 mSDsluCounter, 2012 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2645 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:36,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2645 Valid, 2126 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:11:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126251 states. [2025-03-16 19:11:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126251 to 63834. [2025-03-16 19:11:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63834 states, 63833 states have (on average 1.262231134366237) internal successors, (80572), 63833 states have internal predecessors, (80572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63834 states to 63834 states and 80572 transitions. [2025-03-16 19:11:38,716 INFO L78 Accepts]: Start accepts. Automaton has 63834 states and 80572 transitions. Word has length 100 [2025-03-16 19:11:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:38,717 INFO L471 AbstractCegarLoop]: Abstraction has 63834 states and 80572 transitions. [2025-03-16 19:11:38,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.387096774193548) internal successors, (260), 30 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 63834 states and 80572 transitions. [2025-03-16 19:11:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:11:38,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:38,718 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:38,725 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 19:11:38,919 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,SelfDestructingSolverStorable27 [2025-03-16 19:11:38,919 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:38,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:38,919 INFO L85 PathProgramCache]: Analyzing trace with hash 164368421, now seen corresponding path program 1 times [2025-03-16 19:11:38,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:38,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450245223] [2025-03-16 19:11:38,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:38,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:38,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:11:38,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:11:38,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:38,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:39,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:39,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450245223] [2025-03-16 19:11:39,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450245223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:11:39,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392974348] [2025-03-16 19:11:39,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:39,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:11:39,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:11:39,114 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 19:11:39,116 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 19:11:39,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:11:39,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:11:39,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:39,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:39,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:11:39,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:11:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:39,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:11:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:40,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392974348] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:11:40,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:11:40,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2025-03-16 19:11:40,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557117735] [2025-03-16 19:11:40,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:11:40,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 19:11:40,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:40,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 19:11:40,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2025-03-16 19:11:40,563 INFO L87 Difference]: Start difference. First operand 63834 states and 80572 transitions. Second operand has 29 states, 29 states have (on average 9.344827586206897) internal successors, (271), 28 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:11:46,633 INFO L93 Difference]: Finished difference Result 241742 states and 305251 transitions. [2025-03-16 19:11:46,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-16 19:11:46,634 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.344827586206897) internal successors, (271), 28 states have internal predecessors, (271), 0 states have call successors, (0), 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 101 [2025-03-16 19:11:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:11:46,832 INFO L225 Difference]: With dead ends: 241742 [2025-03-16 19:11:46,832 INFO L226 Difference]: Without dead ends: 183455 [2025-03-16 19:11:46,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1006, Invalid=5314, Unknown=0, NotChecked=0, Total=6320 [2025-03-16 19:11:46,866 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 2367 mSDsluCounter, 2284 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2367 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 2206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:11:46,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2367 Valid, 2439 Invalid, 2206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:11:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183455 states. [2025-03-16 19:11:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183455 to 121829. [2025-03-16 19:11:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121829 states, 121828 states have (on average 1.2450586072167318) internal successors, (151683), 121828 states have internal predecessors, (151683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121829 states to 121829 states and 151683 transitions. [2025-03-16 19:11:51,459 INFO L78 Accepts]: Start accepts. Automaton has 121829 states and 151683 transitions. Word has length 101 [2025-03-16 19:11:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:11:51,459 INFO L471 AbstractCegarLoop]: Abstraction has 121829 states and 151683 transitions. [2025-03-16 19:11:51,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.344827586206897) internal successors, (271), 28 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:11:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 121829 states and 151683 transitions. [2025-03-16 19:11:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:11:51,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:11:51,462 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:11:51,468 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 19:11:51,663 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,SelfDestructingSolverStorable28 [2025-03-16 19:11:51,663 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:11:51,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:11:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash 6247678, now seen corresponding path program 1 times [2025-03-16 19:11:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:11:51,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102358772] [2025-03-16 19:11:51,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:51,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:11:51,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:11:51,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:11:51,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:51,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:51,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:11:51,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102358772] [2025-03-16 19:11:51,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102358772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:11:51,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785262828] [2025-03-16 19:11:51,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:11:51,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:11:51,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:11:51,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:11:51,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 19:11:51,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:11:52,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:11:52,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:11:52,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:11:52,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:11:52,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:11:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:52,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:11:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:11:53,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785262828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:11:53,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:11:53,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2025-03-16 19:11:53,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131702598] [2025-03-16 19:11:53,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:11:53,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 19:11:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:11:53,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 19:11:53,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2025-03-16 19:11:53,093 INFO L87 Difference]: Start difference. First operand 121829 states and 151683 transitions. Second operand has 29 states, 29 states have (on average 9.620689655172415) internal successors, (279), 28 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:12:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:00,098 INFO L93 Difference]: Finished difference Result 299013 states and 373601 transitions. [2025-03-16 19:12:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-16 19:12:00,099 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.620689655172415) internal successors, (279), 28 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-16 19:12:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:00,346 INFO L225 Difference]: With dead ends: 299013 [2025-03-16 19:12:00,346 INFO L226 Difference]: Without dead ends: 184935 [2025-03-16 19:12:00,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2095 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1226, Invalid=6430, Unknown=0, NotChecked=0, Total=7656 [2025-03-16 19:12:00,417 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 3411 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3411 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:00,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3411 Valid, 1837 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:12:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184935 states.