./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label25.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 1a498dbc067f1de398639e507498752ad05d79db17a274a9c2dbfecc9e6d20a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:50:58,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:50:58,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:50:58,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:50:58,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:50:58,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:50:58,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:50:58,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:50:58,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:50:58,623 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:50:58,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:50:58,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:50:58,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:50:58,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:50:58,624 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:50:58,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:50:58,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:50:58,624 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:50:58,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:50:58,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:50:58,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:50:58,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:50:58,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:50:58,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:50:58,625 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:50:58,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:50:58,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:50:58,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:50:58,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:50:58,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:50:58,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:50:58,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:50:58,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:50:58,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:50:58,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:50:58,626 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:50:58,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:50:58,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:50:58,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:50:58,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:50:58,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:50:58,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:50:58,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:50:58,627 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 -> 1a498dbc067f1de398639e507498752ad05d79db17a274a9c2dbfecc9e6d20a0 [2025-03-16 14:50:58,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:50:58,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:50:58,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:50:58,857 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:50:58,857 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:50:58,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label25.c [2025-03-16 14:50:59,963 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268314d87/5a059ae621994b1cbc3e90b452ec8c37/FLAG80e48aefd [2025-03-16 14:51:00,276 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:51:00,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label25.c [2025-03-16 14:51:00,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268314d87/5a059ae621994b1cbc3e90b452ec8c37/FLAG80e48aefd [2025-03-16 14:51:00,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268314d87/5a059ae621994b1cbc3e90b452ec8c37 [2025-03-16 14:51:00,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:51:00,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:51:00,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:51:00,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:51:00,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:51:00,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:51:00" (1/1) ... [2025-03-16 14:51:00,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10719c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:00, skipping insertion in model container [2025-03-16 14:51:00,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:51:00" (1/1) ... [2025-03-16 14:51:00,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:51:00,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label25.c[4556,4569] [2025-03-16 14:51:00,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:51:00,904 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:51:00,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label25.c[4556,4569] [2025-03-16 14:51:01,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:51:01,017 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:51:01,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01 WrapperNode [2025-03-16 14:51:01,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:51:01,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:51:01,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:51:01,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:51:01,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,123 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-16 14:51:01,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:51:01,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:51:01,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:51:01,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:51:01,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,223 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:51:01,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,255 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:51:01,288 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:51:01,289 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:51:01,289 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:51:01,290 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:51:01,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:01,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:51:01,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:51:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:51:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:51:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:51:01,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:51:01,388 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:51:01,389 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:51:02,481 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-16 14:51:02,481 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:51:02,496 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:51:02,498 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:51:02,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:51:02 BoogieIcfgContainer [2025-03-16 14:51:02,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:51:02,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:51:02,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:51:02,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:51:02,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:51:00" (1/3) ... [2025-03-16 14:51:02,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c130151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:51:02, skipping insertion in model container [2025-03-16 14:51:02,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (2/3) ... [2025-03-16 14:51:02,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c130151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:51:02, skipping insertion in model container [2025-03-16 14:51:02,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:51:02" (3/3) ... [2025-03-16 14:51:02,507 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label25.c [2025-03-16 14:51:02,519 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:51:02,520 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label25.c that has 1 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:51:02,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:51:02,580 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;@326ccfc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:51:02,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:51:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 14:51:02,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:02,590 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] [2025-03-16 14:51:02,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:02,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:02,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1159584547, now seen corresponding path program 1 times [2025-03-16 14:51:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:02,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041536413] [2025-03-16 14:51:02,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:02,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:02,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 14:51:02,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 14:51:02,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:02,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:02,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041536413] [2025-03-16 14:51:02,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041536413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:02,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:02,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:02,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500511756] [2025-03-16 14:51:02,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:02,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:51:02,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:02,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:51:02,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:51:02,742 INFO L87 Difference]: Start difference. First operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:02,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:02,770 INFO L93 Difference]: Finished difference Result 443 states and 839 transitions. [2025-03-16 14:51:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:51:02,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-16 14:51:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:02,778 INFO L225 Difference]: With dead ends: 443 [2025-03-16 14:51:02,779 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 14:51:02,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:51:02,785 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:02,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:51:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 14:51:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-16 14:51:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2025-03-16 14:51:02,829 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 30 [2025-03-16 14:51:02,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:02,830 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2025-03-16 14:51:02,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2025-03-16 14:51:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 14:51:02,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:02,830 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] [2025-03-16 14:51:02,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:51:02,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:02,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:02,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1629733215, now seen corresponding path program 1 times [2025-03-16 14:51:02,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:02,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594777701] [2025-03-16 14:51:02,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:02,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:02,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 14:51:02,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 14:51:02,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:02,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:02,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594777701] [2025-03-16 14:51:02,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594777701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:02,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:02,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:02,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744384799] [2025-03-16 14:51:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:02,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:02,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:02,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:02,978 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:03,747 INFO L93 Difference]: Finished difference Result 630 states and 1029 transitions. [2025-03-16 14:51:03,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:03,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-16 14:51:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:03,750 INFO L225 Difference]: With dead ends: 630 [2025-03-16 14:51:03,752 INFO L226 Difference]: Without dead ends: 412 [2025-03-16 14:51:03,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:03,754 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 177 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:03,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 145 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:51:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-16 14:51:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2025-03-16 14:51:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4596577017114913) internal successors, (597), 409 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2025-03-16 14:51:03,779 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 30 [2025-03-16 14:51:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:03,780 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2025-03-16 14:51:03,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2025-03-16 14:51:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 14:51:03,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:03,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:03,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:51:03,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:03,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:03,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1768812116, now seen corresponding path program 1 times [2025-03-16 14:51:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:03,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963107299] [2025-03-16 14:51:03,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:03,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 14:51:03,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 14:51:03,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:03,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:04,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:04,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963107299] [2025-03-16 14:51:04,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963107299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:04,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:04,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:04,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752595224] [2025-03-16 14:51:04,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:04,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:04,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:04,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:04,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:04,024 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:04,674 INFO L93 Difference]: Finished difference Result 1208 states and 1764 transitions. [2025-03-16 14:51:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:04,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 14:51:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:04,679 INFO L225 Difference]: With dead ends: 1208 [2025-03-16 14:51:04,680 INFO L226 Difference]: Without dead ends: 799 [2025-03-16 14:51:04,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:04,680 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:04,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-16 14:51:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 786. [2025-03-16 14:51:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3859872611464967) internal successors, (1088), 785 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1088 transitions. [2025-03-16 14:51:04,707 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1088 transitions. Word has length 98 [2025-03-16 14:51:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:04,707 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1088 transitions. [2025-03-16 14:51:04,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1088 transitions. [2025-03-16 14:51:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 14:51:04,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:04,710 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:04,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:51:04,710 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:04,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:04,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1062090834, now seen corresponding path program 1 times [2025-03-16 14:51:04,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:04,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102855407] [2025-03-16 14:51:04,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:04,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:04,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 14:51:04,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 14:51:04,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:04,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:05,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:05,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102855407] [2025-03-16 14:51:05,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102855407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:05,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:05,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:05,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329497567] [2025-03-16 14:51:05,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:05,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:05,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:05,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:05,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:05,099 INFO L87 Difference]: Start difference. First operand 786 states and 1088 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:06,072 INFO L93 Difference]: Finished difference Result 2315 states and 3093 transitions. [2025-03-16 14:51:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:06,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 14:51:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:06,077 INFO L225 Difference]: With dead ends: 2315 [2025-03-16 14:51:06,077 INFO L226 Difference]: Without dead ends: 1530 [2025-03-16 14:51:06,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:51:06,079 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 485 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:06,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 217 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:51:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2025-03-16 14:51:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1527. [2025-03-16 14:51:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1526 states have (on average 1.2509829619921362) internal successors, (1909), 1526 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1909 transitions. [2025-03-16 14:51:06,109 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1909 transitions. Word has length 99 [2025-03-16 14:51:06,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:06,109 INFO L471 AbstractCegarLoop]: Abstraction has 1527 states and 1909 transitions. [2025-03-16 14:51:06,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:06,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1909 transitions. [2025-03-16 14:51:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 14:51:06,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:06,114 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:06,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:51:06,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:06,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:06,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2038107292, now seen corresponding path program 1 times [2025-03-16 14:51:06,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:06,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281477332] [2025-03-16 14:51:06,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:06,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:06,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 14:51:06,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 14:51:06,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:06,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 14:51:06,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:06,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281477332] [2025-03-16 14:51:06,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281477332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:06,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:06,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:06,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255871182] [2025-03-16 14:51:06,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:06,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:06,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:06,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:06,289 INFO L87 Difference]: Start difference. First operand 1527 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:06,907 INFO L93 Difference]: Finished difference Result 3430 states and 4427 transitions. [2025-03-16 14:51:06,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:06,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2025-03-16 14:51:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:06,915 INFO L225 Difference]: With dead ends: 3430 [2025-03-16 14:51:06,915 INFO L226 Difference]: Without dead ends: 2088 [2025-03-16 14:51:06,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:06,918 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:06,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2025-03-16 14:51:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2088. [2025-03-16 14:51:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2087 states have (on average 1.2275994250119788) internal successors, (2562), 2087 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2562 transitions. [2025-03-16 14:51:06,950 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2562 transitions. Word has length 142 [2025-03-16 14:51:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:06,951 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2562 transitions. [2025-03-16 14:51:06,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2562 transitions. [2025-03-16 14:51:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-16 14:51:06,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:06,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:06,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:51:06,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:06,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash 443676764, now seen corresponding path program 1 times [2025-03-16 14:51:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:06,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481281896] [2025-03-16 14:51:06,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:06,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:06,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 14:51:06,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 14:51:06,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:06,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:07,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:07,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481281896] [2025-03-16 14:51:07,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481281896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:07,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:07,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:07,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109830208] [2025-03-16 14:51:07,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:07,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:07,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:07,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:07,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:07,134 INFO L87 Difference]: Start difference. First operand 2088 states and 2562 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:07,793 INFO L93 Difference]: Finished difference Result 5129 states and 6433 transitions. [2025-03-16 14:51:07,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:07,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-03-16 14:51:07,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:07,802 INFO L225 Difference]: With dead ends: 5129 [2025-03-16 14:51:07,802 INFO L226 Difference]: Without dead ends: 3226 [2025-03-16 14:51:07,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:07,805 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 204 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:07,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2025-03-16 14:51:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3223. [2025-03-16 14:51:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 3222 states have (on average 1.2253258845437616) internal successors, (3948), 3222 states have internal predecessors, (3948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 3948 transitions. [2025-03-16 14:51:07,854 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 3948 transitions. Word has length 157 [2025-03-16 14:51:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:07,854 INFO L471 AbstractCegarLoop]: Abstraction has 3223 states and 3948 transitions. [2025-03-16 14:51:07,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:07,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 3948 transitions. [2025-03-16 14:51:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-16 14:51:07,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:07,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:07,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:51:07,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:07,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1413551343, now seen corresponding path program 1 times [2025-03-16 14:51:07,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:07,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240558864] [2025-03-16 14:51:07,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:07,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:07,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-16 14:51:07,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-16 14:51:07,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:07,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:08,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:08,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240558864] [2025-03-16 14:51:08,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240558864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:08,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:08,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:08,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133944328] [2025-03-16 14:51:08,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:08,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:08,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:08,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:08,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:08,062 INFO L87 Difference]: Start difference. First operand 3223 states and 3948 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:08,707 INFO L93 Difference]: Finished difference Result 7756 states and 9618 transitions. [2025-03-16 14:51:08,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:08,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-16 14:51:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:08,720 INFO L225 Difference]: With dead ends: 7756 [2025-03-16 14:51:08,720 INFO L226 Difference]: Without dead ends: 4718 [2025-03-16 14:51:08,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:08,725 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:08,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 337 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2025-03-16 14:51:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 4514. [2025-03-16 14:51:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4514 states, 4513 states have (on average 1.2020828717039662) internal successors, (5425), 4513 states have internal predecessors, (5425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 5425 transitions. [2025-03-16 14:51:08,795 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 5425 transitions. Word has length 210 [2025-03-16 14:51:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:08,796 INFO L471 AbstractCegarLoop]: Abstraction has 4514 states and 5425 transitions. [2025-03-16 14:51:08,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 5425 transitions. [2025-03-16 14:51:08,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-16 14:51:08,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:08,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:08,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:51:08,798 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:08,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:08,798 INFO L85 PathProgramCache]: Analyzing trace with hash 931110255, now seen corresponding path program 1 times [2025-03-16 14:51:08,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:08,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618180559] [2025-03-16 14:51:08,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:08,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:08,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-16 14:51:08,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-16 14:51:08,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:08,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 14:51:08,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:08,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618180559] [2025-03-16 14:51:08,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618180559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:08,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:08,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:08,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797410501] [2025-03-16 14:51:08,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:08,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:08,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:08,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:08,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:08,974 INFO L87 Difference]: Start difference. First operand 4514 states and 5425 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:09,502 INFO L93 Difference]: Finished difference Result 9964 states and 12030 transitions. [2025-03-16 14:51:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:09,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 211 [2025-03-16 14:51:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:09,517 INFO L225 Difference]: With dead ends: 9964 [2025-03-16 14:51:09,517 INFO L226 Difference]: Without dead ends: 5451 [2025-03-16 14:51:09,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:09,522 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 171 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:09,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 344 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:09,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2025-03-16 14:51:09,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 5434. [2025-03-16 14:51:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5434 states, 5433 states have (on average 1.195472114853672) internal successors, (6495), 5433 states have internal predecessors, (6495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5434 states to 5434 states and 6495 transitions. [2025-03-16 14:51:09,597 INFO L78 Accepts]: Start accepts. Automaton has 5434 states and 6495 transitions. Word has length 211 [2025-03-16 14:51:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:09,598 INFO L471 AbstractCegarLoop]: Abstraction has 5434 states and 6495 transitions. [2025-03-16 14:51:09,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5434 states and 6495 transitions. [2025-03-16 14:51:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-16 14:51:09,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:09,600 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:09,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:51:09,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:09,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1297282516, now seen corresponding path program 1 times [2025-03-16 14:51:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:09,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24293247] [2025-03-16 14:51:09,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:09,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-16 14:51:09,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-16 14:51:09,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:09,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 14:51:09,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:09,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24293247] [2025-03-16 14:51:09,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24293247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:09,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:09,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:09,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972044167] [2025-03-16 14:51:09,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:09,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:09,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:09,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:09,744 INFO L87 Difference]: Start difference. First operand 5434 states and 6495 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:10,348 INFO L93 Difference]: Finished difference Result 11986 states and 14463 transitions. [2025-03-16 14:51:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 212 [2025-03-16 14:51:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:10,363 INFO L225 Difference]: With dead ends: 11986 [2025-03-16 14:51:10,364 INFO L226 Difference]: Without dead ends: 6553 [2025-03-16 14:51:10,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:10,370 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 166 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:10,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 377 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6553 states. [2025-03-16 14:51:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6553 to 6538. [2025-03-16 14:51:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6538 states, 6537 states have (on average 1.179899036255163) internal successors, (7713), 6537 states have internal predecessors, (7713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6538 states to 6538 states and 7713 transitions. [2025-03-16 14:51:10,454 INFO L78 Accepts]: Start accepts. Automaton has 6538 states and 7713 transitions. Word has length 212 [2025-03-16 14:51:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:10,454 INFO L471 AbstractCegarLoop]: Abstraction has 6538 states and 7713 transitions. [2025-03-16 14:51:10,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 7713 transitions. [2025-03-16 14:51:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 14:51:10,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:10,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:10,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:51:10,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:10,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:10,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1306162490, now seen corresponding path program 1 times [2025-03-16 14:51:10,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:10,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214930306] [2025-03-16 14:51:10,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:10,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:10,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 14:51:10,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 14:51:10,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:10,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:10,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:10,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214930306] [2025-03-16 14:51:10,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214930306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:10,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:10,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:51:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962919027] [2025-03-16 14:51:10,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:10,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:10,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:10,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:10,737 INFO L87 Difference]: Start difference. First operand 6538 states and 7713 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:11,842 INFO L93 Difference]: Finished difference Result 20128 states and 24015 transitions. [2025-03-16 14:51:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:11,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-03-16 14:51:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:11,878 INFO L225 Difference]: With dead ends: 20128 [2025-03-16 14:51:11,878 INFO L226 Difference]: Without dead ends: 13591 [2025-03-16 14:51:11,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:11,886 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 306 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:11,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 209 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 14:51:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13591 states. [2025-03-16 14:51:11,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13591 to 11543. [2025-03-16 14:51:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11543 states, 11542 states have (on average 1.1710275515508577) internal successors, (13516), 11542 states have internal predecessors, (13516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11543 states to 11543 states and 13516 transitions. [2025-03-16 14:51:12,023 INFO L78 Accepts]: Start accepts. Automaton has 11543 states and 13516 transitions. Word has length 232 [2025-03-16 14:51:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:12,023 INFO L471 AbstractCegarLoop]: Abstraction has 11543 states and 13516 transitions. [2025-03-16 14:51:12,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 11543 states and 13516 transitions. [2025-03-16 14:51:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-16 14:51:12,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:12,026 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:12,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:51:12,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:12,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1848652223, now seen corresponding path program 1 times [2025-03-16 14:51:12,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:12,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414752798] [2025-03-16 14:51:12,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:12,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:12,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-16 14:51:12,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-16 14:51:12,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:12,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:12,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:12,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414752798] [2025-03-16 14:51:12,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414752798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:12,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:12,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:51:12,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733854293] [2025-03-16 14:51:12,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:12,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:12,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:12,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:12,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:12,278 INFO L87 Difference]: Start difference. First operand 11543 states and 13516 transitions. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:13,403 INFO L93 Difference]: Finished difference Result 27895 states and 33099 transitions. [2025-03-16 14:51:13,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:13,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2025-03-16 14:51:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:13,428 INFO L225 Difference]: With dead ends: 27895 [2025-03-16 14:51:13,428 INFO L226 Difference]: Without dead ends: 16353 [2025-03-16 14:51:13,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:13,437 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 310 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:13,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 130 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 14:51:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16353 states. [2025-03-16 14:51:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16353 to 15968. [2025-03-16 14:51:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15968 states, 15967 states have (on average 1.1776789628609006) internal successors, (18804), 15967 states have internal predecessors, (18804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15968 states to 15968 states and 18804 transitions. [2025-03-16 14:51:13,594 INFO L78 Accepts]: Start accepts. Automaton has 15968 states and 18804 transitions. Word has length 242 [2025-03-16 14:51:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:13,595 INFO L471 AbstractCegarLoop]: Abstraction has 15968 states and 18804 transitions. [2025-03-16 14:51:13,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 15968 states and 18804 transitions. [2025-03-16 14:51:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-16 14:51:13,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:13,600 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:13,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:51:13,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:13,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:13,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1923365668, now seen corresponding path program 1 times [2025-03-16 14:51:13,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:13,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089749959] [2025-03-16 14:51:13,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:13,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-16 14:51:13,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-16 14:51:13,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:13,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-16 14:51:13,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:13,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089749959] [2025-03-16 14:51:13,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089749959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:13,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368875564] [2025-03-16 14:51:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:13,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:13,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:13,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:13,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:13,693 INFO L87 Difference]: Start difference. First operand 15968 states and 18804 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:14,381 INFO L93 Difference]: Finished difference Result 38006 states and 44943 transitions. [2025-03-16 14:51:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:14,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 244 [2025-03-16 14:51:14,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:14,414 INFO L225 Difference]: With dead ends: 38006 [2025-03-16 14:51:14,414 INFO L226 Difference]: Without dead ends: 22039 [2025-03-16 14:51:14,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:14,429 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 169 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:14,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 374 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22039 states. [2025-03-16 14:51:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22039 to 20747. [2025-03-16 14:51:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20747 states, 20746 states have (on average 1.1608020823291236) internal successors, (24082), 20746 states have internal predecessors, (24082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20747 states to 20747 states and 24082 transitions. [2025-03-16 14:51:14,621 INFO L78 Accepts]: Start accepts. Automaton has 20747 states and 24082 transitions. Word has length 244 [2025-03-16 14:51:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:14,621 INFO L471 AbstractCegarLoop]: Abstraction has 20747 states and 24082 transitions. [2025-03-16 14:51:14,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 24082 transitions. [2025-03-16 14:51:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-16 14:51:14,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:14,625 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:14,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:51:14,625 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:14,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:14,626 INFO L85 PathProgramCache]: Analyzing trace with hash 188771870, now seen corresponding path program 1 times [2025-03-16 14:51:14,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:14,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247755558] [2025-03-16 14:51:14,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:14,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-16 14:51:14,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-16 14:51:14,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:14,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 14:51:14,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:14,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247755558] [2025-03-16 14:51:14,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247755558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:14,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:14,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:14,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307380197] [2025-03-16 14:51:14,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:14,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:14,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:14,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:14,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:14,831 INFO L87 Difference]: Start difference. First operand 20747 states and 24082 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:15,483 INFO L93 Difference]: Finished difference Result 41505 states and 48187 transitions. [2025-03-16 14:51:15,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:15,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2025-03-16 14:51:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:15,512 INFO L225 Difference]: With dead ends: 41505 [2025-03-16 14:51:15,512 INFO L226 Difference]: Without dead ends: 20759 [2025-03-16 14:51:15,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:15,527 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 169 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:15,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 374 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20759 states. [2025-03-16 14:51:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20759 to 20562. [2025-03-16 14:51:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20562 states, 20561 states have (on average 1.1354992461456155) internal successors, (23347), 20561 states have internal predecessors, (23347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20562 states to 20562 states and 23347 transitions. [2025-03-16 14:51:15,756 INFO L78 Accepts]: Start accepts. Automaton has 20562 states and 23347 transitions. Word has length 249 [2025-03-16 14:51:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:15,756 INFO L471 AbstractCegarLoop]: Abstraction has 20562 states and 23347 transitions. [2025-03-16 14:51:15,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 20562 states and 23347 transitions. [2025-03-16 14:51:15,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-16 14:51:15,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:15,761 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:15,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:51:15,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:15,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2078015675, now seen corresponding path program 1 times [2025-03-16 14:51:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:15,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344118007] [2025-03-16 14:51:15,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:15,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:15,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-16 14:51:15,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-16 14:51:15,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:15,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:16,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:16,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344118007] [2025-03-16 14:51:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344118007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:16,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533630164] [2025-03-16 14:51:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:16,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:16,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:16,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:16,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:16,008 INFO L87 Difference]: Start difference. First operand 20562 states and 23347 transitions. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:16,850 INFO L93 Difference]: Finished difference Result 38133 states and 43344 transitions. [2025-03-16 14:51:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:16,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2025-03-16 14:51:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:16,876 INFO L225 Difference]: With dead ends: 38133 [2025-03-16 14:51:16,876 INFO L226 Difference]: Without dead ends: 16836 [2025-03-16 14:51:16,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:16,890 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 213 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:16,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 162 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:51:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16836 states. [2025-03-16 14:51:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16836 to 12035. [2025-03-16 14:51:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12035 states, 12034 states have (on average 1.1081934518863221) internal successors, (13336), 12034 states have internal predecessors, (13336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12035 states to 12035 states and 13336 transitions. [2025-03-16 14:51:17,007 INFO L78 Accepts]: Start accepts. Automaton has 12035 states and 13336 transitions. Word has length 263 [2025-03-16 14:51:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:17,008 INFO L471 AbstractCegarLoop]: Abstraction has 12035 states and 13336 transitions. [2025-03-16 14:51:17,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12035 states and 13336 transitions. [2025-03-16 14:51:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-16 14:51:17,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:17,013 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:17,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:51:17,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:17,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1517503193, now seen corresponding path program 1 times [2025-03-16 14:51:17,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:17,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553605777] [2025-03-16 14:51:17,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:17,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:17,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-16 14:51:17,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-16 14:51:17,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:17,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-16 14:51:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:17,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553605777] [2025-03-16 14:51:17,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553605777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:17,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:17,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:17,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529068581] [2025-03-16 14:51:17,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:17,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:17,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:17,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:17,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:17,155 INFO L87 Difference]: Start difference. First operand 12035 states and 13336 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:17,668 INFO L93 Difference]: Finished difference Result 25357 states and 28110 transitions. [2025-03-16 14:51:17,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:17,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 297 [2025-03-16 14:51:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:17,683 INFO L225 Difference]: With dead ends: 25357 [2025-03-16 14:51:17,683 INFO L226 Difference]: Without dead ends: 13323 [2025-03-16 14:51:17,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:17,691 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 162 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:17,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 376 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:17,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13323 states. [2025-03-16 14:51:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13323 to 12771. [2025-03-16 14:51:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12771 states, 12770 states have (on average 1.1047768206734534) internal successors, (14108), 12770 states have internal predecessors, (14108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12771 states to 12771 states and 14108 transitions. [2025-03-16 14:51:17,792 INFO L78 Accepts]: Start accepts. Automaton has 12771 states and 14108 transitions. Word has length 297 [2025-03-16 14:51:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:17,793 INFO L471 AbstractCegarLoop]: Abstraction has 12771 states and 14108 transitions. [2025-03-16 14:51:17,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 12771 states and 14108 transitions. [2025-03-16 14:51:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-16 14:51:17,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:17,798 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:17,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:51:17,798 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:17,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1990283463, now seen corresponding path program 1 times [2025-03-16 14:51:17,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:17,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235758583] [2025-03-16 14:51:17,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:17,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:17,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-16 14:51:17,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-16 14:51:17,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:17,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:51:18,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235758583] [2025-03-16 14:51:18,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235758583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:18,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:18,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:51:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602697559] [2025-03-16 14:51:18,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:18,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:18,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:18,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:18,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:18,119 INFO L87 Difference]: Start difference. First operand 12771 states and 14108 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:19,027 INFO L93 Difference]: Finished difference Result 33852 states and 37343 transitions. [2025-03-16 14:51:19,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:19,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 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 317 [2025-03-16 14:51:19,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:19,044 INFO L225 Difference]: With dead ends: 33852 [2025-03-16 14:51:19,044 INFO L226 Difference]: Without dead ends: 20898 [2025-03-16 14:51:19,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:19,055 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 332 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:19,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 84 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:51:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2025-03-16 14:51:19,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 18494. [2025-03-16 14:51:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18494 states, 18493 states have (on average 1.1002541502190017) internal successors, (20347), 18493 states have internal predecessors, (20347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18494 states to 18494 states and 20347 transitions. [2025-03-16 14:51:19,246 INFO L78 Accepts]: Start accepts. Automaton has 18494 states and 20347 transitions. Word has length 317 [2025-03-16 14:51:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:19,246 INFO L471 AbstractCegarLoop]: Abstraction has 18494 states and 20347 transitions. [2025-03-16 14:51:19,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 18494 states and 20347 transitions. [2025-03-16 14:51:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 14:51:19,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:19,253 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:19,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:51:19,253 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:19,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:19,253 INFO L85 PathProgramCache]: Analyzing trace with hash -850253100, now seen corresponding path program 1 times [2025-03-16 14:51:19,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:19,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793336438] [2025-03-16 14:51:19,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:19,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:19,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 14:51:19,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 14:51:19,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:19,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-16 14:51:19,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:19,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793336438] [2025-03-16 14:51:19,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793336438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:19,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:19,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:19,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259233032] [2025-03-16 14:51:19,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:19,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:19,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:19,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:19,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:19,361 INFO L87 Difference]: Start difference. First operand 18494 states and 20347 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:19,882 INFO L93 Difference]: Finished difference Result 39746 states and 43718 transitions. [2025-03-16 14:51:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:19,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2025-03-16 14:51:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:19,902 INFO L225 Difference]: With dead ends: 39746 [2025-03-16 14:51:19,902 INFO L226 Difference]: Without dead ends: 21253 [2025-03-16 14:51:19,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:19,914 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 187 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:19,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 139 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21253 states. [2025-03-16 14:51:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21253 to 14808. [2025-03-16 14:51:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.1023164719389478) internal successors, (16322), 14807 states have internal predecessors, (16322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 16322 transitions. [2025-03-16 14:51:20,061 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 16322 transitions. Word has length 324 [2025-03-16 14:51:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:20,061 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 16322 transitions. [2025-03-16 14:51:20,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 16322 transitions. [2025-03-16 14:51:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-16 14:51:20,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:20,065 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:20,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:51:20,065 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:20,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:20,066 INFO L85 PathProgramCache]: Analyzing trace with hash 379532680, now seen corresponding path program 1 times [2025-03-16 14:51:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:20,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129731413] [2025-03-16 14:51:20,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:20,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-16 14:51:20,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-16 14:51:20,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:20,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 57 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:20,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:20,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129731413] [2025-03-16 14:51:20,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129731413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:20,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869341193] [2025-03-16 14:51:20,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:20,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:20,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:20,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:51:20,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:51:20,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-16 14:51:20,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-16 14:51:20,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:20,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:20,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 14:51:20,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 57 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:20,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:51:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 57 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:22,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869341193] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:51:22,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:51:22,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-03-16 14:51:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091640909] [2025-03-16 14:51:22,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:51:22,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 14:51:22,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:22,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 14:51:22,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:51:22,230 INFO L87 Difference]: Start difference. First operand 14808 states and 16322 transitions. Second operand has 10 states, 10 states have (on average 68.7) internal successors, (687), 9 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:24,895 INFO L93 Difference]: Finished difference Result 32147 states and 35230 transitions. [2025-03-16 14:51:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 14:51:24,896 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 68.7) internal successors, (687), 9 states have internal predecessors, (687), 0 states have call successors, (0), 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 328 [2025-03-16 14:51:24,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:24,925 INFO L225 Difference]: With dead ends: 32147 [2025-03-16 14:51:24,925 INFO L226 Difference]: Without dead ends: 32145 [2025-03-16 14:51:24,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 650 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:51:24,933 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1144 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4290 mSolverCounterSat, 752 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 5042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 752 IncrementalHoareTripleChecker+Valid, 4290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:24,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 226 Invalid, 5042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [752 Valid, 4290 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 14:51:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32145 states. [2025-03-16 14:51:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32145 to 15921. [2025-03-16 14:51:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15921 states, 15920 states have (on average 1.1042713567839195) internal successors, (17580), 15920 states have internal predecessors, (17580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15921 states to 15921 states and 17580 transitions. [2025-03-16 14:51:25,131 INFO L78 Accepts]: Start accepts. Automaton has 15921 states and 17580 transitions. Word has length 328 [2025-03-16 14:51:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:25,131 INFO L471 AbstractCegarLoop]: Abstraction has 15921 states and 17580 transitions. [2025-03-16 14:51:25,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 68.7) internal successors, (687), 9 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 15921 states and 17580 transitions. [2025-03-16 14:51:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-16 14:51:25,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:25,139 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:25,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:51:25,339 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,SelfDestructingSolverStorable17 [2025-03-16 14:51:25,340 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:25,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:25,340 INFO L85 PathProgramCache]: Analyzing trace with hash -920215784, now seen corresponding path program 1 times [2025-03-16 14:51:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:25,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208702695] [2025-03-16 14:51:25,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:25,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:25,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-16 14:51:25,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-16 14:51:25,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:25,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-16 14:51:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:25,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208702695] [2025-03-16 14:51:25,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208702695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:25,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:25,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:25,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115239509] [2025-03-16 14:51:25,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:25,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:25,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:25,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:25,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:25,530 INFO L87 Difference]: Start difference. First operand 15921 states and 17580 transitions. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:26,316 INFO L93 Difference]: Finished difference Result 39585 states and 43624 transitions. [2025-03-16 14:51:26,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:26,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 445 [2025-03-16 14:51:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:26,339 INFO L225 Difference]: With dead ends: 39585 [2025-03-16 14:51:26,339 INFO L226 Difference]: Without dead ends: 22929 [2025-03-16 14:51:26,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:26,351 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 212 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:26,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 80 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:51:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22929 states. [2025-03-16 14:51:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22929 to 21080. [2025-03-16 14:51:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21080 states, 21079 states have (on average 1.1031358223824659) internal successors, (23253), 21079 states have internal predecessors, (23253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21080 states to 21080 states and 23253 transitions. [2025-03-16 14:51:26,554 INFO L78 Accepts]: Start accepts. Automaton has 21080 states and 23253 transitions. Word has length 445 [2025-03-16 14:51:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:26,555 INFO L471 AbstractCegarLoop]: Abstraction has 21080 states and 23253 transitions. [2025-03-16 14:51:26,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 21080 states and 23253 transitions. [2025-03-16 14:51:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-16 14:51:26,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:26,573 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:26,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:51:26,573 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:26,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:26,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1985061972, now seen corresponding path program 1 times [2025-03-16 14:51:26,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:26,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486552404] [2025-03-16 14:51:26,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:26,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:26,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-16 14:51:26,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-16 14:51:26,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:26,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-16 14:51:26,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:26,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486552404] [2025-03-16 14:51:26,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486552404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:26,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:26,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222722427] [2025-03-16 14:51:26,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:26,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:26,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:26,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:26,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:26,932 INFO L87 Difference]: Start difference. First operand 21080 states and 23253 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:27,506 INFO L93 Difference]: Finished difference Result 43449 states and 47816 transitions. [2025-03-16 14:51:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:27,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 446 [2025-03-16 14:51:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:27,527 INFO L225 Difference]: With dead ends: 43449 [2025-03-16 14:51:27,527 INFO L226 Difference]: Without dead ends: 21818 [2025-03-16 14:51:27,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:27,541 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 212 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:27,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 150 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:27,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21818 states. [2025-03-16 14:51:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21818 to 20160. [2025-03-16 14:51:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20160 states, 20159 states have (on average 1.097524678803512) internal successors, (22125), 20159 states have internal predecessors, (22125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20160 states to 20160 states and 22125 transitions. [2025-03-16 14:51:27,738 INFO L78 Accepts]: Start accepts. Automaton has 20160 states and 22125 transitions. Word has length 446 [2025-03-16 14:51:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:27,738 INFO L471 AbstractCegarLoop]: Abstraction has 20160 states and 22125 transitions. [2025-03-16 14:51:27,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 20160 states and 22125 transitions. [2025-03-16 14:51:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-16 14:51:27,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:27,749 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:27,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 14:51:27,749 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:27,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2123679457, now seen corresponding path program 1 times [2025-03-16 14:51:27,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:27,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38657206] [2025-03-16 14:51:27,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:27,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-16 14:51:27,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-16 14:51:27,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:27,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-16 14:51:28,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38657206] [2025-03-16 14:51:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38657206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:28,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:28,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:51:28,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950238066] [2025-03-16 14:51:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:28,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:28,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:28,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:28,394 INFO L87 Difference]: Start difference. First operand 20160 states and 22125 transitions. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:29,171 INFO L93 Difference]: Finished difference Result 44014 states and 48200 transitions. [2025-03-16 14:51:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 495 [2025-03-16 14:51:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:29,195 INFO L225 Difference]: With dead ends: 44014 [2025-03-16 14:51:29,195 INFO L226 Difference]: Without dead ends: 21641 [2025-03-16 14:51:29,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:29,210 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 313 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:29,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 340 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:51:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21641 states. [2025-03-16 14:51:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21641 to 15543. [2025-03-16 14:51:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15543 states, 15542 states have (on average 1.088148243469309) internal successors, (16912), 15542 states have internal predecessors, (16912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15543 states to 15543 states and 16912 transitions. [2025-03-16 14:51:29,362 INFO L78 Accepts]: Start accepts. Automaton has 15543 states and 16912 transitions. Word has length 495 [2025-03-16 14:51:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:29,363 INFO L471 AbstractCegarLoop]: Abstraction has 15543 states and 16912 transitions. [2025-03-16 14:51:29,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 15543 states and 16912 transitions. [2025-03-16 14:51:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-16 14:51:29,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:29,372 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:29,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 14:51:29,372 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:29,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:29,372 INFO L85 PathProgramCache]: Analyzing trace with hash -323306297, now seen corresponding path program 1 times [2025-03-16 14:51:29,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:29,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396104251] [2025-03-16 14:51:29,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:29,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:29,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-16 14:51:29,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-16 14:51:29,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:29,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-16 14:51:29,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:29,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396104251] [2025-03-16 14:51:29,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396104251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:29,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:29,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:29,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611472086] [2025-03-16 14:51:29,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:29,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:29,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:29,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:29,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:29,862 INFO L87 Difference]: Start difference. First operand 15543 states and 16912 transitions. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:30,690 INFO L93 Difference]: Finished difference Result 34959 states and 38071 transitions. [2025-03-16 14:51:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:30,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 516 [2025-03-16 14:51:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:30,711 INFO L225 Difference]: With dead ends: 34959 [2025-03-16 14:51:30,711 INFO L226 Difference]: Without dead ends: 19600 [2025-03-16 14:51:30,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:30,724 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 118 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:30,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 103 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:51:30,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19600 states. [2025-03-16 14:51:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19600 to 18125. [2025-03-16 14:51:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18125 states, 18124 states have (on average 1.0880600308982564) internal successors, (19720), 18124 states have internal predecessors, (19720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18125 states to 18125 states and 19720 transitions. [2025-03-16 14:51:30,875 INFO L78 Accepts]: Start accepts. Automaton has 18125 states and 19720 transitions. Word has length 516 [2025-03-16 14:51:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:30,875 INFO L471 AbstractCegarLoop]: Abstraction has 18125 states and 19720 transitions. [2025-03-16 14:51:30,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 18125 states and 19720 transitions. [2025-03-16 14:51:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-03-16 14:51:30,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:30,883 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:30,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 14:51:30,883 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:30,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1421357455, now seen corresponding path program 1 times [2025-03-16 14:51:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:30,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874393882] [2025-03-16 14:51:30,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:30,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:30,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-16 14:51:30,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-16 14:51:30,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:30,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-16 14:51:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:31,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874393882] [2025-03-16 14:51:31,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874393882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:31,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:31,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:31,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338042829] [2025-03-16 14:51:31,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:31,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:31,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:31,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:31,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:31,084 INFO L87 Difference]: Start difference. First operand 18125 states and 19720 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:31,545 INFO L93 Difference]: Finished difference Result 34955 states and 38009 transitions. [2025-03-16 14:51:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:31,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 523 [2025-03-16 14:51:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:31,560 INFO L225 Difference]: With dead ends: 34955 [2025-03-16 14:51:31,561 INFO L226 Difference]: Without dead ends: 17199 [2025-03-16 14:51:31,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:31,570 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 192 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:31,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 327 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17199 states. [2025-03-16 14:51:31,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17199 to 17015. [2025-03-16 14:51:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17015 states, 17014 states have (on average 1.071999529798989) internal successors, (18239), 17014 states have internal predecessors, (18239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17015 states to 17015 states and 18239 transitions. [2025-03-16 14:51:31,709 INFO L78 Accepts]: Start accepts. Automaton has 17015 states and 18239 transitions. Word has length 523 [2025-03-16 14:51:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:31,709 INFO L471 AbstractCegarLoop]: Abstraction has 17015 states and 18239 transitions. [2025-03-16 14:51:31,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 17015 states and 18239 transitions. [2025-03-16 14:51:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2025-03-16 14:51:31,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:31,717 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:31,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 14:51:31,718 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:31,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:31,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1258108373, now seen corresponding path program 1 times [2025-03-16 14:51:31,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:31,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135125727] [2025-03-16 14:51:31,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:31,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:31,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-03-16 14:51:31,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-03-16 14:51:31,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:31,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 29 proven. 394 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-03-16 14:51:32,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:32,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135125727] [2025-03-16 14:51:32,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135125727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:32,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129524493] [2025-03-16 14:51:32,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:32,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:32,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:32,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:51:32,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:51:32,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-03-16 14:51:32,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-03-16 14:51:32,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:32,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:32,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 14:51:32,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 29 proven. 394 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-03-16 14:51:32,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:51:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 29 proven. 394 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-03-16 14:51:39,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129524493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:51:39,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:51:39,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 11 [2025-03-16 14:51:39,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335990253] [2025-03-16 14:51:39,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:51:39,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 14:51:39,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:39,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 14:51:39,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-16 14:51:39,374 INFO L87 Difference]: Start difference. First operand 17015 states and 18239 transitions. Second operand has 12 states, 12 states have (on average 96.33333333333333) internal successors, (1156), 11 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:42,428 INFO L93 Difference]: Finished difference Result 56908 states and 61331 transitions. [2025-03-16 14:51:42,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 14:51:42,428 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 96.33333333333333) internal successors, (1156), 11 states have internal predecessors, (1156), 0 states have call successors, (0), 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 554 [2025-03-16 14:51:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:42,467 INFO L225 Difference]: With dead ends: 56908 [2025-03-16 14:51:42,467 INFO L226 Difference]: Without dead ends: 39894 [2025-03-16 14:51:42,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1117 GetRequests, 1100 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2025-03-16 14:51:42,484 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1819 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 3920 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 4546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 3920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:42,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 219 Invalid, 4546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 3920 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 14:51:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39894 states. [2025-03-16 14:51:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39894 to 22917. [2025-03-16 14:51:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22917 states, 22916 states have (on average 1.0770640600453831) internal successors, (24682), 22916 states have internal predecessors, (24682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22917 states to 22917 states and 24682 transitions. [2025-03-16 14:51:42,840 INFO L78 Accepts]: Start accepts. Automaton has 22917 states and 24682 transitions. Word has length 554 [2025-03-16 14:51:42,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:42,841 INFO L471 AbstractCegarLoop]: Abstraction has 22917 states and 24682 transitions. [2025-03-16 14:51:42,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 96.33333333333333) internal successors, (1156), 11 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 22917 states and 24682 transitions. [2025-03-16 14:51:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2025-03-16 14:51:42,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:42,854 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:42,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:51:43,055 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,SelfDestructingSolverStorable23 [2025-03-16 14:51:43,055 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:43,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1495054481, now seen corresponding path program 1 times [2025-03-16 14:51:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:43,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231245558] [2025-03-16 14:51:43,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:43,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:43,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-03-16 14:51:43,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-03-16 14:51:43,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:43,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-16 14:51:43,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:43,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231245558] [2025-03-16 14:51:43,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231245558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:43,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:43,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689921843] [2025-03-16 14:51:43,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:43,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:43,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:43,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:43,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:43,263 INFO L87 Difference]: Start difference. First operand 22917 states and 24682 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:43,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:43,721 INFO L93 Difference]: Finished difference Result 47302 states and 50915 transitions. [2025-03-16 14:51:43,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:43,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 637 [2025-03-16 14:51:43,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:43,744 INFO L225 Difference]: With dead ends: 47302 [2025-03-16 14:51:43,744 INFO L226 Difference]: Without dead ends: 24386 [2025-03-16 14:51:43,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:43,758 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 39 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:43,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 127 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24386 states. [2025-03-16 14:51:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24386 to 22173. [2025-03-16 14:51:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22173 states, 22172 states have (on average 1.0762673642431897) internal successors, (23863), 22172 states have internal predecessors, (23863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22173 states to 22173 states and 23863 transitions. [2025-03-16 14:51:43,948 INFO L78 Accepts]: Start accepts. Automaton has 22173 states and 23863 transitions. Word has length 637 [2025-03-16 14:51:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:43,948 INFO L471 AbstractCegarLoop]: Abstraction has 22173 states and 23863 transitions. [2025-03-16 14:51:43,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 22173 states and 23863 transitions. [2025-03-16 14:51:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2025-03-16 14:51:43,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:43,962 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:43,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 14:51:43,962 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:43,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1611650527, now seen corresponding path program 1 times [2025-03-16 14:51:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:43,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193668370] [2025-03-16 14:51:43,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:44,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 856 statements into 1 equivalence classes. [2025-03-16 14:51:44,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 856 of 856 statements. [2025-03-16 14:51:44,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:44,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2307 backedges. 1342 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2025-03-16 14:51:44,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:44,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193668370] [2025-03-16 14:51:44,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193668370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:44,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:44,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:44,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258571256] [2025-03-16 14:51:44,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:44,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:44,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:44,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:44,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:44,487 INFO L87 Difference]: Start difference. First operand 22173 states and 23863 transitions. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:44,981 INFO L93 Difference]: Finished difference Result 38996 states and 41921 transitions. [2025-03-16 14:51:44,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:44,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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 856 [2025-03-16 14:51:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:45,008 INFO L225 Difference]: With dead ends: 38996 [2025-03-16 14:51:45,008 INFO L226 Difference]: Without dead ends: 17191 [2025-03-16 14:51:45,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:45,019 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 74 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:45,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 303 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17191 states. [2025-03-16 14:51:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17191 to 16450. [2025-03-16 14:51:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16450 states, 16449 states have (on average 1.0663262204389325) internal successors, (17540), 16449 states have internal predecessors, (17540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16450 states to 16450 states and 17540 transitions. [2025-03-16 14:51:45,197 INFO L78 Accepts]: Start accepts. Automaton has 16450 states and 17540 transitions. Word has length 856 [2025-03-16 14:51:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:45,198 INFO L471 AbstractCegarLoop]: Abstraction has 16450 states and 17540 transitions. [2025-03-16 14:51:45,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 16450 states and 17540 transitions. [2025-03-16 14:51:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2025-03-16 14:51:45,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:45,220 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:45,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 14:51:45,220 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:45,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1471308722, now seen corresponding path program 1 times [2025-03-16 14:51:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251725951] [2025-03-16 14:51:45,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:45,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 881 statements into 1 equivalence classes. [2025-03-16 14:51:45,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 881 of 881 statements. [2025-03-16 14:51:45,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:45,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2253 backedges. 1516 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2025-03-16 14:51:45,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:45,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251725951] [2025-03-16 14:51:45,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251725951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:45,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:45,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:45,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631126537] [2025-03-16 14:51:45,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:45,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:45,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:45,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:45,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:45,693 INFO L87 Difference]: Start difference. First operand 16450 states and 17540 transitions. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:46,090 INFO L93 Difference]: Finished difference Result 33468 states and 35683 transitions. [2025-03-16 14:51:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:46,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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 881 [2025-03-16 14:51:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:46,107 INFO L225 Difference]: With dead ends: 33468 [2025-03-16 14:51:46,107 INFO L226 Difference]: Without dead ends: 17387 [2025-03-16 14:51:46,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:46,116 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 99 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:46,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 112 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:51:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17387 states. [2025-03-16 14:51:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17387 to 15525. [2025-03-16 14:51:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15525 states, 15524 states have (on average 1.066735377480031) internal successors, (16560), 15524 states have internal predecessors, (16560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15525 states to 15525 states and 16560 transitions. [2025-03-16 14:51:46,289 INFO L78 Accepts]: Start accepts. Automaton has 15525 states and 16560 transitions. Word has length 881 [2025-03-16 14:51:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:46,290 INFO L471 AbstractCegarLoop]: Abstraction has 15525 states and 16560 transitions. [2025-03-16 14:51:46,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 15525 states and 16560 transitions. [2025-03-16 14:51:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 883 [2025-03-16 14:51:46,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:46,303 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:46,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 14:51:46,304 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:46,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -511276827, now seen corresponding path program 1 times [2025-03-16 14:51:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:46,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664131117] [2025-03-16 14:51:46,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:46,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:46,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 882 statements into 1 equivalence classes. [2025-03-16 14:51:46,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 882 of 882 statements. [2025-03-16 14:51:46,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:46,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2251 backedges. 1533 proven. 539 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-16 14:51:47,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664131117] [2025-03-16 14:51:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664131117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581824085] [2025-03-16 14:51:47,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:47,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:47,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:47,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:51:47,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:51:47,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 882 statements into 1 equivalence classes. [2025-03-16 14:51:47,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 882 of 882 statements. [2025-03-16 14:51:47,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:47,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:47,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:51:47,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2251 backedges. 1056 proven. 0 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2025-03-16 14:51:48,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:51:48,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581824085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:48,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:51:48,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-03-16 14:51:48,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711738360] [2025-03-16 14:51:48,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:48,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:48,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:48,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:48,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:51:48,061 INFO L87 Difference]: Start difference. First operand 15525 states and 16560 transitions. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:48,757 INFO L93 Difference]: Finished difference Result 33635 states and 36002 transitions. [2025-03-16 14:51:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:48,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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 882 [2025-03-16 14:51:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:48,776 INFO L225 Difference]: With dead ends: 33635 [2025-03-16 14:51:48,776 INFO L226 Difference]: Without dead ends: 18479 [2025-03-16 14:51:48,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 891 GetRequests, 882 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:51:48,788 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 233 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:48,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 82 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18479 states. [2025-03-16 14:51:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18479 to 16816. [2025-03-16 14:51:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16816 states, 16815 states have (on average 1.063812072554267) internal successors, (17888), 16815 states have internal predecessors, (17888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16816 states to 16816 states and 17888 transitions. [2025-03-16 14:51:48,926 INFO L78 Accepts]: Start accepts. Automaton has 16816 states and 17888 transitions. Word has length 882 [2025-03-16 14:51:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:48,926 INFO L471 AbstractCegarLoop]: Abstraction has 16816 states and 17888 transitions. [2025-03-16 14:51:48,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand 16816 states and 17888 transitions. [2025-03-16 14:51:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 960 [2025-03-16 14:51:48,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:48,940 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:48,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 14:51:49,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:49,141 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:49,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2145074826, now seen corresponding path program 1 times [2025-03-16 14:51:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:49,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205817012] [2025-03-16 14:51:49,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:49,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 959 statements into 1 equivalence classes. [2025-03-16 14:51:49,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 959 of 959 statements. [2025-03-16 14:51:49,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:49,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2837 backedges. 1959 proven. 536 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-16 14:51:50,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:50,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205817012] [2025-03-16 14:51:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205817012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:50,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514428457] [2025-03-16 14:51:50,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:50,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:50,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:50,533 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:51:50,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:51:50,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 959 statements into 1 equivalence classes. [2025-03-16 14:51:50,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 959 of 959 statements. [2025-03-16 14:51:50,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:50,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:50,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:51:50,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2837 backedges. 1924 proven. 0 refuted. 0 times theorem prover too weak. 913 trivial. 0 not checked. [2025-03-16 14:51:50,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:51:50,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514428457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:50,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:51:50,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-03-16 14:51:50,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028645908] [2025-03-16 14:51:50,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:50,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:50,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:50,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:50,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:51:50,958 INFO L87 Difference]: Start difference. First operand 16816 states and 17888 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:51,414 INFO L93 Difference]: Finished difference Result 37688 states and 40137 transitions. [2025-03-16 14:51:51,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:51,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 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 959 [2025-03-16 14:51:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:51,438 INFO L225 Difference]: With dead ends: 37688 [2025-03-16 14:51:51,438 INFO L226 Difference]: Without dead ends: 21241 [2025-03-16 14:51:51,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 968 GetRequests, 960 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:51:51,450 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 70 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:51,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 299 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21241 states. [2025-03-16 14:51:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21241 to 17008. [2025-03-16 14:51:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17008 states, 17007 states have (on average 1.062150879049803) internal successors, (18064), 17007 states have internal predecessors, (18064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17008 states to 17008 states and 18064 transitions. [2025-03-16 14:51:51,614 INFO L78 Accepts]: Start accepts. Automaton has 17008 states and 18064 transitions. Word has length 959 [2025-03-16 14:51:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:51,614 INFO L471 AbstractCegarLoop]: Abstraction has 17008 states and 18064 transitions. [2025-03-16 14:51:51,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 17008 states and 18064 transitions. [2025-03-16 14:51:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 966 [2025-03-16 14:51:51,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:51,628 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:51,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 14:51:51,828 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,SelfDestructingSolverStorable28 [2025-03-16 14:51:51,829 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:51,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:51,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1801541451, now seen corresponding path program 1 times [2025-03-16 14:51:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:51,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411584337] [2025-03-16 14:51:51,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:51,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 965 statements into 1 equivalence classes. [2025-03-16 14:51:51,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 965 of 965 statements. [2025-03-16 14:51:51,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:51,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 1707 proven. 232 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2025-03-16 14:51:52,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:52,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411584337] [2025-03-16 14:51:52,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411584337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:52,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915647982] [2025-03-16 14:51:52,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:52,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:52,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:52,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:51:52,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:51:53,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 965 statements into 1 equivalence classes. [2025-03-16 14:51:53,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 965 of 965 statements. [2025-03-16 14:51:53,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:53,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:53,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 14:51:53,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 1627 proven. 434 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-16 14:51:53,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:51:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 2061 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-16 14:51:54,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915647982] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:54,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:51:54,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 13 [2025-03-16 14:51:54,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659767550] [2025-03-16 14:51:54,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:54,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:51:54,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:54,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:51:54,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-16 14:51:54,005 INFO L87 Difference]: Start difference. First operand 17008 states and 18064 transitions. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:54,757 INFO L93 Difference]: Finished difference Result 40095 states and 42642 transitions. [2025-03-16 14:51:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:54,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 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 965 [2025-03-16 14:51:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:54,787 INFO L225 Difference]: With dead ends: 40095 [2025-03-16 14:51:54,787 INFO L226 Difference]: Without dead ends: 23272 [2025-03-16 14:51:54,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1936 GetRequests, 1924 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-16 14:51:54,800 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 145 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:54,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 72 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23272 states. [2025-03-16 14:51:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23272 to 21062. [2025-03-16 14:51:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21062 states, 21061 states have (on average 1.0649066995869143) internal successors, (22428), 21061 states have internal predecessors, (22428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21062 states to 21062 states and 22428 transitions. [2025-03-16 14:51:55,017 INFO L78 Accepts]: Start accepts. Automaton has 21062 states and 22428 transitions. Word has length 965 [2025-03-16 14:51:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:55,017 INFO L471 AbstractCegarLoop]: Abstraction has 21062 states and 22428 transitions. [2025-03-16 14:51:55,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 21062 states and 22428 transitions. [2025-03-16 14:51:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2025-03-16 14:51:55,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:55,034 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:55,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 14:51:55,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:55,234 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:55,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1726011817, now seen corresponding path program 1 times [2025-03-16 14:51:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:55,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960532161] [2025-03-16 14:51:55,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:55,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:55,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-03-16 14:51:55,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-03-16 14:51:55,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:55,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3450 backedges. 2224 proven. 783 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2025-03-16 14:51:56,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:56,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960532161] [2025-03-16 14:51:56,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960532161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:56,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626497522] [2025-03-16 14:51:56,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:56,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:56,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:56,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:51:56,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 14:51:56,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-03-16 14:51:57,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-03-16 14:51:57,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:57,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:57,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 14:51:57,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3450 backedges. 2063 proven. 221 refuted. 0 times theorem prover too weak. 1166 trivial. 0 not checked. [2025-03-16 14:51:57,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:51:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3450 backedges. 1928 proven. 192 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2025-03-16 14:51:58,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626497522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:51:58,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:51:58,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 16 [2025-03-16 14:51:58,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903890089] [2025-03-16 14:51:58,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:51:58,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 14:51:58,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:58,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 14:51:58,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-16 14:51:58,873 INFO L87 Difference]: Start difference. First operand 21062 states and 22428 transitions. Second operand has 16 states, 16 states have (on average 103.25) internal successors, (1652), 16 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:04,275 INFO L93 Difference]: Finished difference Result 53351 states and 56804 transitions. [2025-03-16 14:52:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 14:52:04,276 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 103.25) internal successors, (1652), 16 states have internal predecessors, (1652), 0 states have call successors, (0), 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 1077 [2025-03-16 14:52:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:04,277 INFO L225 Difference]: With dead ends: 53351 [2025-03-16 14:52:04,277 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:52:04,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2194 GetRequests, 2164 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2025-03-16 14:52:04,294 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1711 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 13882 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1711 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 14207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 13882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:04,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1711 Valid, 297 Invalid, 14207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 13882 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-16 14:52:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:52:04,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:52:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:52:04,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1077 [2025-03-16 14:52:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:04,295 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:52:04,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 103.25) internal successors, (1652), 16 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:52:04,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:52:04,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:52:04,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 14:52:04,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:04,503 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:04,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.