./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2001.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.sw_ball2001.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 65758d30abe63111d5fe7d6f3755a15e393bf1c256a01ab73d247ce5927c073a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:36:33,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:36:33,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:36:33,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:36:33,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:36:33,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:36:33,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:36:33,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:36:33,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:36:33,652 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:36:33,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:36:33,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:36:33,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:36:33,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:36:33,653 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:36:33,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:36:33,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:36:33,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:36:33,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:36:33,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:36:33,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:36:33,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:36:33,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:36:33,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:36:33,655 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:36:33,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:36:33,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:36:33,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:36:33,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:36:33,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:36:33,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:36:33,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:36:33,656 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:36:33,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:36:33,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:36:33,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:36:33,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:36:33,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:36:33,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:36:33,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:36:33,656 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65758d30abe63111d5fe7d6f3755a15e393bf1c256a01ab73d247ce5927c073a [2025-03-16 22:36:33,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:36:33,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:36:33,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:36:33,862 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:36:33,863 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:36:33,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2001.c [2025-03-16 22:36:34,975 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8764fea70/7e0ac840d605458a8d415f6a4e299c70/FLAG3578be2d9 [2025-03-16 22:36:35,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:36:35,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2001.c [2025-03-16 22:36:35,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8764fea70/7e0ac840d605458a8d415f6a4e299c70/FLAG3578be2d9 [2025-03-16 22:36:35,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8764fea70/7e0ac840d605458a8d415f6a4e299c70 [2025-03-16 22:36:35,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:36:35,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:36:35,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:36:35,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:36:35,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:36:35,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b837b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35, skipping insertion in model container [2025-03-16 22:36:35,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:36:35,380 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/hardware-verification-bv/btor2c-lazyMod.sw_ball2001.c[1251,1264] [2025-03-16 22:36:35,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:36:35,502 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:36:35,508 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/hardware-verification-bv/btor2c-lazyMod.sw_ball2001.c[1251,1264] [2025-03-16 22:36:35,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:36:35,592 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:36:35,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35 WrapperNode [2025-03-16 22:36:35,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:36:35,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:36:35,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:36:35,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:36:35,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,737 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1563 [2025-03-16 22:36:35,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:36:35,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:36:35,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:36:35,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:36:35,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,853 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 22:36:35,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:36:35,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:36:35,934 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:36:35,934 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:36:35,935 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (1/1) ... [2025-03-16 22:36:35,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:36:35,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:36:35,961 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 22:36:35,966 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 22:36:35,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:36:35,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:36:35,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:36:35,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:36:36,144 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:36:36,145 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:36:37,405 INFO L? ?]: Removed 992 outVars from TransFormulas that were not future-live. [2025-03-16 22:36:37,406 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:36:37,484 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:36:37,487 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:36:37,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:36:37 BoogieIcfgContainer [2025-03-16 22:36:37,488 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:36:37,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:36:37,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:36:37,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:36:37,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:36:35" (1/3) ... [2025-03-16 22:36:37,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8502d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:36:37, skipping insertion in model container [2025-03-16 22:36:37,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:35" (2/3) ... [2025-03-16 22:36:37,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8502d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:36:37, skipping insertion in model container [2025-03-16 22:36:37,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:36:37" (3/3) ... [2025-03-16 22:36:37,496 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_ball2001.c [2025-03-16 22:36:37,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:36:37,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_ball2001.c that has 1 procedures, 464 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:36:37,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:36:37,571 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;@1217a13b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:36:37,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:36:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 464 states, 462 states have (on average 1.5) internal successors, (693), 463 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 22:36:37,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:37,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:37,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:37,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1997752567, now seen corresponding path program 1 times [2025-03-16 22:36:37,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:37,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228230206] [2025-03-16 22:36:37,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:37,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:37,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 22:36:37,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 22:36:37,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:37,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:38,035 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 22:36:38,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:38,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228230206] [2025-03-16 22:36:38,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228230206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:38,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:38,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:38,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94281912] [2025-03-16 22:36:38,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:38,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:36:38,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:38,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:36:38,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:36:38,056 INFO L87 Difference]: Start difference. First operand has 464 states, 462 states have (on average 1.5) internal successors, (693), 463 states have internal predecessors, (693), 0 states have call successors, (0), 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 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:38,334 INFO L93 Difference]: Finished difference Result 871 states and 1303 transitions. [2025-03-16 22:36:38,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:36:38,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 22:36:38,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:38,343 INFO L225 Difference]: With dead ends: 871 [2025-03-16 22:36:38,344 INFO L226 Difference]: Without dead ends: 464 [2025-03-16 22:36:38,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:36:38,350 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 0 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:38,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1717 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:36:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-16 22:36:38,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-03-16 22:36:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.4946004319654427) internal successors, (692), 463 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 692 transitions. [2025-03-16 22:36:38,400 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 692 transitions. Word has length 36 [2025-03-16 22:36:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:38,400 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 692 transitions. [2025-03-16 22:36:38,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 692 transitions. [2025-03-16 22:36:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 22:36:38,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:38,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:38,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:36:38,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:38,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:38,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1796107604, now seen corresponding path program 1 times [2025-03-16 22:36:38,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:38,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925028027] [2025-03-16 22:36:38,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:38,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 22:36:38,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 22:36:38,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:38,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:38,554 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 22:36:38,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:38,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925028027] [2025-03-16 22:36:38,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925028027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:38,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:38,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:38,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125021362] [2025-03-16 22:36:38,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:38,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:36:38,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:38,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:36:38,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:36:38,557 INFO L87 Difference]: Start difference. First operand 464 states and 692 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:38,772 INFO L93 Difference]: Finished difference Result 873 states and 1302 transitions. [2025-03-16 22:36:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:36:38,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-16 22:36:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:38,776 INFO L225 Difference]: With dead ends: 873 [2025-03-16 22:36:38,776 INFO L226 Difference]: Without dead ends: 466 [2025-03-16 22:36:38,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:36:38,779 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 0 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:38,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1714 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:36:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-16 22:36:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2025-03-16 22:36:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 1.4924731182795699) internal successors, (694), 465 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 694 transitions. [2025-03-16 22:36:38,793 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 694 transitions. Word has length 37 [2025-03-16 22:36:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:38,794 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 694 transitions. [2025-03-16 22:36:38,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 694 transitions. [2025-03-16 22:36:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 22:36:38,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:38,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:38,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:36:38,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:38,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:38,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2086749028, now seen corresponding path program 1 times [2025-03-16 22:36:38,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:38,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030854731] [2025-03-16 22:36:38,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:38,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 22:36:38,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 22:36:38,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:38,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:38,941 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 22:36:38,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:38,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030854731] [2025-03-16 22:36:38,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030854731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:38,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:38,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:38,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058929764] [2025-03-16 22:36:38,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:38,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:38,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:38,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:38,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:38,942 INFO L87 Difference]: Start difference. First operand 466 states and 694 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:39,275 INFO L93 Difference]: Finished difference Result 1250 states and 1863 transitions. [2025-03-16 22:36:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:39,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-16 22:36:39,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:39,278 INFO L225 Difference]: With dead ends: 1250 [2025-03-16 22:36:39,280 INFO L226 Difference]: Without dead ends: 841 [2025-03-16 22:36:39,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:39,281 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 1779 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:39,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1779 Valid, 1680 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-16 22:36:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 468. [2025-03-16 22:36:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.4903640256959314) internal successors, (696), 467 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 696 transitions. [2025-03-16 22:36:39,290 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 696 transitions. Word has length 38 [2025-03-16 22:36:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:39,291 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 696 transitions. [2025-03-16 22:36:39,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 696 transitions. [2025-03-16 22:36:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-16 22:36:39,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:39,298 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:39,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:36:39,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:39,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash -684231082, now seen corresponding path program 1 times [2025-03-16 22:36:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:39,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050449916] [2025-03-16 22:36:39,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:39,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-16 22:36:39,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-16 22:36:39,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:39,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:40,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:40,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050449916] [2025-03-16 22:36:40,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050449916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:40,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:40,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:36:40,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646541563] [2025-03-16 22:36:40,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:40,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:36:40,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:40,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:36:40,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:36:40,533 INFO L87 Difference]: Start difference. First operand 468 states and 696 transitions. Second operand has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 5 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:40,892 INFO L93 Difference]: Finished difference Result 1273 states and 1897 transitions. [2025-03-16 22:36:40,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:36:40,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 5 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2025-03-16 22:36:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:40,896 INFO L225 Difference]: With dead ends: 1273 [2025-03-16 22:36:40,896 INFO L226 Difference]: Without dead ends: 864 [2025-03-16 22:36:40,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:36:40,900 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 1832 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:40,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 2151 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:40,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-16 22:36:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 489. [2025-03-16 22:36:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.4836065573770492) internal successors, (724), 488 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 724 transitions. [2025-03-16 22:36:40,917 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 724 transitions. Word has length 241 [2025-03-16 22:36:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:40,918 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 724 transitions. [2025-03-16 22:36:40,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 5 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:40,918 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 724 transitions. [2025-03-16 22:36:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-16 22:36:40,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:40,926 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:40,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:36:40,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:40,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1666872201, now seen corresponding path program 1 times [2025-03-16 22:36:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:40,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614927702] [2025-03-16 22:36:40,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:40,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:40,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-16 22:36:41,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-16 22:36:41,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:41,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:42,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:42,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614927702] [2025-03-16 22:36:42,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614927702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:42,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:42,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522553032] [2025-03-16 22:36:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:42,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:42,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:42,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:42,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:42,324 INFO L87 Difference]: Start difference. First operand 489 states and 724 transitions. Second operand has 5 states, 5 states have (on average 48.4) 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 22:36:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:42,652 INFO L93 Difference]: Finished difference Result 1269 states and 1889 transitions. [2025-03-16 22:36:42,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:42,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.4) 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 22:36:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:42,655 INFO L225 Difference]: With dead ends: 1269 [2025-03-16 22:36:42,655 INFO L226 Difference]: Without dead ends: 860 [2025-03-16 22:36:42,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:42,657 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1788 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1788 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:42,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1788 Valid, 1669 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2025-03-16 22:36:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 538. [2025-03-16 22:36:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.4823091247672253) internal successors, (796), 537 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 796 transitions. [2025-03-16 22:36:42,668 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 796 transitions. Word has length 242 [2025-03-16 22:36:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:42,668 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 796 transitions. [2025-03-16 22:36:42,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.4) 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 22:36:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 796 transitions. [2025-03-16 22:36:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-16 22:36:42,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:42,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:42,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:36:42,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:42,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:42,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1102464842, now seen corresponding path program 1 times [2025-03-16 22:36:42,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:42,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865501258] [2025-03-16 22:36:42,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:42,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:42,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-16 22:36:43,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-16 22:36:43,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:43,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:43,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:43,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865501258] [2025-03-16 22:36:43,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865501258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:43,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:43,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:43,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051611066] [2025-03-16 22:36:43,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:43,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:43,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:43,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:43,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:43,774 INFO L87 Difference]: Start difference. First operand 538 states and 796 transitions. Second operand has 5 states, 5 states have (on average 48.8) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:44,094 INFO L93 Difference]: Finished difference Result 1269 states and 1887 transitions. [2025-03-16 22:36:44,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:44,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2025-03-16 22:36:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:44,097 INFO L225 Difference]: With dead ends: 1269 [2025-03-16 22:36:44,097 INFO L226 Difference]: Without dead ends: 860 [2025-03-16 22:36:44,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:44,098 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1750 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:44,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 1668 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2025-03-16 22:36:44,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 605. [2025-03-16 22:36:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 1.4817880794701987) internal successors, (895), 604 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 895 transitions. [2025-03-16 22:36:44,115 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 895 transitions. Word has length 244 [2025-03-16 22:36:44,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:44,115 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 895 transitions. [2025-03-16 22:36:44,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 895 transitions. [2025-03-16 22:36:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-16 22:36:44,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:44,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:44,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:36:44,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:44,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:44,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1405942495, now seen corresponding path program 1 times [2025-03-16 22:36:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:44,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527612650] [2025-03-16 22:36:44,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:44,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:44,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-16 22:36:44,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-16 22:36:44,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:44,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:44,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:44,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527612650] [2025-03-16 22:36:44,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527612650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:44,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:44,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:44,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936472573] [2025-03-16 22:36:44,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:44,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:44,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:44,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:44,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:44,918 INFO L87 Difference]: Start difference. First operand 605 states and 895 transitions. Second operand has 5 states, 5 states have (on average 49.0) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:45,255 INFO L93 Difference]: Finished difference Result 1269 states and 1886 transitions. [2025-03-16 22:36:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:45,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 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 245 [2025-03-16 22:36:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:45,259 INFO L225 Difference]: With dead ends: 1269 [2025-03-16 22:36:45,259 INFO L226 Difference]: Without dead ends: 860 [2025-03-16 22:36:45,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:45,260 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1729 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:45,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 1668 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2025-03-16 22:36:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 641. [2025-03-16 22:36:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 1.48125) internal successors, (948), 640 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 948 transitions. [2025-03-16 22:36:45,273 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 948 transitions. Word has length 245 [2025-03-16 22:36:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:45,273 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 948 transitions. [2025-03-16 22:36:45,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 948 transitions. [2025-03-16 22:36:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-16 22:36:45,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:45,275 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:45,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:36:45,275 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:45,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:45,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1238098327, now seen corresponding path program 1 times [2025-03-16 22:36:45,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:45,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562910036] [2025-03-16 22:36:45,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:45,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 22:36:45,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 22:36:45,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:45,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:46,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:46,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562910036] [2025-03-16 22:36:46,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562910036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:46,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:46,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:36:46,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511716665] [2025-03-16 22:36:46,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:46,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:36:46,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:46,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:36:46,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:46,168 INFO L87 Difference]: Start difference. First operand 641 states and 948 transitions. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:46,566 INFO L93 Difference]: Finished difference Result 1273 states and 1891 transitions. [2025-03-16 22:36:46,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:36:46,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2025-03-16 22:36:46,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:46,569 INFO L225 Difference]: With dead ends: 1273 [2025-03-16 22:36:46,569 INFO L226 Difference]: Without dead ends: 864 [2025-03-16 22:36:46,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:36:46,570 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1737 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:46,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 2594 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-16 22:36:46,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 644. [2025-03-16 22:36:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.4805598755832037) internal successors, (952), 643 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 952 transitions. [2025-03-16 22:36:46,583 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 952 transitions. Word has length 246 [2025-03-16 22:36:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:46,583 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 952 transitions. [2025-03-16 22:36:46,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 952 transitions. [2025-03-16 22:36:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-16 22:36:46,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:46,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:46,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:36:46,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:46,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:46,590 INFO L85 PathProgramCache]: Analyzing trace with hash -361215130, now seen corresponding path program 1 times [2025-03-16 22:36:46,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:46,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017146262] [2025-03-16 22:36:46,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:46,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:46,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-16 22:36:46,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-16 22:36:46,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:46,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:47,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:47,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017146262] [2025-03-16 22:36:47,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017146262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:47,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:47,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089622110] [2025-03-16 22:36:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:47,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:47,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:47,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:47,437 INFO L87 Difference]: Start difference. First operand 644 states and 952 transitions. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:47,751 INFO L93 Difference]: Finished difference Result 1271 states and 1887 transitions. [2025-03-16 22:36:47,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:47,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2025-03-16 22:36:47,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:47,754 INFO L225 Difference]: With dead ends: 1271 [2025-03-16 22:36:47,754 INFO L226 Difference]: Without dead ends: 862 [2025-03-16 22:36:47,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:47,755 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1689 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:47,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 1668 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-03-16 22:36:47,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 715. [2025-03-16 22:36:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.4803921568627452) internal successors, (1057), 714 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1057 transitions. [2025-03-16 22:36:47,766 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1057 transitions. Word has length 247 [2025-03-16 22:36:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:47,766 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1057 transitions. [2025-03-16 22:36:47,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1057 transitions. [2025-03-16 22:36:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-16 22:36:47,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:47,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:47,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:36:47,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:47,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1758411124, now seen corresponding path program 1 times [2025-03-16 22:36:47,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:47,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742343914] [2025-03-16 22:36:47,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:47,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-16 22:36:48,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-16 22:36:48,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:48,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:48,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:48,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:48,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742343914] [2025-03-16 22:36:48,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742343914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:48,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:48,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:48,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432911353] [2025-03-16 22:36:48,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:48,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:48,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:48,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:48,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:48,557 INFO L87 Difference]: Start difference. First operand 715 states and 1057 transitions. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:48,866 INFO L93 Difference]: Finished difference Result 1305 states and 1936 transitions. [2025-03-16 22:36:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2025-03-16 22:36:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:48,870 INFO L225 Difference]: With dead ends: 1305 [2025-03-16 22:36:48,870 INFO L226 Difference]: Without dead ends: 862 [2025-03-16 22:36:48,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:48,871 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1705 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:48,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 1668 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-03-16 22:36:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 715. [2025-03-16 22:36:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.4789915966386555) internal successors, (1056), 714 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1056 transitions. [2025-03-16 22:36:48,883 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1056 transitions. Word has length 248 [2025-03-16 22:36:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:48,883 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1056 transitions. [2025-03-16 22:36:48,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1056 transitions. [2025-03-16 22:36:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-16 22:36:48,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:48,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:48,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:36:48,885 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:48,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:48,886 INFO L85 PathProgramCache]: Analyzing trace with hash 199820403, now seen corresponding path program 1 times [2025-03-16 22:36:48,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:48,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364462937] [2025-03-16 22:36:48,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:48,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:48,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-16 22:36:49,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-16 22:36:49,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:49,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:49,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:49,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364462937] [2025-03-16 22:36:49,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364462937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:49,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:49,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:36:49,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148249095] [2025-03-16 22:36:49,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:49,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:36:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:49,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:36:49,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:49,651 INFO L87 Difference]: Start difference. First operand 715 states and 1056 transitions. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:50,054 INFO L93 Difference]: Finished difference Result 1305 states and 1935 transitions. [2025-03-16 22:36:50,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:36:50,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 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 22:36:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:50,057 INFO L225 Difference]: With dead ends: 1305 [2025-03-16 22:36:50,057 INFO L226 Difference]: Without dead ends: 866 [2025-03-16 22:36:50,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:36:50,058 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1713 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:50,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 2590 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-16 22:36:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 717. [2025-03-16 22:36:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.4776536312849162) internal successors, (1058), 716 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1058 transitions. [2025-03-16 22:36:50,071 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1058 transitions. Word has length 249 [2025-03-16 22:36:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:50,072 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1058 transitions. [2025-03-16 22:36:50,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1058 transitions. [2025-03-16 22:36:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-16 22:36:50,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:50,074 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:50,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:36:50,074 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:50,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:50,076 INFO L85 PathProgramCache]: Analyzing trace with hash 946363719, now seen corresponding path program 1 times [2025-03-16 22:36:50,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:50,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520882765] [2025-03-16 22:36:50,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:50,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:50,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-16 22:36:50,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-16 22:36:50,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:50,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:50,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:50,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520882765] [2025-03-16 22:36:50,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520882765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:50,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:50,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:36:50,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235213047] [2025-03-16 22:36:50,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:50,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:36:50,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:50,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:36:50,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:50,953 INFO L87 Difference]: Start difference. First operand 717 states and 1058 transitions. Second operand has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 6 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:51,357 INFO L93 Difference]: Finished difference Result 1307 states and 1937 transitions. [2025-03-16 22:36:51,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:36:51,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 6 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2025-03-16 22:36:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:51,361 INFO L225 Difference]: With dead ends: 1307 [2025-03-16 22:36:51,361 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 22:36:51,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:36:51,362 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1721 mSDsluCounter, 2220 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 2777 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:51,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 2777 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:36:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 22:36:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 719. [2025-03-16 22:36:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 718 states have (on average 1.4763231197771587) internal successors, (1060), 718 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1060 transitions. [2025-03-16 22:36:51,374 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1060 transitions. Word has length 250 [2025-03-16 22:36:51,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:51,374 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1060 transitions. [2025-03-16 22:36:51,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 6 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1060 transitions. [2025-03-16 22:36:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-16 22:36:51,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:51,376 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:51,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:36:51,376 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:51,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1151409727, now seen corresponding path program 1 times [2025-03-16 22:36:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71428542] [2025-03-16 22:36:51,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:51,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-16 22:36:51,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-16 22:36:51,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:51,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:52,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:52,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71428542] [2025-03-16 22:36:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71428542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:52,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:52,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:52,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294105536] [2025-03-16 22:36:52,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:52,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:52,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:52,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:52,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:52,145 INFO L87 Difference]: Start difference. First operand 719 states and 1060 transitions. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:52,463 INFO L93 Difference]: Finished difference Result 1275 states and 1889 transitions. [2025-03-16 22:36:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:52,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2025-03-16 22:36:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:52,468 INFO L225 Difference]: With dead ends: 1275 [2025-03-16 22:36:52,468 INFO L226 Difference]: Without dead ends: 866 [2025-03-16 22:36:52,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:52,469 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1664 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:52,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1664 Valid, 1668 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-16 22:36:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 755. [2025-03-16 22:36:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 754 states have (on average 1.476127320954907) internal successors, (1113), 754 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1113 transitions. [2025-03-16 22:36:52,481 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1113 transitions. Word has length 250 [2025-03-16 22:36:52,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:52,481 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1113 transitions. [2025-03-16 22:36:52,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1113 transitions. [2025-03-16 22:36:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-16 22:36:52,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:52,484 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:52,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:36:52,484 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:52,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1080041150, now seen corresponding path program 1 times [2025-03-16 22:36:52,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:52,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636007235] [2025-03-16 22:36:52,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:52,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:52,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-16 22:36:52,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-16 22:36:52,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:52,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:53,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:53,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636007235] [2025-03-16 22:36:53,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636007235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:53,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:53,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:36:53,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714593528] [2025-03-16 22:36:53,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:53,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:36:53,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:53,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:36:53,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:53,359 INFO L87 Difference]: Start difference. First operand 755 states and 1113 transitions. Second operand has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 6 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:53,764 INFO L93 Difference]: Finished difference Result 1279 states and 1894 transitions. [2025-03-16 22:36:53,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:36:53,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 6 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2025-03-16 22:36:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:53,767 INFO L225 Difference]: With dead ends: 1279 [2025-03-16 22:36:53,767 INFO L226 Difference]: Without dead ends: 870 [2025-03-16 22:36:53,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:36:53,769 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1672 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:53,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1672 Valid, 2588 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:36:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-16 22:36:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 758. [2025-03-16 22:36:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 1.47556142668428) internal successors, (1117), 757 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1117 transitions. [2025-03-16 22:36:53,781 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1117 transitions. Word has length 251 [2025-03-16 22:36:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:53,782 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1117 transitions. [2025-03-16 22:36:53,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 6 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1117 transitions. [2025-03-16 22:36:53,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-16 22:36:53,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:53,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:53,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 22:36:53,784 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:53,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1701301057, now seen corresponding path program 1 times [2025-03-16 22:36:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:53,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792758105] [2025-03-16 22:36:53,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:53,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-16 22:36:54,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-16 22:36:54,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:54,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:54,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:54,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792758105] [2025-03-16 22:36:54,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792758105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:54,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:54,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:36:54,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187239674] [2025-03-16 22:36:54,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:54,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:36:54,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:54,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:36:54,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:54,594 INFO L87 Difference]: Start difference. First operand 758 states and 1117 transitions. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:54,971 INFO L93 Difference]: Finished difference Result 1314 states and 1944 transitions. [2025-03-16 22:36:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:36:54,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-03-16 22:36:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:54,973 INFO L225 Difference]: With dead ends: 1314 [2025-03-16 22:36:54,973 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 22:36:54,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:36:54,974 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1691 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:54,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 2680 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 22:36:54,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 760. [2025-03-16 22:36:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 1.4743083003952568) internal successors, (1119), 759 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1119 transitions. [2025-03-16 22:36:54,983 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1119 transitions. Word has length 252 [2025-03-16 22:36:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:54,983 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1119 transitions. [2025-03-16 22:36:54,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1119 transitions. [2025-03-16 22:36:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-16 22:36:54,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:54,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:54,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 22:36:54,985 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:54,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:54,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2072689032, now seen corresponding path program 1 times [2025-03-16 22:36:54,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:54,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793515879] [2025-03-16 22:36:54,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:54,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:55,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 22:36:55,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 22:36:55,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:55,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:55,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:55,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793515879] [2025-03-16 22:36:55,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793515879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:55,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:55,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:55,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613676581] [2025-03-16 22:36:55,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:55,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:55,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:55,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:55,887 INFO L87 Difference]: Start difference. First operand 760 states and 1119 transitions. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:56,137 INFO L93 Difference]: Finished difference Result 1279 states and 1892 transitions. [2025-03-16 22:36:56,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:56,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2025-03-16 22:36:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:56,140 INFO L225 Difference]: With dead ends: 1279 [2025-03-16 22:36:56,140 INFO L226 Difference]: Without dead ends: 870 [2025-03-16 22:36:56,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:56,141 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1641 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:56,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1641 Valid, 1668 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:36:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-16 22:36:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 795. [2025-03-16 22:36:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.473551637279597) internal successors, (1170), 794 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1170 transitions. [2025-03-16 22:36:56,150 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1170 transitions. Word has length 253 [2025-03-16 22:36:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:56,151 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1170 transitions. [2025-03-16 22:36:56,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1170 transitions. [2025-03-16 22:36:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-16 22:36:56,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:56,152 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:56,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 22:36:56,152 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:56,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash 721404996, now seen corresponding path program 1 times [2025-03-16 22:36:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:56,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509947310] [2025-03-16 22:36:56,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:56,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:56,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-16 22:36:56,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-16 22:36:56,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:56,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:57,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:57,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509947310] [2025-03-16 22:36:57,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509947310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:57,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:57,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:36:57,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194548665] [2025-03-16 22:36:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:57,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:36:57,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:57,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:36:57,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:57,029 INFO L87 Difference]: Start difference. First operand 795 states and 1170 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:57,364 INFO L93 Difference]: Finished difference Result 1283 states and 1897 transitions. [2025-03-16 22:36:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:36:57,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2025-03-16 22:36:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:57,366 INFO L225 Difference]: With dead ends: 1283 [2025-03-16 22:36:57,366 INFO L226 Difference]: Without dead ends: 874 [2025-03-16 22:36:57,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:36:57,367 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1648 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:57,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 2679 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-16 22:36:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 798. [2025-03-16 22:36:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 1.4730238393977415) internal successors, (1174), 797 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1174 transitions. [2025-03-16 22:36:57,375 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1174 transitions. Word has length 254 [2025-03-16 22:36:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:57,376 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1174 transitions. [2025-03-16 22:36:57,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1174 transitions. [2025-03-16 22:36:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-16 22:36:57,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:57,377 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:57,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 22:36:57,377 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:57,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:57,378 INFO L85 PathProgramCache]: Analyzing trace with hash 445738180, now seen corresponding path program 1 times [2025-03-16 22:36:57,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:57,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062023210] [2025-03-16 22:36:57,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:57,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:57,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-16 22:36:57,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-16 22:36:57,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:57,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:58,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062023210] [2025-03-16 22:36:58,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062023210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:58,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:58,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:58,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095421243] [2025-03-16 22:36:58,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:58,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:58,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:58,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:58,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:58,156 INFO L87 Difference]: Start difference. First operand 798 states and 1174 transitions. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:58,385 INFO L93 Difference]: Finished difference Result 1281 states and 1893 transitions. [2025-03-16 22:36:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:58,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2025-03-16 22:36:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:58,387 INFO L225 Difference]: With dead ends: 1281 [2025-03-16 22:36:58,387 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 22:36:58,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:58,388 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1619 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:58,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 1668 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:36:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 22:36:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 833. [2025-03-16 22:36:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 1.4723557692307692) internal successors, (1225), 832 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1225 transitions. [2025-03-16 22:36:58,396 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1225 transitions. Word has length 255 [2025-03-16 22:36:58,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:58,396 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1225 transitions. [2025-03-16 22:36:58,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1225 transitions. [2025-03-16 22:36:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 22:36:58,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:58,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:58,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 22:36:58,398 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:58,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:58,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1419718197, now seen corresponding path program 1 times [2025-03-16 22:36:58,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:58,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142547752] [2025-03-16 22:36:58,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:58,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:58,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 22:36:58,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 22:36:58,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:58,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:59,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:59,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142547752] [2025-03-16 22:36:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142547752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:59,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:59,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:36:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241020330] [2025-03-16 22:36:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:59,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:36:59,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:59,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:36:59,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:59,270 INFO L87 Difference]: Start difference. First operand 833 states and 1225 transitions. Second operand has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 6 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:59,562 INFO L93 Difference]: Finished difference Result 1285 states and 1898 transitions. [2025-03-16 22:36:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:36:59,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 6 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-03-16 22:36:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:59,565 INFO L225 Difference]: With dead ends: 1285 [2025-03-16 22:36:59,565 INFO L226 Difference]: Without dead ends: 876 [2025-03-16 22:36:59,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:36:59,566 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1627 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:59,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 2584 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-03-16 22:36:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 836. [2025-03-16 22:36:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 1.4718562874251497) internal successors, (1229), 835 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1229 transitions. [2025-03-16 22:36:59,574 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1229 transitions. Word has length 256 [2025-03-16 22:36:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:59,574 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1229 transitions. [2025-03-16 22:36:59,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 6 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1229 transitions. [2025-03-16 22:36:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-16 22:36:59,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:59,575 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:59,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 22:36:59,575 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:59,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:59,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1145842007, now seen corresponding path program 1 times [2025-03-16 22:36:59,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:59,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838961175] [2025-03-16 22:36:59,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:59,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:59,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-16 22:37:00,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-16 22:37:00,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:00,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:00,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:00,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838961175] [2025-03-16 22:37:00,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838961175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:00,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:00,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:37:00,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63457544] [2025-03-16 22:37:00,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:00,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:37:00,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:00,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:37:00,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:00,468 INFO L87 Difference]: Start difference. First operand 836 states and 1229 transitions. Second operand has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:00,803 INFO L93 Difference]: Finished difference Result 1291 states and 1906 transitions. [2025-03-16 22:37:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:00,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2025-03-16 22:37:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:00,806 INFO L225 Difference]: With dead ends: 1291 [2025-03-16 22:37:00,806 INFO L226 Difference]: Without dead ends: 882 [2025-03-16 22:37:00,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:00,807 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1635 mSDsluCounter, 2220 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 2777 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:00,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 2777 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-16 22:37:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 842. [2025-03-16 22:37:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.4708680142687276) internal successors, (1237), 841 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1237 transitions. [2025-03-16 22:37:00,817 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1237 transitions. Word has length 257 [2025-03-16 22:37:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:00,817 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1237 transitions. [2025-03-16 22:37:00,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1237 transitions. [2025-03-16 22:37:00,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-16 22:37:00,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:00,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:37:00,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 22:37:00,819 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:00,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:00,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1588265588, now seen corresponding path program 1 times [2025-03-16 22:37:00,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:00,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121447780] [2025-03-16 22:37:00,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:00,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:00,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-16 22:37:01,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-16 22:37:01,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:01,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:02,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121447780] [2025-03-16 22:37:02,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121447780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:02,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764289147] [2025-03-16 22:37:02,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:02,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:02,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:02,036 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 22:37:02,038 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 22:37:02,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-16 22:37:02,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-16 22:37:02,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:02,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:02,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 1637 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-16 22:37:02,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:03,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:37:03,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764289147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:03,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:37:03,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-16 22:37:03,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819250924] [2025-03-16 22:37:03,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:03,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:03,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:03,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:03,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:03,016 INFO L87 Difference]: Start difference. First operand 842 states and 1237 transitions. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:03,251 INFO L93 Difference]: Finished difference Result 1520 states and 2235 transitions. [2025-03-16 22:37:03,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:03,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2025-03-16 22:37:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:03,254 INFO L225 Difference]: With dead ends: 1520 [2025-03-16 22:37:03,254 INFO L226 Difference]: Without dead ends: 876 [2025-03-16 22:37:03,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:37:03,255 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1735 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:03,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1735 Valid, 1668 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-03-16 22:37:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 842. [2025-03-16 22:37:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.469678953626635) internal successors, (1236), 841 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1236 transitions. [2025-03-16 22:37:03,262 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1236 transitions. Word has length 257 [2025-03-16 22:37:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:03,262 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1236 transitions. [2025-03-16 22:37:03,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1236 transitions. [2025-03-16 22:37:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-16 22:37:03,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:03,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:37:03,275 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 22:37:03,464 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,SelfDestructingSolverStorable20 [2025-03-16 22:37:03,465 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:03,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1113777314, now seen corresponding path program 1 times [2025-03-16 22:37:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:03,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088513117] [2025-03-16 22:37:03,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:03,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 22:37:03,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 22:37:03,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:03,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:04,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:04,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088513117] [2025-03-16 22:37:04,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088513117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:04,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791137168] [2025-03-16 22:37:04,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:04,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:04,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:04,530 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 22:37:04,531 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 22:37:04,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 22:37:05,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 22:37:05,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:05,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:05,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 22:37:05,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:05,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:37:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791137168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:05,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:37:05,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-16 22:37:05,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5693722] [2025-03-16 22:37:05,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:05,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:37:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:05,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:37:05,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:37:05,502 INFO L87 Difference]: Start difference. First operand 842 states and 1236 transitions. Second operand has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:06,028 INFO L93 Difference]: Finished difference Result 1636 states and 2404 transitions. [2025-03-16 22:37:06,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:06,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2025-03-16 22:37:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:06,033 INFO L225 Difference]: With dead ends: 1636 [2025-03-16 22:37:06,033 INFO L226 Difference]: Without dead ends: 883 [2025-03-16 22:37:06,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-16 22:37:06,035 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1813 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1813 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:06,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1813 Valid, 2415 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:37:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-16 22:37:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 845. [2025-03-16 22:37:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.4680094786729858) internal successors, (1239), 844 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1239 transitions. [2025-03-16 22:37:06,043 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1239 transitions. Word has length 258 [2025-03-16 22:37:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:06,043 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1239 transitions. [2025-03-16 22:37:06,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1239 transitions. [2025-03-16 22:37:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-16 22:37:06,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:06,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:37:06,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 22:37:06,245 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,SelfDestructingSolverStorable21 [2025-03-16 22:37:06,246 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:06,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash 487050704, now seen corresponding path program 1 times [2025-03-16 22:37:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:06,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361416368] [2025-03-16 22:37:06,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:06,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:06,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-16 22:37:06,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-16 22:37:06,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:06,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:07,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:07,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361416368] [2025-03-16 22:37:07,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361416368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:07,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:07,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:07,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595415691] [2025-03-16 22:37:07,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:07,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:07,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:07,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:07,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:07,545 INFO L87 Difference]: Start difference. First operand 845 states and 1239 transitions. Second operand has 6 states, 6 states have (on average 43.166666666666664) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:07,863 INFO L93 Difference]: Finished difference Result 1483 states and 2179 transitions. [2025-03-16 22:37:07,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:07,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.166666666666664) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2025-03-16 22:37:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:07,866 INFO L225 Difference]: With dead ends: 1483 [2025-03-16 22:37:07,866 INFO L226 Difference]: Without dead ends: 877 [2025-03-16 22:37:07,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:07,867 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1714 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:07,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 1669 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:07,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-16 22:37:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 843. [2025-03-16 22:37:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.4679334916864608) internal successors, (1236), 842 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1236 transitions. [2025-03-16 22:37:07,877 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1236 transitions. Word has length 259 [2025-03-16 22:37:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:07,877 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1236 transitions. [2025-03-16 22:37:07,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.166666666666664) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1236 transitions. [2025-03-16 22:37:07,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-16 22:37:07,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:07,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:37:07,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 22:37:07,879 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:07,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash -156335049, now seen corresponding path program 1 times [2025-03-16 22:37:07,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:07,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844012150] [2025-03-16 22:37:07,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:07,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-16 22:37:08,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-16 22:37:08,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:08,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:09,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:09,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844012150] [2025-03-16 22:37:09,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844012150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:09,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594567524] [2025-03-16 22:37:09,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:09,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:09,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:09,742 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 22:37:09,744 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 22:37:10,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-16 22:37:10,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-16 22:37:10,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:10,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:10,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-16 22:37:10,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:11,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:12,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594567524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:12,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:37:12,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 11] total 33 [2025-03-16 22:37:12,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437175181] [2025-03-16 22:37:12,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:12,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-16 22:37:12,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:12,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-16 22:37:12,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 22:37:12,580 INFO L87 Difference]: Start difference. First operand 843 states and 1236 transitions. Second operand has 34 states, 34 states have (on average 22.5) internal successors, (765), 33 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:15,104 INFO L93 Difference]: Finished difference Result 2852 states and 4199 transitions. [2025-03-16 22:37:15,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-16 22:37:15,105 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 22.5) internal successors, (765), 33 states have internal predecessors, (765), 0 states have call successors, (0), 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 259 [2025-03-16 22:37:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:15,109 INFO L225 Difference]: With dead ends: 2852 [2025-03-16 22:37:15,109 INFO L226 Difference]: Without dead ends: 2078 [2025-03-16 22:37:15,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=606, Invalid=3176, Unknown=0, NotChecked=0, Total=3782 [2025-03-16 22:37:15,111 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 14589 mSDsluCounter, 11218 mSDsCounter, 0 mSdLazyCounter, 5504 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14589 SdHoareTripleChecker+Valid, 11679 SdHoareTripleChecker+Invalid, 5520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:15,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14589 Valid, 11679 Invalid, 5520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 5504 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 22:37:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2025-03-16 22:37:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1602. [2025-03-16 22:37:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1601 states have (on average 1.466583385384135) internal successors, (2348), 1601 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2348 transitions. [2025-03-16 22:37:15,125 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2348 transitions. Word has length 259 [2025-03-16 22:37:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:15,126 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2348 transitions. [2025-03-16 22:37:15,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 22.5) internal successors, (765), 33 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2348 transitions. [2025-03-16 22:37:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-16 22:37:15,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:15,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:37:15,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 22:37:15,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:15,329 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:15,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:15,329 INFO L85 PathProgramCache]: Analyzing trace with hash 981452566, now seen corresponding path program 1 times [2025-03-16 22:37:15,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:15,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115609929] [2025-03-16 22:37:15,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:15,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:15,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-16 22:37:15,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-16 22:37:15,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:15,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:15,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:15,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115609929] [2025-03-16 22:37:15,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115609929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:15,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:15,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:15,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888979030] [2025-03-16 22:37:15,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:15,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:15,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:15,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:15,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:15,717 INFO L87 Difference]: Start difference. First operand 1602 states and 2348 transitions. Second operand has 6 states, 6 states have (on average 43.333333333333336) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:15,914 INFO L93 Difference]: Finished difference Result 2025 states and 2977 transitions. [2025-03-16 22:37:15,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:15,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.333333333333336) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2025-03-16 22:37:15,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:15,917 INFO L225 Difference]: With dead ends: 2025 [2025-03-16 22:37:15,917 INFO L226 Difference]: Without dead ends: 1247 [2025-03-16 22:37:15,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:15,918 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 1715 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:15,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 1680 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2025-03-16 22:37:15,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1233. [2025-03-16 22:37:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1232 states have (on average 1.4724025974025974) internal successors, (1814), 1232 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1814 transitions. [2025-03-16 22:37:15,928 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1814 transitions. Word has length 260 [2025-03-16 22:37:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:15,928 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1814 transitions. [2025-03-16 22:37:15,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.333333333333336) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1814 transitions. [2025-03-16 22:37:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-16 22:37:15,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:15,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 22:37:15,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 22:37:15,931 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:15,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash 322072461, now seen corresponding path program 1 times [2025-03-16 22:37:15,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:15,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585150562] [2025-03-16 22:37:15,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:15,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:16,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-16 22:37:19,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-16 22:37:19,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:19,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 173 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:20,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:20,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585150562] [2025-03-16 22:37:20,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585150562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:20,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752584190] [2025-03-16 22:37:20,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:20,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:20,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:20,225 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 22:37:20,227 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 22:37:20,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-16 22:37:21,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-16 22:37:21,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:21,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:21,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 3059 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-16 22:37:21,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 161 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:22,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 170 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752584190] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:24,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:37:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 13] total 29 [2025-03-16 22:37:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116303703] [2025-03-16 22:37:24,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:24,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 22:37:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:24,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 22:37:24,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2025-03-16 22:37:24,681 INFO L87 Difference]: Start difference. First operand 1233 states and 1814 transitions. Second operand has 29 states, 29 states have (on average 40.96551724137931) internal successors, (1188), 29 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:30,143 INFO L93 Difference]: Finished difference Result 14386 states and 21439 transitions. [2025-03-16 22:37:30,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-03-16 22:37:30,144 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 40.96551724137931) internal successors, (1188), 29 states have internal predecessors, (1188), 0 states have call successors, (0), 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 463 [2025-03-16 22:37:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:30,167 INFO L225 Difference]: With dead ends: 14386 [2025-03-16 22:37:30,168 INFO L226 Difference]: Without dead ends: 13581 [2025-03-16 22:37:30,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1008 GetRequests, 913 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2930 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1122, Invalid=8190, Unknown=0, NotChecked=0, Total=9312 [2025-03-16 22:37:30,173 INFO L435 NwaCegarLoop]: 2053 mSDtfsCounter, 12218 mSDsluCounter, 32674 mSDsCounter, 0 mSdLazyCounter, 10881 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12218 SdHoareTripleChecker+Valid, 34727 SdHoareTripleChecker+Invalid, 10911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 10881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:30,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12218 Valid, 34727 Invalid, 10911 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 10881 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-16 22:37:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13581 states. [2025-03-16 22:37:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13581 to 3386. [2025-03-16 22:37:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.472082717872969) internal successors, (4983), 3385 states have internal predecessors, (4983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 4983 transitions. [2025-03-16 22:37:30,274 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 4983 transitions. Word has length 463 [2025-03-16 22:37:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:30,274 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 4983 transitions. [2025-03-16 22:37:30,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 40.96551724137931) internal successors, (1188), 29 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4983 transitions. [2025-03-16 22:37:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-16 22:37:30,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:30,280 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 22:37:30,295 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 22:37:30,481 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,SelfDestructingSolverStorable25 [2025-03-16 22:37:30,481 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:30,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2127975696, now seen corresponding path program 1 times [2025-03-16 22:37:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:30,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847358692] [2025-03-16 22:37:30,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:30,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-16 22:37:30,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-16 22:37:30,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:30,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-03-16 22:37:31,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:31,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847358692] [2025-03-16 22:37:31,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847358692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:31,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:31,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:31,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145562045] [2025-03-16 22:37:31,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:31,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:31,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:31,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:31,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:31,344 INFO L87 Difference]: Start difference. First operand 3386 states and 4983 transitions. Second operand has 5 states, 5 states have (on average 56.2) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:31,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:31,554 INFO L93 Difference]: Finished difference Result 6371 states and 9390 transitions. [2025-03-16 22:37:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:31,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 464 [2025-03-16 22:37:31,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:31,558 INFO L225 Difference]: With dead ends: 6371 [2025-03-16 22:37:31,558 INFO L226 Difference]: Without dead ends: 3066 [2025-03-16 22:37:31,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:31,560 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 1761 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:31,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 1674 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2025-03-16 22:37:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3028. [2025-03-16 22:37:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 3027 states have (on average 1.4740667327386852) internal successors, (4462), 3027 states have internal predecessors, (4462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 4462 transitions. [2025-03-16 22:37:31,585 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 4462 transitions. Word has length 464 [2025-03-16 22:37:31,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:31,585 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 4462 transitions. [2025-03-16 22:37:31,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:31,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 4462 transitions. [2025-03-16 22:37:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-16 22:37:31,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:31,590 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 22:37:31,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 22:37:31,590 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:31,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1030330488, now seen corresponding path program 1 times [2025-03-16 22:37:31,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:31,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371895234] [2025-03-16 22:37:31,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:31,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:31,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-16 22:37:34,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-16 22:37:34,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:34,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 179 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:35,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:35,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371895234] [2025-03-16 22:37:35,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371895234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:35,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100888582] [2025-03-16 22:37:35,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:35,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:35,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:35,287 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 22:37:35,287 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 22:37:35,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-16 22:37:36,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-16 22:37:36,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:36,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:36,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 3065 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-16 22:37:36,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 197 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:39,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 44 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:42,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100888582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:42,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:37:42,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 22] total 43 [2025-03-16 22:37:42,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628340099] [2025-03-16 22:37:42,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:42,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-16 22:37:42,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:42,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-16 22:37:42,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1510, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 22:37:42,466 INFO L87 Difference]: Start difference. First operand 3028 states and 4462 transitions. Second operand has 43 states, 43 states have (on average 27.790697674418606) internal successors, (1195), 43 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)