./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_loop_v.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 7e5038cf4746b0d33da8db40d97242789791fda4fe0e15050faace48f6985f4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:30:06,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:30:06,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:30:06,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:30:06,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:30:06,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:30:06,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:30:06,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:30:06,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:30:06,362 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:30:06,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:30:06,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:30:06,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:30:06,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:30:06,364 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:30:06,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:30:06,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:30:06,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:30:06,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:30:06,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:30:06,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:30:06,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:30:06,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:30:06,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:30:06,365 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:30:06,365 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:30:06,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:30:06,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:30:06,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:30:06,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:30:06,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:30:06,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:30:06,366 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:30:06,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:30:06,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:30:06,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:30:06,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:30:06,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:30:06,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:30:06,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:30:06,366 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 -> 7e5038cf4746b0d33da8db40d97242789791fda4fe0e15050faace48f6985f4f [2025-03-08 09:30:06,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:30:06,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:30:06,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:30:06,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:30:06,598 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:30:06,599 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_loop_v.c [2025-03-08 09:30:07,690 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985300262/d2e71a1e626d48ce96674a41c7ddbdd3/FLAGae9c1e397 [2025-03-08 09:30:07,935 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:30:07,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c [2025-03-08 09:30:07,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985300262/d2e71a1e626d48ce96674a41c7ddbdd3/FLAGae9c1e397 [2025-03-08 09:30:07,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985300262/d2e71a1e626d48ce96674a41c7ddbdd3 [2025-03-08 09:30:07,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:30:07,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:30:07,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:30:07,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:30:07,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:30:07,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:30:07" (1/1) ... [2025-03-08 09:30:07,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ff858a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:07, skipping insertion in model container [2025-03-08 09:30:07,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:30:07" (1/1) ... [2025-03-08 09:30:07,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:30:08,103 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_loop_v.c[1249,1262] [2025-03-08 09:30:08,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:30:08,227 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:30:08,234 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_loop_v.c[1249,1262] [2025-03-08 09:30:08,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:30:08,325 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:30:08,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08 WrapperNode [2025-03-08 09:30:08,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:30:08,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:30:08,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:30:08,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:30:08,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (1/1) ... [2025-03-08 09:30:08,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (1/1) ... [2025-03-08 09:30:08,420 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1012 [2025-03-08 09:30:08,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:30:08,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:30:08,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:30:08,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:30:08,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (1/1) ... [2025-03-08 09:30:08,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (1/1) ... [2025-03-08 09:30:08,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (1/1) ... [2025-03-08 09:30:08,471 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-08 09:30:08,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (1/1) ... [2025-03-08 09:30:08,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (1/1) ... [2025-03-08 09:30:08,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (1/1) ... [2025-03-08 09:30:08,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (1/1) ... [2025-03-08 09:30:08,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (1/1) ... [2025-03-08 09:30:08,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (1/1) ... [2025-03-08 09:30:08,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:30:08,552 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:30:08,552 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:30:08,553 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:30:08,553 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (1/1) ... [2025-03-08 09:30:08,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:30:08,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:30:08,580 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-08 09:30:08,582 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-08 09:30:08,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:30:08,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:30:08,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:30:08,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:30:08,740 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:30:08,741 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:30:09,676 INFO L? ?]: Removed 647 outVars from TransFormulas that were not future-live. [2025-03-08 09:30:09,676 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:30:09,721 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:30:09,723 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:30:09,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:30:09 BoogieIcfgContainer [2025-03-08 09:30:09,724 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:30:09,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:30:09,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:30:09,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:30:09,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:30:07" (1/3) ... [2025-03-08 09:30:09,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a4641a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:30:09, skipping insertion in model container [2025-03-08 09:30:09,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:08" (2/3) ... [2025-03-08 09:30:09,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a4641a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:30:09, skipping insertion in model container [2025-03-08 09:30:09,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:30:09" (3/3) ... [2025-03-08 09:30:09,730 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_loop_v.c [2025-03-08 09:30:09,741 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:30:09,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_loop_v.c that has 1 procedures, 298 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:30:09,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:30:09,793 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;@362bfa86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:30:09,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:30:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 296 states have (on average 1.4966216216216217) internal successors, (443), 297 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 09:30:09,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:09,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:09,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:09,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:09,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1458086393, now seen corresponding path program 1 times [2025-03-08 09:30:09,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:09,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137830544] [2025-03-08 09:30:09,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:09,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:09,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 09:30:09,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 09:30:09,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:09,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:10,231 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-08 09:30:10,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:10,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137830544] [2025-03-08 09:30:10,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137830544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:10,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:10,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:30:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006044478] [2025-03-08 09:30:10,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:10,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:30:10,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:10,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:30:10,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:30:10,254 INFO L87 Difference]: Start difference. First operand has 298 states, 296 states have (on average 1.4966216216216217) internal successors, (443), 297 states have internal predecessors, (443), 0 states have call successors, (0), 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 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:10,470 INFO L93 Difference]: Finished difference Result 557 states and 831 transitions. [2025-03-08 09:30:10,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:30:10,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 09:30:10,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:10,478 INFO L225 Difference]: With dead ends: 557 [2025-03-08 09:30:10,479 INFO L226 Difference]: Without dead ends: 297 [2025-03-08 09:30:10,483 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-08 09:30:10,486 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:10,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1090 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-08 09:30:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-03-08 09:30:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.489864864864865) internal successors, (441), 296 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2025-03-08 09:30:10,524 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 27 [2025-03-08 09:30:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:10,524 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2025-03-08 09:30:10,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2025-03-08 09:30:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 09:30:10,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:10,525 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] [2025-03-08 09:30:10,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:30:10,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:10,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:10,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2048641645, now seen corresponding path program 1 times [2025-03-08 09:30:10,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:10,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186748039] [2025-03-08 09:30:10,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:10,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:10,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 09:30:10,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 09:30:10,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:10,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:10,659 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-08 09:30:10,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186748039] [2025-03-08 09:30:10,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186748039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:10,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:10,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:30:10,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500332678] [2025-03-08 09:30:10,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:10,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:30:10,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:10,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:30:10,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:30:10,661 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:10,803 INFO L93 Difference]: Finished difference Result 558 states and 829 transitions. [2025-03-08 09:30:10,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:30:10,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-08 09:30:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:10,804 INFO L225 Difference]: With dead ends: 558 [2025-03-08 09:30:10,804 INFO L226 Difference]: Without dead ends: 299 [2025-03-08 09:30:10,805 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-08 09:30:10,805 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:10,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1087 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:30:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-08 09:30:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-03-08 09:30:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.4865771812080537) internal successors, (443), 298 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 443 transitions. [2025-03-08 09:30:10,817 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 443 transitions. Word has length 28 [2025-03-08 09:30:10,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:10,818 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 443 transitions. [2025-03-08 09:30:10,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 443 transitions. [2025-03-08 09:30:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 09:30:10,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:10,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:10,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:30:10,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:10,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:10,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1014891202, now seen corresponding path program 1 times [2025-03-08 09:30:10,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:10,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043640173] [2025-03-08 09:30:10,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:10,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:10,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 09:30:10,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 09:30:10,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:10,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:30:10,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:10,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043640173] [2025-03-08 09:30:10,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043640173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:10,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:10,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:10,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113271225] [2025-03-08 09:30:10,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:10,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:10,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:10,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:10,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:10,978 INFO L87 Difference]: Start difference. First operand 299 states and 443 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:11,227 INFO L93 Difference]: Finished difference Result 795 states and 1180 transitions. [2025-03-08 09:30:11,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:11,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 09:30:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:11,230 INFO L225 Difference]: With dead ends: 795 [2025-03-08 09:30:11,230 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 09:30:11,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-08 09:30:11,231 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1117 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:11,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1060 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 09:30:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 301. [2025-03-08 09:30:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.4833333333333334) internal successors, (445), 300 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 445 transitions. [2025-03-08 09:30:11,249 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 445 transitions. Word has length 29 [2025-03-08 09:30:11,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:11,252 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 445 transitions. [2025-03-08 09:30:11,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 445 transitions. [2025-03-08 09:30:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 09:30:11,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:11,257 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] [2025-03-08 09:30:11,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:30:11,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:11,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:11,258 INFO L85 PathProgramCache]: Analyzing trace with hash -162977166, now seen corresponding path program 1 times [2025-03-08 09:30:11,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:11,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492698076] [2025-03-08 09:30:11,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:11,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:11,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 09:30:11,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 09:30:11,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:11,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:12,232 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-08 09:30:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:12,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492698076] [2025-03-08 09:30:12,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492698076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:12,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:12,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:30:12,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670361772] [2025-03-08 09:30:12,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:12,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:30:12,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:12,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:30:12,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:30:12,236 INFO L87 Difference]: Start difference. First operand 301 states and 445 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:12,470 INFO L93 Difference]: Finished difference Result 778 states and 1154 transitions. [2025-03-08 09:30:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:30:12,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2025-03-08 09:30:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:12,473 INFO L225 Difference]: With dead ends: 778 [2025-03-08 09:30:12,473 INFO L226 Difference]: Without dead ends: 517 [2025-03-08 09:30:12,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-08 09:30:12,475 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1048 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:12,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1312 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-08 09:30:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 326. [2025-03-08 09:30:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4738461538461538) internal successors, (479), 325 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 479 transitions. [2025-03-08 09:30:12,483 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 479 transitions. Word has length 158 [2025-03-08 09:30:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:12,483 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 479 transitions. [2025-03-08 09:30:12,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 479 transitions. [2025-03-08 09:30:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 09:30:12,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:12,485 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] [2025-03-08 09:30:12,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:30:12,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:12,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:12,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1757927362, now seen corresponding path program 1 times [2025-03-08 09:30:12,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:12,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720054722] [2025-03-08 09:30:12,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:12,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:12,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 09:30:12,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 09:30:12,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:12,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:13,005 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-08 09:30:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:13,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720054722] [2025-03-08 09:30:13,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720054722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:13,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:13,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:13,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240259484] [2025-03-08 09:30:13,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:13,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:13,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:13,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:13,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:13,009 INFO L87 Difference]: Start difference. First operand 326 states and 479 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:13,204 INFO L93 Difference]: Finished difference Result 780 states and 1155 transitions. [2025-03-08 09:30:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:13,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2025-03-08 09:30:13,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:13,207 INFO L225 Difference]: With dead ends: 780 [2025-03-08 09:30:13,207 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 09:30:13,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-08 09:30:13,208 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 1053 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:13,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 1063 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 09:30:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 326. [2025-03-08 09:30:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4707692307692308) internal successors, (478), 325 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 478 transitions. [2025-03-08 09:30:13,220 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 478 transitions. Word has length 159 [2025-03-08 09:30:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:13,220 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 478 transitions. [2025-03-08 09:30:13,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 478 transitions. [2025-03-08 09:30:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 09:30:13,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:13,221 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] [2025-03-08 09:30:13,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:30:13,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:13,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash -202272953, now seen corresponding path program 1 times [2025-03-08 09:30:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:13,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431985478] [2025-03-08 09:30:13,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:13,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:13,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 09:30:13,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 09:30:13,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:13,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:14,087 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-08 09:30:14,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431985478] [2025-03-08 09:30:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431985478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:14,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257644628] [2025-03-08 09:30:14,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:14,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:14,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:14,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:14,092 INFO L87 Difference]: Start difference. First operand 326 states and 478 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:14,312 INFO L93 Difference]: Finished difference Result 772 states and 1142 transitions. [2025-03-08 09:30:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:14,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2025-03-08 09:30:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:14,315 INFO L225 Difference]: With dead ends: 772 [2025-03-08 09:30:14,315 INFO L226 Difference]: Without dead ends: 511 [2025-03-08 09:30:14,315 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-08 09:30:14,316 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 1012 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:14,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1049 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:14,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-08 09:30:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 349. [2025-03-08 09:30:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4683908045977012) internal successors, (511), 348 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 511 transitions. [2025-03-08 09:30:14,330 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 511 transitions. Word has length 159 [2025-03-08 09:30:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:14,330 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 511 transitions. [2025-03-08 09:30:14,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 511 transitions. [2025-03-08 09:30:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 09:30:14,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:14,331 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] [2025-03-08 09:30:14,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:30:14,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:14,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:14,332 INFO L85 PathProgramCache]: Analyzing trace with hash -51604092, now seen corresponding path program 1 times [2025-03-08 09:30:14,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:14,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153392325] [2025-03-08 09:30:14,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:14,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 09:30:14,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 09:30:14,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:14,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:15,257 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-08 09:30:15,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:15,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153392325] [2025-03-08 09:30:15,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153392325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:15,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:15,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:15,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170305979] [2025-03-08 09:30:15,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:15,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:15,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:15,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:15,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:15,260 INFO L87 Difference]: Start difference. First operand 349 states and 511 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:15,508 INFO L93 Difference]: Finished difference Result 772 states and 1140 transitions. [2025-03-08 09:30:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-08 09:30:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:15,511 INFO L225 Difference]: With dead ends: 772 [2025-03-08 09:30:15,512 INFO L226 Difference]: Without dead ends: 511 [2025-03-08 09:30:15,513 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-08 09:30:15,515 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 982 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:15,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 1048 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-08 09:30:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 400. [2025-03-08 09:30:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.468671679197995) internal successors, (586), 399 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 586 transitions. [2025-03-08 09:30:15,531 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 586 transitions. Word has length 161 [2025-03-08 09:30:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:15,533 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 586 transitions. [2025-03-08 09:30:15,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 586 transitions. [2025-03-08 09:30:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 09:30:15,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:15,535 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] [2025-03-08 09:30:15,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 09:30:15,535 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:15,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash 914758356, now seen corresponding path program 1 times [2025-03-08 09:30:15,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:15,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887412822] [2025-03-08 09:30:15,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:15,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:15,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 09:30:15,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 09:30:15,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:15,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:16,280 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-08 09:30:16,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887412822] [2025-03-08 09:30:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887412822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:16,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:16,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:16,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617340149] [2025-03-08 09:30:16,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:16,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:16,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:16,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:16,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:16,283 INFO L87 Difference]: Start difference. First operand 400 states and 586 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:16,539 INFO L93 Difference]: Finished difference Result 772 states and 1139 transitions. [2025-03-08 09:30:16,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:16,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-08 09:30:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:16,541 INFO L225 Difference]: With dead ends: 772 [2025-03-08 09:30:16,541 INFO L226 Difference]: Without dead ends: 511 [2025-03-08 09:30:16,542 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-08 09:30:16,542 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 965 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:16,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1048 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-08 09:30:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 428. [2025-03-08 09:30:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.468384074941452) internal successors, (627), 427 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2025-03-08 09:30:16,553 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 162 [2025-03-08 09:30:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:16,554 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2025-03-08 09:30:16,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2025-03-08 09:30:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 09:30:16,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:16,555 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] [2025-03-08 09:30:16,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 09:30:16,557 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:16,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:16,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1349351783, now seen corresponding path program 1 times [2025-03-08 09:30:16,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650042906] [2025-03-08 09:30:16,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:16,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:16,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 09:30:16,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 09:30:16,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:16,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:17,218 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-08 09:30:17,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:17,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650042906] [2025-03-08 09:30:17,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650042906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:17,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:17,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:17,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755544423] [2025-03-08 09:30:17,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:17,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:17,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:17,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:17,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:17,221 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:17,470 INFO L93 Difference]: Finished difference Result 772 states and 1138 transitions. [2025-03-08 09:30:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:17,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2025-03-08 09:30:17,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:17,472 INFO L225 Difference]: With dead ends: 772 [2025-03-08 09:30:17,472 INFO L226 Difference]: Without dead ends: 511 [2025-03-08 09:30:17,473 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-08 09:30:17,474 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 948 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:17,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1048 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-08 09:30:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 456. [2025-03-08 09:30:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.468131868131868) internal successors, (668), 455 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 668 transitions. [2025-03-08 09:30:17,487 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 668 transitions. Word has length 163 [2025-03-08 09:30:17,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:17,487 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 668 transitions. [2025-03-08 09:30:17,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 668 transitions. [2025-03-08 09:30:17,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 09:30:17,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:17,489 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] [2025-03-08 09:30:17,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 09:30:17,489 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:17,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2052595625, now seen corresponding path program 1 times [2025-03-08 09:30:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:17,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167137257] [2025-03-08 09:30:17,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:17,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 09:30:17,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 09:30:17,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:17,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:18,140 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-08 09:30:18,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:18,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167137257] [2025-03-08 09:30:18,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167137257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:18,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:18,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:18,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111230531] [2025-03-08 09:30:18,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:18,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:18,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:18,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:18,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:18,142 INFO L87 Difference]: Start difference. First operand 456 states and 668 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:18,422 INFO L93 Difference]: Finished difference Result 802 states and 1181 transitions. [2025-03-08 09:30:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:18,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-03-08 09:30:18,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:18,424 INFO L225 Difference]: With dead ends: 802 [2025-03-08 09:30:18,425 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 09:30:18,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-08 09:30:18,425 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 983 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1551 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:18,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1551 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 09:30:18,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 458. [2025-03-08 09:30:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.4660831509846828) internal successors, (670), 457 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:18,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 670 transitions. [2025-03-08 09:30:18,434 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 670 transitions. Word has length 164 [2025-03-08 09:30:18,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:18,435 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 670 transitions. [2025-03-08 09:30:18,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 670 transitions. [2025-03-08 09:30:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 09:30:18,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:18,437 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] [2025-03-08 09:30:18,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 09:30:18,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:18,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:18,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1934421627, now seen corresponding path program 1 times [2025-03-08 09:30:18,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:18,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567296088] [2025-03-08 09:30:18,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:18,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:18,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 09:30:18,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 09:30:18,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:18,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:19,002 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-08 09:30:19,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:19,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567296088] [2025-03-08 09:30:19,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567296088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:19,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:19,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:19,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283663764] [2025-03-08 09:30:19,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:19,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:19,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:19,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:19,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:19,004 INFO L87 Difference]: Start difference. First operand 458 states and 670 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:19,283 INFO L93 Difference]: Finished difference Result 782 states and 1151 transitions. [2025-03-08 09:30:19,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:19,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-03-08 09:30:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:19,285 INFO L225 Difference]: With dead ends: 782 [2025-03-08 09:30:19,285 INFO L226 Difference]: Without dead ends: 521 [2025-03-08 09:30:19,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-08 09:30:19,286 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 966 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:19,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 1652 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-08 09:30:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 461. [2025-03-08 09:30:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.4652173913043478) internal successors, (674), 460 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 674 transitions. [2025-03-08 09:30:19,295 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 674 transitions. Word has length 165 [2025-03-08 09:30:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:19,297 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 674 transitions. [2025-03-08 09:30:19,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 674 transitions. [2025-03-08 09:30:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 09:30:19,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:19,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] [2025-03-08 09:30:19,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 09:30:19,299 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:19,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash 146747599, now seen corresponding path program 1 times [2025-03-08 09:30:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:19,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276744709] [2025-03-08 09:30:19,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:19,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 09:30:19,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 09:30:19,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:19,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:19,993 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-08 09:30:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:19,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276744709] [2025-03-08 09:30:19,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276744709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:19,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:19,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:19,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166426331] [2025-03-08 09:30:19,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:19,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:19,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:19,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:19,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:19,994 INFO L87 Difference]: Start difference. First operand 461 states and 674 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:20,225 INFO L93 Difference]: Finished difference Result 776 states and 1141 transitions. [2025-03-08 09:30:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:20,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-08 09:30:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:20,227 INFO L225 Difference]: With dead ends: 776 [2025-03-08 09:30:20,227 INFO L226 Difference]: Without dead ends: 515 [2025-03-08 09:30:20,228 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-08 09:30:20,229 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 929 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:20,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1048 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-08 09:30:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 488. [2025-03-08 09:30:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.4640657084188913) internal successors, (713), 487 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 713 transitions. [2025-03-08 09:30:20,239 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 713 transitions. Word has length 166 [2025-03-08 09:30:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:20,239 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 713 transitions. [2025-03-08 09:30:20,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 713 transitions. [2025-03-08 09:30:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 09:30:20,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:20,241 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] [2025-03-08 09:30:20,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 09:30:20,242 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:20,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1617300910, now seen corresponding path program 1 times [2025-03-08 09:30:20,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:20,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942268906] [2025-03-08 09:30:20,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:20,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:20,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 09:30:20,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 09:30:20,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:20,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:20,910 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-08 09:30:20,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:20,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942268906] [2025-03-08 09:30:20,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942268906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:20,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:20,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:20,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204737996] [2025-03-08 09:30:20,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:20,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:20,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:20,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:20,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:20,912 INFO L87 Difference]: Start difference. First operand 488 states and 713 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:21,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:21,200 INFO L93 Difference]: Finished difference Result 784 states and 1152 transitions. [2025-03-08 09:30:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:21,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2025-03-08 09:30:21,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:21,203 INFO L225 Difference]: With dead ends: 784 [2025-03-08 09:30:21,203 INFO L226 Difference]: Without dead ends: 523 [2025-03-08 09:30:21,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-08 09:30:21,204 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 948 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:21,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1753 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-08 09:30:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 491. [2025-03-08 09:30:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.463265306122449) internal successors, (717), 490 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 717 transitions. [2025-03-08 09:30:21,214 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 717 transitions. Word has length 167 [2025-03-08 09:30:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:21,214 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 717 transitions. [2025-03-08 09:30:21,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 717 transitions. [2025-03-08 09:30:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 09:30:21,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:21,217 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] [2025-03-08 09:30:21,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 09:30:21,217 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:21,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash 538502325, now seen corresponding path program 1 times [2025-03-08 09:30:21,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:21,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611943929] [2025-03-08 09:30:21,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:21,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:21,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 09:30:21,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 09:30:21,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:21,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:21,804 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-08 09:30:21,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:21,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611943929] [2025-03-08 09:30:21,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611943929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:21,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:21,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653613970] [2025-03-08 09:30:21,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:21,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:21,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:21,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:21,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:21,806 INFO L87 Difference]: Start difference. First operand 491 states and 717 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:22,019 INFO L93 Difference]: Finished difference Result 781 states and 1147 transitions. [2025-03-08 09:30:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:22,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-03-08 09:30:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:22,021 INFO L225 Difference]: With dead ends: 781 [2025-03-08 09:30:22,021 INFO L226 Difference]: Without dead ends: 520 [2025-03-08 09:30:22,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:22,022 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 917 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:22,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1045 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-08 09:30:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2025-03-08 09:30:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.4622823984526112) internal successors, (756), 517 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 756 transitions. [2025-03-08 09:30:22,033 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 756 transitions. Word has length 168 [2025-03-08 09:30:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:22,033 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 756 transitions. [2025-03-08 09:30:22,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 756 transitions. [2025-03-08 09:30:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 09:30:22,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:22,034 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] [2025-03-08 09:30:22,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 09:30:22,035 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:22,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash -836783921, now seen corresponding path program 1 times [2025-03-08 09:30:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:22,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509768066] [2025-03-08 09:30:22,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:22,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:22,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 09:30:22,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 09:30:22,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:22,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:22,795 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-08 09:30:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:22,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509768066] [2025-03-08 09:30:22,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509768066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:22,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:22,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:22,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625630596] [2025-03-08 09:30:22,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:22,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:22,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:22,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:22,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:22,797 INFO L87 Difference]: Start difference. First operand 518 states and 756 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:23,079 INFO L93 Difference]: Finished difference Result 786 states and 1153 transitions. [2025-03-08 09:30:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:23,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-08 09:30:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:23,081 INFO L225 Difference]: With dead ends: 786 [2025-03-08 09:30:23,081 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 09:30:23,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:30:23,082 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 925 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:23,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1750 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 09:30:23,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 521. [2025-03-08 09:30:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.4615384615384615) internal successors, (760), 520 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 760 transitions. [2025-03-08 09:30:23,092 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 760 transitions. Word has length 169 [2025-03-08 09:30:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:23,093 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 760 transitions. [2025-03-08 09:30:23,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 760 transitions. [2025-03-08 09:30:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 09:30:23,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:23,094 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] [2025-03-08 09:30:23,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 09:30:23,095 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:23,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash -240840149, now seen corresponding path program 1 times [2025-03-08 09:30:23,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:23,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424417994] [2025-03-08 09:30:23,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:23,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 09:30:23,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 09:30:23,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:23,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:23,635 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-08 09:30:23,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:23,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424417994] [2025-03-08 09:30:23,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424417994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:23,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:23,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:23,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540387969] [2025-03-08 09:30:23,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:23,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:23,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:23,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:23,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:23,638 INFO L87 Difference]: Start difference. First operand 521 states and 760 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:23,868 INFO L93 Difference]: Finished difference Result 901 states and 1318 transitions. [2025-03-08 09:30:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:23,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-08 09:30:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:23,870 INFO L225 Difference]: With dead ends: 901 [2025-03-08 09:30:23,871 INFO L226 Difference]: Without dead ends: 521 [2025-03-08 09:30:23,871 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-08 09:30:23,872 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 973 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:23,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1049 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-08 09:30:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-03-08 09:30:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.4596153846153845) internal successors, (759), 520 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 759 transitions. [2025-03-08 09:30:23,881 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 759 transitions. Word has length 170 [2025-03-08 09:30:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:23,881 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 759 transitions. [2025-03-08 09:30:23,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 759 transitions. [2025-03-08 09:30:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 09:30:23,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:23,883 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] [2025-03-08 09:30:23,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 09:30:23,883 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:23,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1606676561, now seen corresponding path program 1 times [2025-03-08 09:30:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:23,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577344803] [2025-03-08 09:30:23,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:23,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 09:30:24,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 09:30:24,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:24,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:24,855 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-08 09:30:24,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577344803] [2025-03-08 09:30:24,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577344803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:24,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:24,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:24,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528433205] [2025-03-08 09:30:24,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:24,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:24,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:24,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:24,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:24,856 INFO L87 Difference]: Start difference. First operand 521 states and 759 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:25,131 INFO L93 Difference]: Finished difference Result 815 states and 1195 transitions. [2025-03-08 09:30:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:25,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-03-08 09:30:25,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:25,133 INFO L225 Difference]: With dead ends: 815 [2025-03-08 09:30:25,133 INFO L226 Difference]: Without dead ends: 554 [2025-03-08 09:30:25,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:25,134 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 250 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:25,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1328 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-08 09:30:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2025-03-08 09:30:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.4591651542649728) internal successors, (804), 551 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 804 transitions. [2025-03-08 09:30:25,145 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 804 transitions. Word has length 171 [2025-03-08 09:30:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:25,145 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 804 transitions. [2025-03-08 09:30:25,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 804 transitions. [2025-03-08 09:30:25,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 09:30:25,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:25,147 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] [2025-03-08 09:30:25,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 09:30:25,148 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:25,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:25,148 INFO L85 PathProgramCache]: Analyzing trace with hash -259233829, now seen corresponding path program 1 times [2025-03-08 09:30:25,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:25,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772092735] [2025-03-08 09:30:25,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:25,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 09:30:25,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 09:30:25,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:25,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:25,809 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-08 09:30:25,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:25,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772092735] [2025-03-08 09:30:25,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772092735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:30:25,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089224668] [2025-03-08 09:30:25,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:25,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:30:25,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:30:25,812 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-08 09:30:25,813 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-08 09:30:26,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 09:30:26,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 09:30:26,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:26,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:26,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 09:30:26,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:30:26,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-08 09:30:26,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:30:26,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089224668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:26,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:30:26,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-08 09:30:26,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425171195] [2025-03-08 09:30:26,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:26,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:26,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:26,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:26,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:30:26,532 INFO L87 Difference]: Start difference. First operand 552 states and 804 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:26,936 INFO L93 Difference]: Finished difference Result 1035 states and 1511 transitions. [2025-03-08 09:30:26,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:26,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2025-03-08 09:30:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:26,938 INFO L225 Difference]: With dead ends: 1035 [2025-03-08 09:30:26,938 INFO L226 Difference]: Without dead ends: 551 [2025-03-08 09:30:26,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-08 09:30:26,939 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 322 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:26,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1813 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:30:26,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-08 09:30:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-08 09:30:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.4563636363636363) internal successors, (801), 550 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 801 transitions. [2025-03-08 09:30:26,948 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 801 transitions. Word has length 172 [2025-03-08 09:30:26,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:26,948 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 801 transitions. [2025-03-08 09:30:26,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 801 transitions. [2025-03-08 09:30:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 09:30:26,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:26,949 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] [2025-03-08 09:30:26,959 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-08 09:30:27,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 09:30:27,154 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:27,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:27,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1862141771, now seen corresponding path program 1 times [2025-03-08 09:30:27,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:27,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380253136] [2025-03-08 09:30:27,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:27,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:27,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 09:30:27,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 09:30:27,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:27,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:27,698 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-08 09:30:27,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:27,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380253136] [2025-03-08 09:30:27,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380253136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:27,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:27,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14269894] [2025-03-08 09:30:27,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:27,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:27,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:27,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:27,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:27,700 INFO L87 Difference]: Start difference. First operand 551 states and 801 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:27,926 INFO L93 Difference]: Finished difference Result 930 states and 1358 transitions. [2025-03-08 09:30:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:27,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-03-08 09:30:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:27,929 INFO L225 Difference]: With dead ends: 930 [2025-03-08 09:30:27,929 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 09:30:27,930 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-08 09:30:27,930 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 948 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:27,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1049 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 09:30:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-03-08 09:30:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.4562043795620438) internal successors, (798), 548 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 798 transitions. [2025-03-08 09:30:27,943 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 798 transitions. Word has length 173 [2025-03-08 09:30:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:27,943 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 798 transitions. [2025-03-08 09:30:27,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 798 transitions. [2025-03-08 09:30:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 09:30:27,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:27,945 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] [2025-03-08 09:30:27,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 09:30:27,945 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:27,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash -149936310, now seen corresponding path program 1 times [2025-03-08 09:30:27,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556812446] [2025-03-08 09:30:27,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:27,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 09:30:28,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 09:30:28,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:28,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:28,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-08 09:30:28,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:28,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556812446] [2025-03-08 09:30:28,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556812446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:28,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:28,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:28,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097917261] [2025-03-08 09:30:28,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:28,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:28,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:28,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:28,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:28,918 INFO L87 Difference]: Start difference. First operand 549 states and 798 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:29,181 INFO L93 Difference]: Finished difference Result 812 states and 1188 transitions. [2025-03-08 09:30:29,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:29,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-03-08 09:30:29,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:29,183 INFO L225 Difference]: With dead ends: 812 [2025-03-08 09:30:29,183 INFO L226 Difference]: Without dead ends: 551 [2025-03-08 09:30:29,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:29,187 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 244 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:29,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1329 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-08 09:30:29,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 550. [2025-03-08 09:30:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4553734061930783) internal successors, (799), 549 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 799 transitions. [2025-03-08 09:30:29,206 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 799 transitions. Word has length 173 [2025-03-08 09:30:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:29,206 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 799 transitions. [2025-03-08 09:30:29,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:29,206 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2025-03-08 09:30:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 09:30:29,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:29,208 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] [2025-03-08 09:30:29,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 09:30:29,208 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:29,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash -319657368, now seen corresponding path program 1 times [2025-03-08 09:30:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:29,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469766865] [2025-03-08 09:30:29,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:29,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 09:30:29,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 09:30:29,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:29,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:30,251 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-08 09:30:30,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:30,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469766865] [2025-03-08 09:30:30,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469766865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:30:30,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525047503] [2025-03-08 09:30:30,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:30,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:30:30,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:30:30,254 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-08 09:30:30,255 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-08 09:30:30,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 09:30:30,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 09:30:30,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:30,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:30,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 09:30:30,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:30:31,264 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-08 09:30:31,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:30:31,930 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-08 09:30:31,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525047503] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:30:31,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:30:31,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2025-03-08 09:30:31,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785044604] [2025-03-08 09:30:31,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:30:31,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 09:30:31,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:31,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 09:30:31,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2025-03-08 09:30:31,935 INFO L87 Difference]: Start difference. First operand 550 states and 799 transitions. Second operand has 29 states, 29 states have (on average 17.517241379310345) internal successors, (508), 29 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:33,422 INFO L93 Difference]: Finished difference Result 1742 states and 2544 transitions. [2025-03-08 09:30:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 09:30:33,422 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 17.517241379310345) internal successors, (508), 29 states have internal predecessors, (508), 0 states have call successors, (0), 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 174 [2025-03-08 09:30:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:33,425 INFO L225 Difference]: With dead ends: 1742 [2025-03-08 09:30:33,425 INFO L226 Difference]: Without dead ends: 1251 [2025-03-08 09:30:33,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=343, Invalid=1913, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 09:30:33,427 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 8724 mSDsluCounter, 6153 mSDsCounter, 0 mSdLazyCounter, 2849 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8724 SdHoareTripleChecker+Valid, 6453 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:33,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8724 Valid, 6453 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2849 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 09:30:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-03-08 09:30:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1030. [2025-03-08 09:30:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4548104956268222) internal successors, (1497), 1029 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1497 transitions. [2025-03-08 09:30:33,440 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1497 transitions. Word has length 174 [2025-03-08 09:30:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:33,440 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1497 transitions. [2025-03-08 09:30:33,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 17.517241379310345) internal successors, (508), 29 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1497 transitions. [2025-03-08 09:30:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 09:30:33,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:33,442 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] [2025-03-08 09:30:33,452 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-08 09:30:33,646 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,SelfDestructingSolverStorable20 [2025-03-08 09:30:33,646 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:33,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:33,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1958889613, now seen corresponding path program 1 times [2025-03-08 09:30:33,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:33,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957373996] [2025-03-08 09:30:33,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:33,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:33,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 09:30:33,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 09:30:33,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:33,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:33,967 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-08 09:30:33,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:33,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957373996] [2025-03-08 09:30:33,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957373996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:33,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:33,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:33,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530268493] [2025-03-08 09:30:33,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:33,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:33,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:33,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:33,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:33,969 INFO L87 Difference]: Start difference. First operand 1030 states and 1497 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:34,142 INFO L93 Difference]: Finished difference Result 2036 states and 2963 transitions. [2025-03-08 09:30:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:34,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2025-03-08 09:30:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:34,148 INFO L225 Difference]: With dead ends: 2036 [2025-03-08 09:30:34,148 INFO L226 Difference]: Without dead ends: 1057 [2025-03-08 09:30:34,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:34,150 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 5 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:34,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2147 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:34,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2025-03-08 09:30:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1057. [2025-03-08 09:30:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1056 states have (on average 1.4507575757575757) internal successors, (1532), 1056 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1532 transitions. [2025-03-08 09:30:34,161 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1532 transitions. Word has length 175 [2025-03-08 09:30:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:34,161 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1532 transitions. [2025-03-08 09:30:34,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1532 transitions. [2025-03-08 09:30:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 09:30:34,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:34,162 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] [2025-03-08 09:30:34,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 09:30:34,163 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:34,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1268642926, now seen corresponding path program 1 times [2025-03-08 09:30:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323605148] [2025-03-08 09:30:34,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:34,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:34,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 09:30:34,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 09:30:34,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:34,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:34,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-08 09:30:34,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:34,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323605148] [2025-03-08 09:30:34,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323605148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:34,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:34,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:30:34,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689871927] [2025-03-08 09:30:34,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:34,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:30:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:34,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:30:34,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:30:34,560 INFO L87 Difference]: Start difference. First operand 1057 states and 1532 transitions. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:34,787 INFO L93 Difference]: Finished difference Result 1556 states and 2257 transitions. [2025-03-08 09:30:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:34,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2025-03-08 09:30:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:34,790 INFO L225 Difference]: With dead ends: 1556 [2025-03-08 09:30:34,790 INFO L226 Difference]: Without dead ends: 1047 [2025-03-08 09:30:34,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:30:34,795 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1033 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:34,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1410 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2025-03-08 09:30:34,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2025-03-08 09:30:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1046 states have (on average 1.4493307839388145) internal successors, (1516), 1046 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1516 transitions. [2025-03-08 09:30:34,807 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1516 transitions. Word has length 175 [2025-03-08 09:30:34,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:34,807 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1516 transitions. [2025-03-08 09:30:34,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1516 transitions. [2025-03-08 09:30:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 09:30:34,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:34,808 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] [2025-03-08 09:30:34,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 09:30:34,808 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:34,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:34,809 INFO L85 PathProgramCache]: Analyzing trace with hash 22793042, now seen corresponding path program 1 times [2025-03-08 09:30:34,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:34,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131250270] [2025-03-08 09:30:34,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:34,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:34,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 09:30:34,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 09:30:34,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:34,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:35,066 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-08 09:30:35,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:35,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131250270] [2025-03-08 09:30:35,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131250270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:35,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:35,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:35,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585847515] [2025-03-08 09:30:35,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:35,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:35,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:35,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:35,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:35,067 INFO L87 Difference]: Start difference. First operand 1047 states and 1516 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:35,250 INFO L93 Difference]: Finished difference Result 2035 states and 2950 transitions. [2025-03-08 09:30:35,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:35,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-03-08 09:30:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:35,254 INFO L225 Difference]: With dead ends: 2035 [2025-03-08 09:30:35,254 INFO L226 Difference]: Without dead ends: 1044 [2025-03-08 09:30:35,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-08 09:30:35,255 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1051 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:35,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 1061 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:35,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2025-03-08 09:30:35,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2025-03-08 09:30:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 1.4477468839884948) internal successors, (1510), 1043 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1510 transitions. [2025-03-08 09:30:35,266 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1510 transitions. Word has length 176 [2025-03-08 09:30:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:35,267 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1510 transitions. [2025-03-08 09:30:35,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1510 transitions. [2025-03-08 09:30:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 09:30:35,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:35,268 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] [2025-03-08 09:30:35,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 09:30:35,268 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:35,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1945013449, now seen corresponding path program 1 times [2025-03-08 09:30:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:35,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247214483] [2025-03-08 09:30:35,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:35,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 09:30:35,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 09:30:35,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:35,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:35,527 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-08 09:30:35,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:35,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247214483] [2025-03-08 09:30:35,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247214483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:35,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:35,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:35,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174599561] [2025-03-08 09:30:35,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:35,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:35,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:35,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:35,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:35,528 INFO L87 Difference]: Start difference. First operand 1044 states and 1510 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:35,711 INFO L93 Difference]: Finished difference Result 1798 states and 2612 transitions. [2025-03-08 09:30:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:35,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-03-08 09:30:35,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:35,714 INFO L225 Difference]: With dead ends: 1798 [2025-03-08 09:30:35,714 INFO L226 Difference]: Without dead ends: 806 [2025-03-08 09:30:35,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-08 09:30:35,716 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1077 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:35,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1054 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-03-08 09:30:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-03-08 09:30:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.4559006211180123) internal successors, (1172), 805 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1172 transitions. [2025-03-08 09:30:35,726 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1172 transitions. Word has length 176 [2025-03-08 09:30:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:35,726 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1172 transitions. [2025-03-08 09:30:35,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1172 transitions. [2025-03-08 09:30:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-08 09:30:35,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:35,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:30:35,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 09:30:35,729 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:35,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:35,730 INFO L85 PathProgramCache]: Analyzing trace with hash 609629854, now seen corresponding path program 1 times [2025-03-08 09:30:35,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:35,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297228008] [2025-03-08 09:30:35,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:35,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:35,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-08 09:30:36,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-08 09:30:36,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:36,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:30:37,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:37,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297228008] [2025-03-08 09:30:37,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297228008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:37,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:37,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:37,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872415218] [2025-03-08 09:30:37,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:37,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:37,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:37,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:37,035 INFO L87 Difference]: Start difference. First operand 806 states and 1172 transitions. Second operand has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:37,621 INFO L93 Difference]: Finished difference Result 2692 states and 3979 transitions. [2025-03-08 09:30:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:30:37,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 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 304 [2025-03-08 09:30:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:37,626 INFO L225 Difference]: With dead ends: 2692 [2025-03-08 09:30:37,626 INFO L226 Difference]: Without dead ends: 2167 [2025-03-08 09:30:37,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:30:37,628 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 1362 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 3158 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:37,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 3158 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:30:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2025-03-08 09:30:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1264. [2025-03-08 09:30:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 1.4655581947743468) internal successors, (1851), 1263 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1851 transitions. [2025-03-08 09:30:37,649 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1851 transitions. Word has length 304 [2025-03-08 09:30:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:37,649 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 1851 transitions. [2025-03-08 09:30:37,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1851 transitions. [2025-03-08 09:30:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-08 09:30:37,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:37,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:30:37,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 09:30:37,652 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:37,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:37,653 INFO L85 PathProgramCache]: Analyzing trace with hash 67092443, now seen corresponding path program 1 times [2025-03-08 09:30:37,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:37,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577110938] [2025-03-08 09:30:37,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:37,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:37,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-08 09:30:38,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-08 09:30:38,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:38,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:30:39,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:39,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577110938] [2025-03-08 09:30:39,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577110938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:39,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:39,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 09:30:39,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800492170] [2025-03-08 09:30:39,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:39,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 09:30:39,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:39,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 09:30:39,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:30:39,634 INFO L87 Difference]: Start difference. First operand 1264 states and 1851 transitions. Second operand has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:40,131 INFO L93 Difference]: Finished difference Result 3189 states and 4704 transitions. [2025-03-08 09:30:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 09:30:40,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 0 states have call successors, (0), 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 305 [2025-03-08 09:30:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:40,136 INFO L225 Difference]: With dead ends: 3189 [2025-03-08 09:30:40,136 INFO L226 Difference]: Without dead ends: 2206 [2025-03-08 09:30:40,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:30:40,137 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 1290 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 3697 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:40,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 3697 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:30:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2025-03-08 09:30:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1346. [2025-03-08 09:30:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1345 states have (on average 1.458736059479554) internal successors, (1962), 1345 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1962 transitions. [2025-03-08 09:30:40,153 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1962 transitions. Word has length 305 [2025-03-08 09:30:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:40,153 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1962 transitions. [2025-03-08 09:30:40,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1962 transitions. [2025-03-08 09:30:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-08 09:30:40,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:40,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:30:40,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 09:30:40,156 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:40,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:40,156 INFO L85 PathProgramCache]: Analyzing trace with hash -67606088, now seen corresponding path program 1 times [2025-03-08 09:30:40,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:40,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017643048] [2025-03-08 09:30:40,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:40,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:40,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-08 09:30:41,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-08 09:30:41,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:41,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 09:30:41,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:41,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017643048] [2025-03-08 09:30:41,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017643048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:41,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:41,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:41,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987079314] [2025-03-08 09:30:41,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:41,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:41,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:41,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:41,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:41,652 INFO L87 Difference]: Start difference. First operand 1346 states and 1962 transitions. Second operand has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:41,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:41,909 INFO L93 Difference]: Finished difference Result 2444 states and 3578 transitions. [2025-03-08 09:30:41,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:41,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 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 306 [2025-03-08 09:30:41,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:41,913 INFO L225 Difference]: With dead ends: 2444 [2025-03-08 09:30:41,913 INFO L226 Difference]: Without dead ends: 1371 [2025-03-08 09:30:41,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:41,914 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 287 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:41,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1579 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:41,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-03-08 09:30:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1371. [2025-03-08 09:30:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1370 states have (on average 1.454014598540146) internal successors, (1992), 1370 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1992 transitions. [2025-03-08 09:30:41,928 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1992 transitions. Word has length 306 [2025-03-08 09:30:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:41,929 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1992 transitions. [2025-03-08 09:30:41,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1992 transitions. [2025-03-08 09:30:41,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-08 09:30:41,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:41,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:30:41,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 09:30:41,932 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:41,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1411810365, now seen corresponding path program 1 times [2025-03-08 09:30:41,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:41,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913879032] [2025-03-08 09:30:41,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:41,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:41,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-08 09:30:42,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-08 09:30:42,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:42,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:30:43,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913879032] [2025-03-08 09:30:43,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913879032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:43,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:43,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 09:30:43,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637308723] [2025-03-08 09:30:43,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:43,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 09:30:43,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:43,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 09:30:43,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:30:43,693 INFO L87 Difference]: Start difference. First operand 1371 states and 1992 transitions. Second operand has 8 states, 8 states have (on average 38.25) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:44,120 INFO L93 Difference]: Finished difference Result 3378 states and 4955 transitions. [2025-03-08 09:30:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:30:44,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.25) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 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 306 [2025-03-08 09:30:44,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:44,126 INFO L225 Difference]: With dead ends: 3378 [2025-03-08 09:30:44,126 INFO L226 Difference]: Without dead ends: 2296 [2025-03-08 09:30:44,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:30:44,127 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 1297 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:44,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 2950 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:30:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2025-03-08 09:30:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1373. [2025-03-08 09:30:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1372 states have (on average 1.4518950437317784) internal successors, (1992), 1372 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1992 transitions. [2025-03-08 09:30:44,140 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1992 transitions. Word has length 306 [2025-03-08 09:30:44,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:44,140 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1992 transitions. [2025-03-08 09:30:44,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.25) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1992 transitions. [2025-03-08 09:30:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 09:30:44,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:44,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:30:44,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 09:30:44,143 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:44,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:44,143 INFO L85 PathProgramCache]: Analyzing trace with hash 606489147, now seen corresponding path program 1 times [2025-03-08 09:30:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:44,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28228397] [2025-03-08 09:30:44,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:44,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 09:30:45,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 09:30:45,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:45,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:30:46,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:46,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28228397] [2025-03-08 09:30:46,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28228397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:30:46,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730594454] [2025-03-08 09:30:46,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:46,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:30:46,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:30:46,761 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-08 09:30:46,762 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-08 09:30:47,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 09:30:47,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 09:30:47,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:47,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:47,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 2013 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 09:30:47,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:30:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:30:47,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:30:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 09:30:48,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730594454] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 09:30:48,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:30:48,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 25 [2025-03-08 09:30:48,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427661082] [2025-03-08 09:30:48,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:48,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 09:30:48,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:48,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 09:30:48,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-03-08 09:30:48,144 INFO L87 Difference]: Start difference. First operand 1373 states and 1992 transitions. Second operand has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:48,565 INFO L93 Difference]: Finished difference Result 4112 states and 6048 transitions. [2025-03-08 09:30:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 09:30:48,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 0 states have call successors, (0), 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 307 [2025-03-08 09:30:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:48,571 INFO L225 Difference]: With dead ends: 4112 [2025-03-08 09:30:48,571 INFO L226 Difference]: Without dead ends: 3028 [2025-03-08 09:30:48,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-03-08 09:30:48,573 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 1453 mSDsluCounter, 2314 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 3095 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:48,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 3095 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:30:48,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2025-03-08 09:30:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 1578. [2025-03-08 09:30:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 1.4540266328471783) internal successors, (2293), 1577 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2293 transitions. [2025-03-08 09:30:48,587 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2293 transitions. Word has length 307 [2025-03-08 09:30:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:48,588 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2293 transitions. [2025-03-08 09:30:48,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2293 transitions. [2025-03-08 09:30:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 09:30:48,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:30:48,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 09:30:48,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:30:48,791 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:48,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash -339197843, now seen corresponding path program 1 times [2025-03-08 09:30:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:48,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410496193] [2025-03-08 09:30:48,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:48,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 09:30:50,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 09:30:50,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:50,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 09:30:51,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:51,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410496193] [2025-03-08 09:30:51,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410496193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:51,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:51,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:30:51,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673987945] [2025-03-08 09:30:51,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:51,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:30:51,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:51,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:30:51,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:30:51,020 INFO L87 Difference]: Start difference. First operand 1578 states and 2293 transitions. Second operand has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:51,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:51,357 INFO L93 Difference]: Finished difference Result 3651 states and 5353 transitions. [2025-03-08 09:30:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:30:51,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 0 states have call successors, (0), 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 308 [2025-03-08 09:30:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:51,362 INFO L225 Difference]: With dead ends: 3651 [2025-03-08 09:30:51,362 INFO L226 Difference]: Without dead ends: 2362 [2025-03-08 09:30:51,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:30:51,364 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 291 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:51,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 2708 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-03-08 09:30:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1630. [2025-03-08 09:30:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1629 states have (on average 1.4518109269490485) internal successors, (2365), 1629 states have internal predecessors, (2365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2365 transitions. [2025-03-08 09:30:51,383 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2365 transitions. Word has length 308 [2025-03-08 09:30:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:51,384 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2365 transitions. [2025-03-08 09:30:51,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2365 transitions. [2025-03-08 09:30:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 09:30:51,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:51,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:30:51,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 09:30:51,387 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:51,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:51,387 INFO L85 PathProgramCache]: Analyzing trace with hash 435899482, now seen corresponding path program 1 times [2025-03-08 09:30:51,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:51,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660048291] [2025-03-08 09:30:51,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:51,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:51,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 09:30:52,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 09:30:52,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:52,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 106 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:30:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660048291] [2025-03-08 09:30:54,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660048291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:30:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086850117] [2025-03-08 09:30:54,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:54,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:30:54,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:30:54,053 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-08 09:30:54,054 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-08 09:30:54,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 09:30:54,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 09:30:54,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:54,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:54,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-08 09:30:54,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:30:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:30:55,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:30:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 93 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:30:57,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086850117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:30:57,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:30:57,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 16] total 34 [2025-03-08 09:30:57,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850700815] [2025-03-08 09:30:57,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:30:57,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 09:30:57,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:57,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 09:30:57,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 09:30:57,059 INFO L87 Difference]: Start difference. First operand 1630 states and 2365 transitions. Second operand has 34 states, 34 states have (on average 24.61764705882353) internal successors, (837), 34 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:59,514 INFO L93 Difference]: Finished difference Result 5410 states and 7961 transitions. [2025-03-08 09:30:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-08 09:30:59,515 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 24.61764705882353) internal successors, (837), 34 states have internal predecessors, (837), 0 states have call successors, (0), 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 308 [2025-03-08 09:30:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:59,522 INFO L225 Difference]: With dead ends: 5410 [2025-03-08 09:30:59,522 INFO L226 Difference]: Without dead ends: 4069 [2025-03-08 09:30:59,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=981, Invalid=4871, Unknown=0, NotChecked=0, Total=5852 [2025-03-08 09:30:59,526 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 9175 mSDsluCounter, 10564 mSDsCounter, 0 mSdLazyCounter, 4157 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9175 SdHoareTripleChecker+Valid, 11284 SdHoareTripleChecker+Invalid, 4178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:59,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9175 Valid, 11284 Invalid, 4178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4157 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 09:30:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2025-03-08 09:30:59,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 2137. [2025-03-08 09:30:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2136 states have (on average 1.4550561797752808) internal successors, (3108), 2136 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3108 transitions. [2025-03-08 09:30:59,554 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3108 transitions. Word has length 308 [2025-03-08 09:30:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:59,554 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 3108 transitions. [2025-03-08 09:30:59,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 24.61764705882353) internal successors, (837), 34 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3108 transitions. [2025-03-08 09:30:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 09:30:59,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:59,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:30:59,569 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-08 09:30:59,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:30:59,757 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:59,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash -975865464, now seen corresponding path program 1 times [2025-03-08 09:30:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666696530] [2025-03-08 09:30:59,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:59,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 09:31:00,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 09:31:00,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:00,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 125 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:01,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:31:01,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666696530] [2025-03-08 09:31:01,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666696530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:31:01,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430868840] [2025-03-08 09:31:01,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:01,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:31:01,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:31:01,544 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-08 09:31:01,545 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-08 09:31:02,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 09:31:02,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 09:31:02,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:02,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:02,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 09:31:02,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:31:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 111 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:02,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:31:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 111 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:02,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430868840] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:31:02,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:31:02,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 23 [2025-03-08 09:31:02,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989490830] [2025-03-08 09:31:02,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:31:02,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 09:31:02,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:31:02,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 09:31:02,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:31:02,958 INFO L87 Difference]: Start difference. First operand 2137 states and 3108 transitions. Second operand has 23 states, 23 states have (on average 30.695652173913043) internal successors, (706), 23 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:31:04,119 INFO L93 Difference]: Finished difference Result 5273 states and 7701 transitions. [2025-03-08 09:31:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 09:31:04,120 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 30.695652173913043) internal successors, (706), 23 states have internal predecessors, (706), 0 states have call successors, (0), 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 308 [2025-03-08 09:31:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:31:04,125 INFO L225 Difference]: With dead ends: 5273 [2025-03-08 09:31:04,125 INFO L226 Difference]: Without dead ends: 3425 [2025-03-08 09:31:04,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=1620, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 09:31:04,128 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 7293 mSDsluCounter, 4125 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7293 SdHoareTripleChecker+Valid, 4680 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 09:31:04,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7293 Valid, 4680 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 09:31:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2025-03-08 09:31:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 2117. [2025-03-08 09:31:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.448015122873346) internal successors, (3064), 2116 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3064 transitions. [2025-03-08 09:31:04,148 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3064 transitions. Word has length 308 [2025-03-08 09:31:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:31:04,148 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 3064 transitions. [2025-03-08 09:31:04,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 30.695652173913043) internal successors, (706), 23 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3064 transitions. [2025-03-08 09:31:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-08 09:31:04,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:31:04,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:31:04,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 09:31:04,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-08 09:31:04,351 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:31:04,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:31:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash 109605258, now seen corresponding path program 1 times [2025-03-08 09:31:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:31:04,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2898350] [2025-03-08 09:31:04,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:04,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:31:04,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-08 09:31:05,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-08 09:31:05,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:05,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 126 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:06,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:31:06,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2898350] [2025-03-08 09:31:06,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2898350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:31:06,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289208976] [2025-03-08 09:31:06,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:06,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:31:06,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:31:06,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:31:06,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 09:31:06,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-08 09:31:07,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-08 09:31:07,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:07,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:07,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 2017 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-08 09:31:07,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:31:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 117 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:07,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:31:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 09:31:08,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289208976] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 09:31:08,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:31:08,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 17] total 26 [2025-03-08 09:31:08,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877363995] [2025-03-08 09:31:08,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:31:08,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:31:08,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:31:08,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:31:08,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-03-08 09:31:08,040 INFO L87 Difference]: Start difference. First operand 2117 states and 3064 transitions. Second operand has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:31:08,287 INFO L93 Difference]: Finished difference Result 4529 states and 6595 transitions. [2025-03-08 09:31:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:31:08,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 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 309 [2025-03-08 09:31:08,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:31:08,291 INFO L225 Difference]: With dead ends: 4529 [2025-03-08 09:31:08,291 INFO L226 Difference]: Without dead ends: 2701 [2025-03-08 09:31:08,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2025-03-08 09:31:08,293 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 286 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:31:08,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 2198 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:31:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-03-08 09:31:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2073. [2025-03-08 09:31:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 2072 states have (on average 1.44980694980695) internal successors, (3004), 2072 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3004 transitions. [2025-03-08 09:31:08,309 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3004 transitions. Word has length 309 [2025-03-08 09:31:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:31:08,309 INFO L471 AbstractCegarLoop]: Abstraction has 2073 states and 3004 transitions. [2025-03-08 09:31:08,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3004 transitions. [2025-03-08 09:31:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-08 09:31:08,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:31:08,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:31:08,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 09:31:08,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:31:08,511 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:31:08,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:31:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1821134523, now seen corresponding path program 1 times [2025-03-08 09:31:08,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:31:08,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759833145] [2025-03-08 09:31:08,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:31:08,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-08 09:31:09,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-08 09:31:09,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:09,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 134 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:11,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:31:11,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759833145] [2025-03-08 09:31:11,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759833145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:31:11,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709076175] [2025-03-08 09:31:11,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:11,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:31:11,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:31:11,572 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:31:11,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 09:31:12,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-08 09:31:12,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-08 09:31:12,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:12,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:12,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 2019 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-08 09:31:12,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:31:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 117 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:13,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:31:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 09:31:13,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709076175] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 09:31:13,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:31:13,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 17] total 31 [2025-03-08 09:31:13,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404579817] [2025-03-08 09:31:13,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:31:13,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:31:13,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:31:13,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:31:13,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2025-03-08 09:31:13,926 INFO L87 Difference]: Start difference. First operand 2073 states and 3004 transitions. Second operand has 7 states, 7 states have (on average 42.42857142857143) internal successors, (297), 7 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:31:14,216 INFO L93 Difference]: Finished difference Result 4633 states and 6755 transitions. [2025-03-08 09:31:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:31:14,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.42857142857143) internal successors, (297), 7 states have internal predecessors, (297), 0 states have call successors, (0), 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 309 [2025-03-08 09:31:14,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:31:14,220 INFO L225 Difference]: With dead ends: 4633 [2025-03-08 09:31:14,220 INFO L226 Difference]: Without dead ends: 2849 [2025-03-08 09:31:14,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2025-03-08 09:31:14,222 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 566 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:31:14,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1855 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:31:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2025-03-08 09:31:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2121. [2025-03-08 09:31:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2120 states have (on average 1.4452830188679244) internal successors, (3064), 2120 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3064 transitions. [2025-03-08 09:31:14,239 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3064 transitions. Word has length 309 [2025-03-08 09:31:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:31:14,240 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 3064 transitions. [2025-03-08 09:31:14,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.42857142857143) internal successors, (297), 7 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3064 transitions. [2025-03-08 09:31:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-08 09:31:14,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:31:14,242 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:31:14,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 09:31:14,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:31:14,447 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:31:14,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:31:14,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1445838530, now seen corresponding path program 1 times [2025-03-08 09:31:14,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:31:14,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152536576] [2025-03-08 09:31:14,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:14,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:31:14,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-08 09:31:15,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-08 09:31:15,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:15,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 126 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:16,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:31:16,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152536576] [2025-03-08 09:31:16,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152536576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:31:16,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700773535] [2025-03-08 09:31:16,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:16,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:31:16,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:31:16,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:31:16,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 09:31:16,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-08 09:31:17,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-08 09:31:17,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:17,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:17,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 2020 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 09:31:17,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:31:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 99 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:17,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:31:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 99 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:18,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700773535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:31:18,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:31:18,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 26 [2025-03-08 09:31:18,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725171543] [2025-03-08 09:31:18,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:31:18,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 09:31:18,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:31:18,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 09:31:18,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-03-08 09:31:18,226 INFO L87 Difference]: Start difference. First operand 2121 states and 3064 transitions. Second operand has 26 states, 26 states have (on average 28.307692307692307) internal successors, (736), 26 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:31:20,241 INFO L93 Difference]: Finished difference Result 7917 states and 11563 transitions. [2025-03-08 09:31:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 09:31:20,241 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 28.307692307692307) internal successors, (736), 26 states have internal predecessors, (736), 0 states have call successors, (0), 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 310 [2025-03-08 09:31:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:31:20,250 INFO L225 Difference]: With dead ends: 7917 [2025-03-08 09:31:20,250 INFO L226 Difference]: Without dead ends: 6085 [2025-03-08 09:31:20,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=672, Invalid=3488, Unknown=0, NotChecked=0, Total=4160 [2025-03-08 09:31:20,255 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 11625 mSDsluCounter, 5833 mSDsCounter, 0 mSdLazyCounter, 2977 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11625 SdHoareTripleChecker+Valid, 6361 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:31:20,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11625 Valid, 6361 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2977 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 09:31:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6085 states. [2025-03-08 09:31:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6085 to 2399. [2025-03-08 09:31:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2398 states have (on average 1.4370308590492076) internal successors, (3446), 2398 states have internal predecessors, (3446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3446 transitions. [2025-03-08 09:31:20,287 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3446 transitions. Word has length 310 [2025-03-08 09:31:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:31:20,287 INFO L471 AbstractCegarLoop]: Abstraction has 2399 states and 3446 transitions. [2025-03-08 09:31:20,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 28.307692307692307) internal successors, (736), 26 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3446 transitions. [2025-03-08 09:31:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-08 09:31:20,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:31:20,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:31:20,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 09:31:20,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-08 09:31:20,491 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:31:20,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:31:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1212711843, now seen corresponding path program 1 times [2025-03-08 09:31:20,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:31:20,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293422505] [2025-03-08 09:31:20,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:20,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:31:20,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-08 09:31:21,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-08 09:31:21,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:21,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 106 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:22,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:31:22,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293422505] [2025-03-08 09:31:22,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293422505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:31:22,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052411857] [2025-03-08 09:31:22,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:22,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:31:22,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:31:22,387 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:31:22,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 09:31:22,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-08 09:31:23,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-08 09:31:23,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:23,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:23,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 2020 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 09:31:23,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:31:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 57 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:23,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:31:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 57 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052411857] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:31:24,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:31:24,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2025-03-08 09:31:24,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080934237] [2025-03-08 09:31:24,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:31:24,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 09:31:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:31:24,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 09:31:24,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-03-08 09:31:24,267 INFO L87 Difference]: Start difference. First operand 2399 states and 3446 transitions. Second operand has 26 states, 26 states have (on average 31.384615384615383) internal successors, (816), 26 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)