./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.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_state_machine.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 9e75acc5dea77a52694df76103c51840072f3a9cdbcfeb4df332aef49d637e9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:30:14,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:30:14,271 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:14,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:30:14,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:30:14,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:30:14,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:30:14,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:30:14,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:30:14,293 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:30:14,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:30:14,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:30:14,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:30:14,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:30:14,294 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:30:14,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:30:14,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:30:14,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:30:14,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:30:14,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:30:14,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:30:14,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:30:14,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:30:14,295 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:30:14,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:30:14,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:30:14,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:30:14,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:30:14,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:30:14,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:30:14,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:30:14,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:30:14,296 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:30:14,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:30:14,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:30:14,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:30:14,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:30:14,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:30:14,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:30:14,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:30:14,297 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 -> 9e75acc5dea77a52694df76103c51840072f3a9cdbcfeb4df332aef49d637e9f [2025-03-08 09:30:14,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:30:14,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:30:14,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:30:14,671 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:30:14,671 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:30:14,672 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_state_machine.c [2025-03-08 09:30:16,525 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2582d72f8/5077ada8b1fd4d50ba0190cefc46f5f1/FLAGd10bb0d54 [2025-03-08 09:30:16,778 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:30:16,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.c [2025-03-08 09:30:16,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2582d72f8/5077ada8b1fd4d50ba0190cefc46f5f1/FLAGd10bb0d54 [2025-03-08 09:30:16,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2582d72f8/5077ada8b1fd4d50ba0190cefc46f5f1 [2025-03-08 09:30:16,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:30:16,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:30:16,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:30:16,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:30:16,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:30:16,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:30:16" (1/1) ... [2025-03-08 09:30:16,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcbc567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:16, skipping insertion in model container [2025-03-08 09:30:16,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:30:16" (1/1) ... [2025-03-08 09:30:16,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:30:16,955 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_state_machine.c[1256,1269] [2025-03-08 09:30:17,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:30:17,147 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:30:17,155 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_state_machine.c[1256,1269] [2025-03-08 09:30:17,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:30:17,258 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:30:17,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:17 WrapperNode [2025-03-08 09:30:17,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:30:17,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:30:17,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:30:17,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:30:17,265 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:17" (1/1) ... [2025-03-08 09:30:17,286 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:17" (1/1) ... [2025-03-08 09:30:17,400 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1678 [2025-03-08 09:30:17,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:30:17,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:30:17,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:30:17,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:30:17,407 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:17" (1/1) ... [2025-03-08 09:30:17,407 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:17" (1/1) ... [2025-03-08 09:30:17,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:17" (1/1) ... [2025-03-08 09:30:17,495 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:17,495 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:17" (1/1) ... [2025-03-08 09:30:17,495 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:17" (1/1) ... [2025-03-08 09:30:17,531 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:17" (1/1) ... [2025-03-08 09:30:17,541 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:17" (1/1) ... [2025-03-08 09:30:17,553 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:17" (1/1) ... [2025-03-08 09:30:17,565 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:17" (1/1) ... [2025-03-08 09:30:17,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:30:17,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:30:17,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:30:17,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:30:17,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:17" (1/1) ... [2025-03-08 09:30:17,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:30:17,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:30:17,655 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:17,659 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:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:30:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:30:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:30:17,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:30:17,846 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:30:17,848 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:30:19,237 INFO L? ?]: Removed 1068 outVars from TransFormulas that were not future-live. [2025-03-08 09:30:19,237 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:30:19,298 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:30:19,299 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:30:19,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:30:19 BoogieIcfgContainer [2025-03-08 09:30:19,299 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:30:19,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:30:19,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:30:19,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:30:19,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:30:16" (1/3) ... [2025-03-08 09:30:19,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f673c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:30:19, skipping insertion in model container [2025-03-08 09:30:19,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:17" (2/3) ... [2025-03-08 09:30:19,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f673c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:30:19, skipping insertion in model container [2025-03-08 09:30:19,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:30:19" (3/3) ... [2025-03-08 09:30:19,305 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_state_machine.c [2025-03-08 09:30:19,326 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:30:19,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_state_machine.c that has 1 procedures, 498 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:30:19,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:30:19,390 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;@73d69420, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:30:19,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:30:19,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 498 states, 496 states have (on average 1.497983870967742) internal successors, (743), 497 states have internal predecessors, (743), 0 states have call successors, (0), 0 states 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,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 09:30:19,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:19,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:19,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:19,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash -7077581, now seen corresponding path program 1 times [2025-03-08 09:30:19,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:19,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999879975] [2025-03-08 09:30:19,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:19,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 09:30:19,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 09:30:19,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:19,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:19,903 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:19,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:19,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999879975] [2025-03-08 09:30:19,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999879975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:19,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:19,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:30:19,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639562901] [2025-03-08 09:30:19,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:19,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:30:19,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:19,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:30:19,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:30:19,926 INFO L87 Difference]: Start difference. First operand has 498 states, 496 states have (on average 1.497983870967742) internal successors, (743), 497 states have internal predecessors, (743), 0 states have call successors, (0), 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 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:20,241 INFO L93 Difference]: Finished difference Result 945 states and 1413 transitions. [2025-03-08 09:30:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:30:20,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-08 09:30:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:20,251 INFO L225 Difference]: With dead ends: 945 [2025-03-08 09:30:20,253 INFO L226 Difference]: Without dead ends: 497 [2025-03-08 09:30:20,258 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:20,262 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 0 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:20,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1840 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-08 09:30:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-03-08 09:30:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.4939516129032258) internal successors, (741), 496 states have internal predecessors, (741), 0 states have call successors, (0), 0 states 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,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 741 transitions. [2025-03-08 09:30:20,314 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 741 transitions. Word has length 33 [2025-03-08 09:30:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:20,314 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 741 transitions. [2025-03-08 09:30:20,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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,314 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 741 transitions. [2025-03-08 09:30:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 09:30:20,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:20,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:20,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:30:20,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:20,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:20,316 INFO L85 PathProgramCache]: Analyzing trace with hash -214725110, now seen corresponding path program 1 times [2025-03-08 09:30:20,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:20,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231824324] [2025-03-08 09:30:20,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:20,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:20,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 09:30:20,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 09:30:20,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:20,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:20,445 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:20,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:20,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231824324] [2025-03-08 09:30:20,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231824324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:20,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:20,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:30:20,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266862843] [2025-03-08 09:30:20,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:20,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:30:20,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:20,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:30:20,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:30:20,448 INFO L87 Difference]: Start difference. First operand 497 states and 741 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:20,732 INFO L93 Difference]: Finished difference Result 946 states and 1411 transitions. [2025-03-08 09:30:20,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:30:20,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-08 09:30:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:20,736 INFO L225 Difference]: With dead ends: 946 [2025-03-08 09:30:20,738 INFO L226 Difference]: Without dead ends: 499 [2025-03-08 09:30:20,738 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:20,739 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 0 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:20,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1837 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:20,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-08 09:30:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2025-03-08 09:30:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.4919678714859437) internal successors, (743), 498 states have internal predecessors, (743), 0 states have call successors, (0), 0 states 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,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 743 transitions. [2025-03-08 09:30:20,762 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 743 transitions. Word has length 34 [2025-03-08 09:30:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:20,762 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 743 transitions. [2025-03-08 09:30:20,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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,763 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 743 transitions. [2025-03-08 09:30:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 09:30:20,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:20,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:20,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:30:20,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:20,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:20,767 INFO L85 PathProgramCache]: Analyzing trace with hash -430001138, now seen corresponding path program 1 times [2025-03-08 09:30:20,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:20,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675970623] [2025-03-08 09:30:20,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:20,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:20,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 09:30:20,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 09:30:20,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:20,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:20,935 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:20,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:20,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675970623] [2025-03-08 09:30:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675970623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:20,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:20,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:20,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074785198] [2025-03-08 09:30:20,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:20,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:20,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:20,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:20,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:20,937 INFO L87 Difference]: Start difference. First operand 499 states and 743 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:21,288 INFO L93 Difference]: Finished difference Result 1355 states and 2020 transitions. [2025-03-08 09:30:21,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:21,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-08 09:30:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:21,294 INFO L225 Difference]: With dead ends: 1355 [2025-03-08 09:30:21,296 INFO L226 Difference]: Without dead ends: 906 [2025-03-08 09:30:21,297 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:21,298 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1927 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1927 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:21,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1927 Valid, 1804 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-03-08 09:30:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 501. [2025-03-08 09:30:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.49) internal successors, (745), 500 states have internal predecessors, (745), 0 states have call successors, (0), 0 states 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,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 745 transitions. [2025-03-08 09:30:21,324 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 745 transitions. Word has length 35 [2025-03-08 09:30:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:21,325 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 745 transitions. [2025-03-08 09:30:21,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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,326 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 745 transitions. [2025-03-08 09:30:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-08 09:30:21,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:21,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:21,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:30:21,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:21,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:21,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1209406754, now seen corresponding path program 1 times [2025-03-08 09:30:21,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:21,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130919507] [2025-03-08 09:30:21,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:21,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:21,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-08 09:30:22,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-08 09:30:22,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:22,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:23,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:23,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:23,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130919507] [2025-03-08 09:30:23,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130919507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:23,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:23,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:23,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821557259] [2025-03-08 09:30:23,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:23,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:23,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:23,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:23,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:23,004 INFO L87 Difference]: Start difference. First operand 501 states and 745 transitions. Second operand has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:23,359 INFO L93 Difference]: Finished difference Result 1326 states and 1976 transitions. [2025-03-08 09:30:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:23,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2025-03-08 09:30:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:23,362 INFO L225 Difference]: With dead ends: 1326 [2025-03-08 09:30:23,363 INFO L226 Difference]: Without dead ends: 877 [2025-03-08 09:30:23,363 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,365 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 1826 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:23,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1826 Valid, 1778 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-08 09:30:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 520. [2025-03-08 09:30:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 1.4836223506743738) internal successors, (770), 519 states have internal predecessors, (770), 0 states have call successors, (0), 0 states 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,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 770 transitions. [2025-03-08 09:30:23,384 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 770 transitions. Word has length 258 [2025-03-08 09:30:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:23,384 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 770 transitions. [2025-03-08 09:30:23,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 770 transitions. [2025-03-08 09:30:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-08 09:30:23,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:23,388 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:23,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:30:23,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:23,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:23,391 INFO L85 PathProgramCache]: Analyzing trace with hash 585349720, now seen corresponding path program 1 times [2025-03-08 09:30:23,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:23,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264752654] [2025-03-08 09:30:23,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:23,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:23,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-08 09:30:24,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-08 09:30:24,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:24,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:25,169 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:25,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:25,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264752654] [2025-03-08 09:30:25,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264752654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:25,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:25,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:25,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116173756] [2025-03-08 09:30:25,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:25,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:25,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:25,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:25,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:25,173 INFO L87 Difference]: Start difference. First operand 520 states and 770 transitions. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:25,510 INFO L93 Difference]: Finished difference Result 1326 states and 1974 transitions. [2025-03-08 09:30:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:25,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2025-03-08 09:30:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:25,514 INFO L225 Difference]: With dead ends: 1326 [2025-03-08 09:30:25,514 INFO L226 Difference]: Without dead ends: 877 [2025-03-08 09:30:25,515 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:25,517 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1784 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1784 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:25,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1784 Valid, 1797 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:25,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-08 09:30:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 595. [2025-03-08 09:30:25,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4831649831649831) internal successors, (881), 594 states have internal predecessors, (881), 0 states have call successors, (0), 0 states 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,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 881 transitions. [2025-03-08 09:30:25,538 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 881 transitions. Word has length 259 [2025-03-08 09:30:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:25,538 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 881 transitions. [2025-03-08 09:30:25,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 881 transitions. [2025-03-08 09:30:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-08 09:30:25,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:25,541 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:25,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:30:25,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:25,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash -872532500, now seen corresponding path program 1 times [2025-03-08 09:30:25,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:25,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384778766] [2025-03-08 09:30:25,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:25,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:25,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-08 09:30:26,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-08 09:30:26,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:26,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:26,965 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,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:26,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384778766] [2025-03-08 09:30:26,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384778766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:26,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:26,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:26,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062603974] [2025-03-08 09:30:26,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:26,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:26,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:26,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:26,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:26,967 INFO L87 Difference]: Start difference. First operand 595 states and 881 transitions. Second operand has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:27,338 INFO L93 Difference]: Finished difference Result 1326 states and 1972 transitions. [2025-03-08 09:30:27,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:27,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-03-08 09:30:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:27,342 INFO L225 Difference]: With dead ends: 1326 [2025-03-08 09:30:27,342 INFO L226 Difference]: Without dead ends: 877 [2025-03-08 09:30:27,343 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,344 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1746 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:27,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 1796 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-08 09:30:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 662. [2025-03-08 09:30:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4826021180030258) internal successors, (980), 661 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 980 transitions. [2025-03-08 09:30:27,368 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 980 transitions. Word has length 261 [2025-03-08 09:30:27,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:27,369 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 980 transitions. [2025-03-08 09:30:27,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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,370 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 980 transitions. [2025-03-08 09:30:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-08 09:30:27,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:27,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:27,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:30:27,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:27,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:27,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1949068094, now seen corresponding path program 1 times [2025-03-08 09:30:27,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:27,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326630293] [2025-03-08 09:30:27,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:27,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-08 09:30:28,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-08 09:30:28,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:28,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:28,637 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,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326630293] [2025-03-08 09:30:28,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326630293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:28,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:28,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:28,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847174214] [2025-03-08 09:30:28,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:28,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:28,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:28,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:28,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:28,640 INFO L87 Difference]: Start difference. First operand 662 states and 980 transitions. Second operand has 5 states, 5 states have (on average 52.4) internal successors, (262), 5 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:28,972 INFO L93 Difference]: Finished difference Result 1326 states and 1971 transitions. [2025-03-08 09:30:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:28,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.4) internal successors, (262), 5 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2025-03-08 09:30:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:28,976 INFO L225 Difference]: With dead ends: 1326 [2025-03-08 09:30:28,976 INFO L226 Difference]: Without dead ends: 877 [2025-03-08 09:30:28,976 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:28,977 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1707 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:28,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 1796 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-08 09:30:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 734. [2025-03-08 09:30:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.4829467939972716) internal successors, (1087), 733 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states 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:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1087 transitions. [2025-03-08 09:30:28,993 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1087 transitions. Word has length 262 [2025-03-08 09:30:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:28,994 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1087 transitions. [2025-03-08 09:30:28,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.4) internal successors, (262), 5 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1087 transitions. [2025-03-08 09:30:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-08 09:30:28,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:28,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:28,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 09:30:28,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:28,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:28,997 INFO L85 PathProgramCache]: Analyzing trace with hash -464612154, now seen corresponding path program 1 times [2025-03-08 09:30:28,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:28,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595493269] [2025-03-08 09:30:28,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:28,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:29,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-08 09:30:29,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-08 09:30:29,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:29,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:30,219 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:30,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595493269] [2025-03-08 09:30:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595493269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:30,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:30,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147317201] [2025-03-08 09:30:30,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:30,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:30,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:30,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:30,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:30,221 INFO L87 Difference]: Start difference. First operand 734 states and 1087 transitions. Second operand has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:30,559 INFO L93 Difference]: Finished difference Result 1326 states and 1970 transitions. [2025-03-08 09:30:30,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:30,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2025-03-08 09:30:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:30,562 INFO L225 Difference]: With dead ends: 1326 [2025-03-08 09:30:30,562 INFO L226 Difference]: Without dead ends: 877 [2025-03-08 09:30:30,563 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:30,563 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1686 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:30,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 1796 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-08 09:30:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 770. [2025-03-08 09:30:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.482444733420026) internal successors, (1140), 769 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states 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:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1140 transitions. [2025-03-08 09:30:30,579 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1140 transitions. Word has length 263 [2025-03-08 09:30:30,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:30,579 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1140 transitions. [2025-03-08 09:30:30,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1140 transitions. [2025-03-08 09:30:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-08 09:30:30,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:30,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:30,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 09:30:30,583 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:30,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:30,584 INFO L85 PathProgramCache]: Analyzing trace with hash -742832021, now seen corresponding path program 1 times [2025-03-08 09:30:30,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:30,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864776437] [2025-03-08 09:30:30,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:30,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:30,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-08 09:30:31,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-08 09:30:31,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:31,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:31,740 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:31,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:31,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864776437] [2025-03-08 09:30:31,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864776437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:31,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:31,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:31,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559991738] [2025-03-08 09:30:31,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:31,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:31,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:31,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:31,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:31,743 INFO L87 Difference]: Start difference. First operand 770 states and 1140 transitions. Second operand has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:32,192 INFO L93 Difference]: Finished difference Result 1420 states and 2109 transitions. [2025-03-08 09:30:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:32,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2025-03-08 09:30:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:32,196 INFO L225 Difference]: With dead ends: 1420 [2025-03-08 09:30:32,197 INFO L226 Difference]: Without dead ends: 941 [2025-03-08 09:30:32,197 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:32,200 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1893 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1893 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:32,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1893 Valid, 2834 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:30:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-08 09:30:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 772. [2025-03-08 09:30:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 1.4811932555123217) internal successors, (1142), 771 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states 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:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1142 transitions. [2025-03-08 09:30:32,216 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1142 transitions. Word has length 264 [2025-03-08 09:30:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:32,217 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1142 transitions. [2025-03-08 09:30:32,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1142 transitions. [2025-03-08 09:30:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-08 09:30:32,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:32,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:32,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 09:30:32,219 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:32,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1743455858, now seen corresponding path program 1 times [2025-03-08 09:30:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:32,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965427309] [2025-03-08 09:30:32,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:32,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:32,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-08 09:30:32,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-08 09:30:32,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:32,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:33,247 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,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:33,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965427309] [2025-03-08 09:30:33,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965427309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:33,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:33,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:33,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596734896] [2025-03-08 09:30:33,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:33,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:33,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:33,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:33,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:33,249 INFO L87 Difference]: Start difference. First operand 772 states and 1142 transitions. Second operand has 7 states, 7 states have (on average 37.857142857142854) internal successors, (265), 7 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:33,701 INFO L93 Difference]: Finished difference Result 1392 states and 2067 transitions. [2025-03-08 09:30:33,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:33,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.857142857142854) internal successors, (265), 7 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-03-08 09:30:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:33,704 INFO L225 Difference]: With dead ends: 1392 [2025-03-08 09:30:33,704 INFO L226 Difference]: Without dead ends: 943 [2025-03-08 09:30:33,705 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:33,706 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1872 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 2982 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:33,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1872 Valid, 2982 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:30:33,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-08 09:30:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 775. [2025-03-08 09:30:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 774 states have (on average 1.4806201550387597) internal successors, (1146), 774 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states 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,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1146 transitions. [2025-03-08 09:30:33,719 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1146 transitions. Word has length 265 [2025-03-08 09:30:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:33,720 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1146 transitions. [2025-03-08 09:30:33,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.857142857142854) internal successors, (265), 7 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1146 transitions. [2025-03-08 09:30:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-08 09:30:33,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:33,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:33,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 09:30:33,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:33,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2052343064, now seen corresponding path program 1 times [2025-03-08 09:30:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:33,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726283695] [2025-03-08 09:30:33,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:33,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:33,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 09:30:34,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 09:30:34,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:34,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:34,862 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,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:34,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726283695] [2025-03-08 09:30:34,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726283695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:34,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:34,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:34,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428823446] [2025-03-08 09:30:34,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:34,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:34,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:34,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:34,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:34,865 INFO L87 Difference]: Start difference. First operand 775 states and 1146 transitions. Second operand has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:35,187 INFO L93 Difference]: Finished difference Result 1405 states and 2082 transitions. [2025-03-08 09:30:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:35,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 0 states have call successors, (0), 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 266 [2025-03-08 09:30:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:35,191 INFO L225 Difference]: With dead ends: 1405 [2025-03-08 09:30:35,192 INFO L226 Difference]: Without dead ends: 881 [2025-03-08 09:30:35,192 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:35,193 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1721 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:35,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 1796 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-08 09:30:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 775. [2025-03-08 09:30:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 774 states have (on average 1.479328165374677) internal successors, (1145), 774 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states 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,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1145 transitions. [2025-03-08 09:30:35,209 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1145 transitions. Word has length 266 [2025-03-08 09:30:35,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:35,209 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1145 transitions. [2025-03-08 09:30:35,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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,210 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1145 transitions. [2025-03-08 09:30:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-08 09:30:35,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:35,212 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:35,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 09:30:35,213 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:35,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1683440643, now seen corresponding path program 1 times [2025-03-08 09:30:35,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:35,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879342539] [2025-03-08 09:30:35,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:35,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:35,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-08 09:30:35,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-08 09:30:35,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:35,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:36,152 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:36,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:36,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879342539] [2025-03-08 09:30:36,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879342539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:36,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:36,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:36,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115663163] [2025-03-08 09:30:36,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:36,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:36,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:36,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:36,154 INFO L87 Difference]: Start difference. First operand 775 states and 1145 transitions. Second operand has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:36,582 INFO L93 Difference]: Finished difference Result 1465 states and 2171 transitions. [2025-03-08 09:30:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:36,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 267 [2025-03-08 09:30:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:36,585 INFO L225 Difference]: With dead ends: 1465 [2025-03-08 09:30:36,585 INFO L226 Difference]: Without dead ends: 945 [2025-03-08 09:30:36,587 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:36,588 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1909 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1909 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:36,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1909 Valid, 2832 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:30:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-08 09:30:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 777. [2025-03-08 09:30:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 776 states have (on average 1.4780927835051547) internal successors, (1147), 776 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states 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:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1147 transitions. [2025-03-08 09:30:36,601 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1147 transitions. Word has length 267 [2025-03-08 09:30:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:36,602 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1147 transitions. [2025-03-08 09:30:36,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1147 transitions. [2025-03-08 09:30:36,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-08 09:30:36,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:36,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:36,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 09:30:36,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:36,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:36,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1650543731, now seen corresponding path program 1 times [2025-03-08 09:30:36,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:36,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173101582] [2025-03-08 09:30:36,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:36,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:36,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 09:30:37,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 09:30:37,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:37,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:30:37,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:37,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173101582] [2025-03-08 09:30:37,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173101582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:37,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:37,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478813793] [2025-03-08 09:30:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:37,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:37,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:37,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:37,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:37,774 INFO L87 Difference]: Start difference. First operand 777 states and 1147 transitions. Second operand has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 7 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:38,182 INFO L93 Difference]: Finished difference Result 1344 states and 1992 transitions. [2025-03-08 09:30:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:38,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 7 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2025-03-08 09:30:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:38,186 INFO L225 Difference]: With dead ends: 1344 [2025-03-08 09:30:38,186 INFO L226 Difference]: Without dead ends: 895 [2025-03-08 09:30:38,187 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:38,187 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1710 mSDsluCounter, 2249 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:38,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 2848 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:30:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-08 09:30:38,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 783. [2025-03-08 09:30:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4769820971867007) internal successors, (1155), 782 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states 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:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1155 transitions. [2025-03-08 09:30:38,202 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1155 transitions. Word has length 268 [2025-03-08 09:30:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:38,203 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1155 transitions. [2025-03-08 09:30:38,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 7 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1155 transitions. [2025-03-08 09:30:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-08 09:30:38,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:38,205 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:38,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 09:30:38,206 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:38,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1101293140, now seen corresponding path program 1 times [2025-03-08 09:30:38,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:38,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161093327] [2025-03-08 09:30:38,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:38,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:38,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 09:30:38,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 09:30:38,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:38,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:39,320 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:39,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:39,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161093327] [2025-03-08 09:30:39,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161093327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:39,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:39,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:39,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974984638] [2025-03-08 09:30:39,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:39,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:39,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:39,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:39,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:39,323 INFO L87 Difference]: Start difference. First operand 783 states and 1155 transitions. Second operand has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 7 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:39,707 INFO L93 Difference]: Finished difference Result 1381 states and 2044 transitions. [2025-03-08 09:30:39,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:39,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 7 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2025-03-08 09:30:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:39,711 INFO L225 Difference]: With dead ends: 1381 [2025-03-08 09:30:39,711 INFO L226 Difference]: Without dead ends: 897 [2025-03-08 09:30:39,712 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:39,712 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1730 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:39,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1730 Valid, 2708 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2025-03-08 09:30:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 785. [2025-03-08 09:30:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 784 states have (on average 1.475765306122449) internal successors, (1157), 784 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states 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:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1157 transitions. [2025-03-08 09:30:39,724 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1157 transitions. Word has length 268 [2025-03-08 09:30:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:39,724 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1157 transitions. [2025-03-08 09:30:39,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 7 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1157 transitions. [2025-03-08 09:30:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-08 09:30:39,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:39,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:39,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 09:30:39,726 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:39,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash 458188778, now seen corresponding path program 1 times [2025-03-08 09:30:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:39,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206430202] [2025-03-08 09:30:39,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:39,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 09:30:40,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 09:30:40,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:40,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:40,669 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:40,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:40,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206430202] [2025-03-08 09:30:40,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206430202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:40,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:40,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:40,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251857696] [2025-03-08 09:30:40,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:40,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:40,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:40,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:40,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:40,670 INFO L87 Difference]: Start difference. First operand 785 states and 1157 transitions. Second operand has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:40,974 INFO L93 Difference]: Finished difference Result 1336 states and 1978 transitions. [2025-03-08 09:30:40,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:40,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2025-03-08 09:30:40,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:40,977 INFO L225 Difference]: With dead ends: 1336 [2025-03-08 09:30:40,977 INFO L226 Difference]: Without dead ends: 887 [2025-03-08 09:30:40,979 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:40,979 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1641 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:40,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1641 Valid, 1796 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:40,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-03-08 09:30:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 852. [2025-03-08 09:30:40,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.4759106933019976) internal successors, (1256), 851 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states 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,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1256 transitions. [2025-03-08 09:30:40,991 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1256 transitions. Word has length 268 [2025-03-08 09:30:40,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:40,991 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1256 transitions. [2025-03-08 09:30:40,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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,992 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1256 transitions. [2025-03-08 09:30:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-08 09:30:40,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:40,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:40,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 09:30:40,993 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:40,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash 139257313, now seen corresponding path program 1 times [2025-03-08 09:30:40,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:40,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327672231] [2025-03-08 09:30:40,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:40,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:41,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-08 09:30:41,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-08 09:30:41,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:41,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:42,159 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:42,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:42,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327672231] [2025-03-08 09:30:42,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327672231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:42,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:42,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:42,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918214961] [2025-03-08 09:30:42,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:42,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:42,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:42,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:42,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:42,162 INFO L87 Difference]: Start difference. First operand 852 states and 1256 transitions. Second operand has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:42,479 INFO L93 Difference]: Finished difference Result 1339 states and 1982 transitions. [2025-03-08 09:30:42,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:42,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2025-03-08 09:30:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:42,483 INFO L225 Difference]: With dead ends: 1339 [2025-03-08 09:30:42,483 INFO L226 Difference]: Without dead ends: 890 [2025-03-08 09:30:42,483 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:42,484 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1626 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:42,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 1793 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2025-03-08 09:30:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2025-03-08 09:30:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 887 states have (on average 1.47576099210823) internal successors, (1309), 887 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states 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:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1309 transitions. [2025-03-08 09:30:42,495 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1309 transitions. Word has length 269 [2025-03-08 09:30:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:42,495 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1309 transitions. [2025-03-08 09:30:42,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1309 transitions. [2025-03-08 09:30:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 09:30:42,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:42,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:42,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 09:30:42,497 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:42,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:42,498 INFO L85 PathProgramCache]: Analyzing trace with hash -754374985, now seen corresponding path program 1 times [2025-03-08 09:30:42,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:42,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637634359] [2025-03-08 09:30:42,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:42,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:42,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 09:30:42,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 09:30:42,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:42,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:43,453 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:43,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:43,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637634359] [2025-03-08 09:30:43,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637634359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:43,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:43,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:43,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613440047] [2025-03-08 09:30:43,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:43,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:43,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:43,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:43,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:43,454 INFO L87 Difference]: Start difference. First operand 888 states and 1309 transitions. Second operand has 7 states, 7 states have (on average 38.57142857142857) internal successors, (270), 7 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:43,820 INFO L93 Difference]: Finished difference Result 1430 states and 2116 transitions. [2025-03-08 09:30:43,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:43,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.57142857142857) internal successors, (270), 7 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2025-03-08 09:30:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:43,823 INFO L225 Difference]: With dead ends: 1430 [2025-03-08 09:30:43,823 INFO L226 Difference]: Without dead ends: 951 [2025-03-08 09:30:43,823 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:43,824 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1827 mSDsluCounter, 2231 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1827 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:43,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1827 Valid, 2828 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-08 09:30:43,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 890. [2025-03-08 09:30:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.4746906636670416) internal successors, (1311), 889 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states 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:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1311 transitions. [2025-03-08 09:30:43,833 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1311 transitions. Word has length 270 [2025-03-08 09:30:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:43,833 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1311 transitions. [2025-03-08 09:30:43,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.57142857142857) internal successors, (270), 7 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1311 transitions. [2025-03-08 09:30:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-08 09:30:43,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:43,835 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:43,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 09:30:43,835 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:43,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash -455467319, now seen corresponding path program 1 times [2025-03-08 09:30:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:43,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784814028] [2025-03-08 09:30:43,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:43,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-08 09:30:44,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-08 09:30:44,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:44,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:44,753 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:44,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:44,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784814028] [2025-03-08 09:30:44,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784814028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:44,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:44,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:44,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848340472] [2025-03-08 09:30:44,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:44,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:44,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:44,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:44,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:44,754 INFO L87 Difference]: Start difference. First operand 890 states and 1311 transitions. Second operand has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:44,998 INFO L93 Difference]: Finished difference Result 1411 states and 2085 transitions. [2025-03-08 09:30:44,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:44,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2025-03-08 09:30:44,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:45,001 INFO L225 Difference]: With dead ends: 1411 [2025-03-08 09:30:45,001 INFO L226 Difference]: Without dead ends: 890 [2025-03-08 09:30:45,002 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:45,002 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1657 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1657 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:45,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1657 Valid, 1796 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2025-03-08 09:30:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2025-03-08 09:30:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.4735658042744657) internal successors, (1310), 889 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states 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:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1310 transitions. [2025-03-08 09:30:45,011 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1310 transitions. Word has length 271 [2025-03-08 09:30:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:45,012 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1310 transitions. [2025-03-08 09:30:45,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:30:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1310 transitions. [2025-03-08 09:30:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 09:30:45,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:45,013 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:45,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 09:30:45,014 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:45,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:45,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2109121343, now seen corresponding path program 1 times [2025-03-08 09:30:45,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:45,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721792489] [2025-03-08 09:30:45,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:45,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 09:30:45,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 09:30:45,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:45,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:45,964 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:45,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:45,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721792489] [2025-03-08 09:30:45,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721792489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:45,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:45,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:45,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587879819] [2025-03-08 09:30:45,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:45,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:45,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:45,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:45,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:45,965 INFO L87 Difference]: Start difference. First operand 890 states and 1310 transitions. Second operand has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 7 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:46,292 INFO L93 Difference]: Finished difference Result 1470 states and 2172 transitions. [2025-03-08 09:30:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:46,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 7 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-03-08 09:30:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:46,295 INFO L225 Difference]: With dead ends: 1470 [2025-03-08 09:30:46,295 INFO L226 Difference]: Without dead ends: 953 [2025-03-08 09:30:46,295 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:46,296 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1843 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:46,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1843 Valid, 2826 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-08 09:30:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 892. [2025-03-08 09:30:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 1.4725028058361391) internal successors, (1312), 891 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states 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:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1312 transitions. [2025-03-08 09:30:46,305 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1312 transitions. Word has length 272 [2025-03-08 09:30:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:46,305 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1312 transitions. [2025-03-08 09:30:46,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 7 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1312 transitions. [2025-03-08 09:30:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-08 09:30:46,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:46,307 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:46,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 09:30:46,308 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:46,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:46,308 INFO L85 PathProgramCache]: Analyzing trace with hash -337359388, now seen corresponding path program 1 times [2025-03-08 09:30:46,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:46,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126989284] [2025-03-08 09:30:46,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:46,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-08 09:30:46,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-08 09:30:46,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:46,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:47,200 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:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:47,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126989284] [2025-03-08 09:30:47,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126989284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:47,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:47,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527671249] [2025-03-08 09:30:47,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:47,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:47,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:47,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:47,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:47,202 INFO L87 Difference]: Start difference. First operand 892 states and 1312 transitions. Second operand has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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:47,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:47,541 INFO L93 Difference]: Finished difference Result 1416 states and 2090 transitions. [2025-03-08 09:30:47,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:47,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-03-08 09:30:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:47,544 INFO L225 Difference]: With dead ends: 1416 [2025-03-08 09:30:47,544 INFO L226 Difference]: Without dead ends: 903 [2025-03-08 09:30:47,545 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:47,545 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1683 mSDsluCounter, 2389 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:47,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 2988 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:47,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-03-08 09:30:47,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 894. [2025-03-08 09:30:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.471444568868981) internal successors, (1314), 893 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states 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:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1314 transitions. [2025-03-08 09:30:47,558 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1314 transitions. Word has length 273 [2025-03-08 09:30:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:47,558 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1314 transitions. [2025-03-08 09:30:47,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1314 transitions. [2025-03-08 09:30:47,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-08 09:30:47,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:47,560 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:47,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 09:30:47,561 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:47,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:47,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1869751997, now seen corresponding path program 1 times [2025-03-08 09:30:47,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:47,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255090390] [2025-03-08 09:30:47,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:47,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:47,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-08 09:30:48,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-08 09:30:48,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:48,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:48,630 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:48,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:48,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255090390] [2025-03-08 09:30:48,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255090390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:48,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:48,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:48,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275298344] [2025-03-08 09:30:48,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:48,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:48,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:48,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:48,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:48,631 INFO L87 Difference]: Start difference. First operand 894 states and 1314 transitions. Second operand has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:48,924 INFO L93 Difference]: Finished difference Result 1380 states and 2037 transitions. [2025-03-08 09:30:48,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:48,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-03-08 09:30:48,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:48,926 INFO L225 Difference]: With dead ends: 1380 [2025-03-08 09:30:48,926 INFO L226 Difference]: Without dead ends: 905 [2025-03-08 09:30:48,927 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:48,927 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1664 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:48,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1664 Valid, 2845 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-03-08 09:30:48,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 896. [2025-03-08 09:30:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 895 states have (on average 1.470391061452514) internal successors, (1316), 895 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states 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,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1316 transitions. [2025-03-08 09:30:48,935 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1316 transitions. Word has length 273 [2025-03-08 09:30:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:48,936 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1316 transitions. [2025-03-08 09:30:48,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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,936 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1316 transitions. [2025-03-08 09:30:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-08 09:30:48,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:48,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:48,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 09:30:48,937 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:48,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1100665294, now seen corresponding path program 1 times [2025-03-08 09:30:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:48,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134313128] [2025-03-08 09:30:48,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:48,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-08 09:30:49,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-08 09:30:49,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:49,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:49,896 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:49,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134313128] [2025-03-08 09:30:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134313128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:49,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515440139] [2025-03-08 09:30:49,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:49,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:49,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:49,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:49,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:49,897 INFO L87 Difference]: Start difference. First operand 896 states and 1316 transitions. Second operand has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:50,216 INFO L93 Difference]: Finished difference Result 1408 states and 2079 transitions. [2025-03-08 09:30:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:50,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-03-08 09:30:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:50,218 INFO L225 Difference]: With dead ends: 1408 [2025-03-08 09:30:50,218 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 09:30:50,219 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:50,221 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1802 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1802 SdHoareTripleChecker+Valid, 2982 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:50,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1802 Valid, 2982 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:50,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 09:30:50,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 899. [2025-03-08 09:30:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 1.469933184855234) internal successors, (1320), 898 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states 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:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1320 transitions. [2025-03-08 09:30:50,231 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1320 transitions. Word has length 273 [2025-03-08 09:30:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:50,231 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1320 transitions. [2025-03-08 09:30:50,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1320 transitions. [2025-03-08 09:30:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-08 09:30:50,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:50,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:50,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 09:30:50,233 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:50,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1287093387, now seen corresponding path program 1 times [2025-03-08 09:30:50,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:50,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641220250] [2025-03-08 09:30:50,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:50,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:50,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-08 09:30:50,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-08 09:30:50,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:50,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:51,185 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:51,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:51,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641220250] [2025-03-08 09:30:51,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641220250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:51,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:51,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:30:51,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314811771] [2025-03-08 09:30:51,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:51,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:30:51,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:51,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:30:51,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:30:51,186 INFO L87 Difference]: Start difference. First operand 899 states and 1320 transitions. Second operand has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:51,511 INFO L93 Difference]: Finished difference Result 1358 states and 2003 transitions. [2025-03-08 09:30:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:30:51,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-03-08 09:30:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:51,513 INFO L225 Difference]: With dead ends: 1358 [2025-03-08 09:30:51,513 INFO L226 Difference]: Without dead ends: 909 [2025-03-08 09:30:51,516 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:51,516 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1639 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:51,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 2705 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:51,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-03-08 09:30:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 905. [2025-03-08 09:30:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 1.4690265486725664) internal successors, (1328), 904 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1328 transitions. [2025-03-08 09:30:51,524 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1328 transitions. Word has length 274 [2025-03-08 09:30:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:51,524 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1328 transitions. [2025-03-08 09:30:51,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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,525 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1328 transitions. [2025-03-08 09:30:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-08 09:30:51,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:51,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:51,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 09:30:51,526 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:51,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:51,526 INFO L85 PathProgramCache]: Analyzing trace with hash 687139612, now seen corresponding path program 1 times [2025-03-08 09:30:51,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:51,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547292128] [2025-03-08 09:30:51,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:51,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:51,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-08 09:30:52,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-08 09:30:52,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:52,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:52,673 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:52,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:52,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547292128] [2025-03-08 09:30:52,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547292128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:52,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:52,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 09:30:52,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488576973] [2025-03-08 09:30:52,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:52,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 09:30:52,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:52,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 09:30:52,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:30:52,675 INFO L87 Difference]: Start difference. First operand 905 states and 1328 transitions. Second operand has 9 states, 9 states have (on average 30.444444444444443) internal successors, (274), 9 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:53,209 INFO L93 Difference]: Finished difference Result 1731 states and 2543 transitions. [2025-03-08 09:30:53,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:30:53,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.444444444444443) internal successors, (274), 9 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-03-08 09:30:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:53,211 INFO L225 Difference]: With dead ends: 1731 [2025-03-08 09:30:53,211 INFO L226 Difference]: Without dead ends: 908 [2025-03-08 09:30:53,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:30:53,212 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1824 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1824 SdHoareTripleChecker+Valid, 3595 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:53,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1824 Valid, 3595 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:30:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-03-08 09:30:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2025-03-08 09:30:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 1.4674751929437706) internal successors, (1331), 907 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states 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:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1331 transitions. [2025-03-08 09:30:53,224 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1331 transitions. Word has length 274 [2025-03-08 09:30:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:53,224 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1331 transitions. [2025-03-08 09:30:53,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.444444444444443) internal successors, (274), 9 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1331 transitions. [2025-03-08 09:30:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 09:30:53,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:53,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:53,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 09:30:53,226 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:53,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:53,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1564054796, now seen corresponding path program 1 times [2025-03-08 09:30:53,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:53,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866228034] [2025-03-08 09:30:53,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:53,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 09:30:53,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 09:30:53,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:53,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:53,672 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:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866228034] [2025-03-08 09:30:53,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866228034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:53,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:53,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:53,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946129465] [2025-03-08 09:30:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:53,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:53,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:53,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:53,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:53,673 INFO L87 Difference]: Start difference. First operand 908 states and 1331 transitions. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:53,891 INFO L93 Difference]: Finished difference Result 1780 states and 2614 transitions. [2025-03-08 09:30:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:53,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2025-03-08 09:30:53,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:53,893 INFO L225 Difference]: With dead ends: 1780 [2025-03-08 09:30:53,893 INFO L226 Difference]: Without dead ends: 952 [2025-03-08 09:30:53,894 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:53,894 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 1956 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1956 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:53,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1956 Valid, 1798 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-03-08 09:30:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 902. [2025-03-08 09:30:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.4661487236403996) internal successors, (1321), 901 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states 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:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1321 transitions. [2025-03-08 09:30:53,902 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1321 transitions. Word has length 275 [2025-03-08 09:30:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:53,902 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1321 transitions. [2025-03-08 09:30:53,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1321 transitions. [2025-03-08 09:30:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 09:30:53,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:53,904 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:53,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 09:30:53,904 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:53,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1058151321, now seen corresponding path program 1 times [2025-03-08 09:30:53,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:53,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407292584] [2025-03-08 09:30:53,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:53,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:53,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 09:30:54,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 09:30:54,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:54,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:55,434 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:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:55,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407292584] [2025-03-08 09:30:55,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407292584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:55,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:55,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:55,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576572255] [2025-03-08 09:30:55,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:55,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:55,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:55,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:55,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:55,437 INFO L87 Difference]: Start difference. First operand 902 states and 1321 transitions. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:55,729 INFO L93 Difference]: Finished difference Result 1770 states and 2598 transitions. [2025-03-08 09:30:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:55,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2025-03-08 09:30:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:55,731 INFO L225 Difference]: With dead ends: 1770 [2025-03-08 09:30:55,731 INFO L226 Difference]: Without dead ends: 956 [2025-03-08 09:30:55,732 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:55,732 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1961 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1961 SdHoareTripleChecker+Valid, 1801 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:55,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1961 Valid, 1801 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-03-08 09:30:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 902. [2025-03-08 09:30:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.46503884572697) internal successors, (1320), 901 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states 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:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1320 transitions. [2025-03-08 09:30:55,740 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1320 transitions. Word has length 275 [2025-03-08 09:30:55,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:55,740 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1320 transitions. [2025-03-08 09:30:55,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1320 transitions. [2025-03-08 09:30:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-08 09:30:55,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:55,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:55,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 09:30:55,741 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:55,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:55,742 INFO L85 PathProgramCache]: Analyzing trace with hash -962940046, now seen corresponding path program 1 times [2025-03-08 09:30:55,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:55,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863582467] [2025-03-08 09:30:55,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:55,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:55,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-08 09:30:55,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-08 09:30:55,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:55,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:56,206 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:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:56,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863582467] [2025-03-08 09:30:56,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863582467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:56,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:56,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:56,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109766963] [2025-03-08 09:30:56,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:56,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:56,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:56,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:56,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:56,208 INFO L87 Difference]: Start difference. First operand 902 states and 1320 transitions. Second operand has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:56,440 INFO L93 Difference]: Finished difference Result 1770 states and 2597 transitions. [2025-03-08 09:30:56,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:56,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 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 276 [2025-03-08 09:30:56,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:56,442 INFO L225 Difference]: With dead ends: 1770 [2025-03-08 09:30:56,442 INFO L226 Difference]: Without dead ends: 956 [2025-03-08 09:30:56,443 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:56,444 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 1958 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:56,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 1811 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:30:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-03-08 09:30:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 902. [2025-03-08 09:30:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.4639289678135405) internal successors, (1319), 901 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states 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:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1319 transitions. [2025-03-08 09:30:56,451 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1319 transitions. Word has length 276 [2025-03-08 09:30:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:56,451 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1319 transitions. [2025-03-08 09:30:56,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1319 transitions. [2025-03-08 09:30:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 09:30:56,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:56,452 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:56,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 09:30:56,453 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:56,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:56,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1600636398, now seen corresponding path program 1 times [2025-03-08 09:30:56,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:56,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676704482] [2025-03-08 09:30:56,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:56,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:56,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 09:30:57,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 09:30:57,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:57,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:57,891 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:57,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:57,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676704482] [2025-03-08 09:30:57,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676704482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:57,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:57,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 09:30:57,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107589872] [2025-03-08 09:30:57,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:57,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:30:57,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:57,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:30:57,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:30:57,892 INFO L87 Difference]: Start difference. First operand 902 states and 1319 transitions. Second operand has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:58,443 INFO L93 Difference]: Finished difference Result 1720 states and 2520 transitions. [2025-03-08 09:30:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 09:30:58,443 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 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 277 [2025-03-08 09:30:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:58,445 INFO L225 Difference]: With dead ends: 1720 [2025-03-08 09:30:58,445 INFO L226 Difference]: Without dead ends: 901 [2025-03-08 09:30:58,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:30:58,446 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 1790 mSDsluCounter, 4099 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 4687 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:58,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1790 Valid, 4687 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:30:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2025-03-08 09:30:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2025-03-08 09:30:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.4622222222222223) internal successors, (1316), 900 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states 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:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1316 transitions. [2025-03-08 09:30:58,454 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1316 transitions. Word has length 277 [2025-03-08 09:30:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:58,454 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1316 transitions. [2025-03-08 09:30:58,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1316 transitions. [2025-03-08 09:30:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-08 09:30:58,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:58,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:30:58,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 09:30:58,456 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:58,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:58,456 INFO L85 PathProgramCache]: Analyzing trace with hash -109669346, now seen corresponding path program 1 times [2025-03-08 09:30:58,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:58,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931489544] [2025-03-08 09:30:58,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:58,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:58,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-08 09:30:59,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-08 09:30:59,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:30:59,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:30:59,560 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:59,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:30:59,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931489544] [2025-03-08 09:30:59,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931489544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:30:59,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:30:59,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:30:59,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918533634] [2025-03-08 09:30:59,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:30:59,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:30:59,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:30:59,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:30:59,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:30:59,563 INFO L87 Difference]: Start difference. First operand 901 states and 1316 transitions. Second operand has 5 states, 5 states have (on average 55.6) internal successors, (278), 5 states have internal predecessors, (278), 0 states have call successors, (0), 0 states 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,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:30:59,864 INFO L93 Difference]: Finished difference Result 1591 states and 2330 transitions. [2025-03-08 09:30:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:30:59,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.6) internal successors, (278), 5 states have internal predecessors, (278), 0 states have call successors, (0), 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 278 [2025-03-08 09:30:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:30:59,866 INFO L225 Difference]: With dead ends: 1591 [2025-03-08 09:30:59,869 INFO L226 Difference]: Without dead ends: 901 [2025-03-08 09:30:59,870 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:59,870 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1705 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:30:59,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 1797 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:30:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2025-03-08 09:30:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2025-03-08 09:30:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.461111111111111) internal successors, (1315), 900 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states 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,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1315 transitions. [2025-03-08 09:30:59,882 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1315 transitions. Word has length 278 [2025-03-08 09:30:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:30:59,882 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1315 transitions. [2025-03-08 09:30:59,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.6) internal successors, (278), 5 states have internal predecessors, (278), 0 states have call successors, (0), 0 states 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,882 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1315 transitions. [2025-03-08 09:30:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-08 09:30:59,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:30:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 09:30:59,883 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:30:59,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:30:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash -149864326, now seen corresponding path program 1 times [2025-03-08 09:30:59,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:30:59,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918988802] [2025-03-08 09:30:59,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:30:59,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:30:59,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-08 09:31:00,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-08 09:31:00,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:00,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:01,172 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:31:01,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:31:01,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918988802] [2025-03-08 09:31:01,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918988802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:31:01,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:31:01,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:31:01,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169648947] [2025-03-08 09:31:01,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:31:01,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:31:01,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:31:01,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:31:01,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:31:01,173 INFO L87 Difference]: Start difference. First operand 901 states and 1315 transitions. Second operand has 5 states, 5 states have (on average 55.8) internal successors, (279), 5 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:31:01,440 INFO L93 Difference]: Finished difference Result 1796 states and 2624 transitions. [2025-03-08 09:31:01,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:31:01,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.8) internal successors, (279), 5 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 279 [2025-03-08 09:31:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:31:01,442 INFO L225 Difference]: With dead ends: 1796 [2025-03-08 09:31:01,442 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 09:31:01,443 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:31:01,444 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1967 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1967 SdHoareTripleChecker+Valid, 1801 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:31:01,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1967 Valid, 1801 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:31:01,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 09:31:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 901. [2025-03-08 09:31:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.46) internal successors, (1314), 900 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states 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:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1314 transitions. [2025-03-08 09:31:01,451 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1314 transitions. Word has length 279 [2025-03-08 09:31:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:31:01,452 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1314 transitions. [2025-03-08 09:31:01,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.8) internal successors, (279), 5 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1314 transitions. [2025-03-08 09:31:01,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-08 09:31:01,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:31:01,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 09:31:01,453 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:31:01,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:31:01,453 INFO L85 PathProgramCache]: Analyzing trace with hash -822373137, now seen corresponding path program 1 times [2025-03-08 09:31:01,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:31:01,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157525766] [2025-03-08 09:31:01,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:01,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:31:01,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-08 09:31:01,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-08 09:31:01,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:01,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:02,046 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:31:02,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:31:02,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157525766] [2025-03-08 09:31:02,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157525766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:31:02,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:31:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:31:02,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154850501] [2025-03-08 09:31:02,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:31:02,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:31:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:31:02,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:31:02,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:31:02,047 INFO L87 Difference]: Start difference. First operand 901 states and 1314 transitions. Second operand has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:31:02,306 INFO L93 Difference]: Finished difference Result 1796 states and 2623 transitions. [2025-03-08 09:31:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:31:02,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 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 280 [2025-03-08 09:31:02,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:31:02,308 INFO L225 Difference]: With dead ends: 1796 [2025-03-08 09:31:02,308 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 09:31:02,309 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:31:02,309 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 1964 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1964 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:31:02,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1964 Valid, 1811 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:31:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 09:31:02,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 901. [2025-03-08 09:31:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.458888888888889) internal successors, (1313), 900 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states 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:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1313 transitions. [2025-03-08 09:31:02,316 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1313 transitions. Word has length 280 [2025-03-08 09:31:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:31:02,316 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1313 transitions. [2025-03-08 09:31:02,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1313 transitions. [2025-03-08 09:31:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-08 09:31:02,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:31:02,317 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 09:31:02,317 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:31:02,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:31:02,318 INFO L85 PathProgramCache]: Analyzing trace with hash -925592412, now seen corresponding path program 1 times [2025-03-08 09:31:02,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:31:02,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644349405] [2025-03-08 09:31:02,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:02,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:31:02,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-08 09:31:02,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-08 09:31:02,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:02,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:03,465 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:31:03,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:31:03,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644349405] [2025-03-08 09:31:03,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644349405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:31:03,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:31:03,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:31:03,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747530595] [2025-03-08 09:31:03,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:31:03,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:31:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:31:03,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:31:03,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:31:03,467 INFO L87 Difference]: Start difference. First operand 901 states and 1313 transitions. Second operand has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:31:03,725 INFO L93 Difference]: Finished difference Result 1551 states and 2269 transitions. [2025-03-08 09:31:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:31:03,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2025-03-08 09:31:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:31:03,727 INFO L225 Difference]: With dead ends: 1551 [2025-03-08 09:31:03,727 INFO L226 Difference]: Without dead ends: 899 [2025-03-08 09:31:03,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:31:03,728 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1679 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:31:03,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 1797 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:31:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-03-08 09:31:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2025-03-08 09:31:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 1.4587973273942094) internal successors, (1310), 898 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states 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:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1310 transitions. [2025-03-08 09:31:03,736 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1310 transitions. Word has length 281 [2025-03-08 09:31:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:31:03,736 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1310 transitions. [2025-03-08 09:31:03,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:31:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1310 transitions. [2025-03-08 09:31:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-08 09:31:03,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:31:03,738 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 09:31:03,738 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:31:03,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:31:03,738 INFO L85 PathProgramCache]: Analyzing trace with hash -829762822, now seen corresponding path program 1 times [2025-03-08 09:31:03,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:31:03,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871430863] [2025-03-08 09:31:03,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:03,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:31:03,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-08 09:31:04,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-08 09:31:04,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:04,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:05,504 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:31:05,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:31:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871430863] [2025-03-08 09:31:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871430863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:31:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118457762] [2025-03-08 09:31:05,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:05,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:31:05,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:31:05,507 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:31:05,508 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:31:06,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-08 09:31:06,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-08 09:31:06,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:06,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:06,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 1742 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-08 09:31:06,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:31:07,680 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:31:07,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:31:08,892 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:31:08,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118457762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:31:08,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:31:08,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 12] total 32 [2025-03-08 09:31:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970392848] [2025-03-08 09:31:08,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:31:08,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 09:31:08,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:31:08,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 09:31:08,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2025-03-08 09:31:08,894 INFO L87 Difference]: Start difference. First operand 899 states and 1310 transitions. Second operand has 32 states, 32 states have (on average 25.96875) internal successors, (831), 32 states have internal predecessors, (831), 0 states have call successors, (0), 0 states 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:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:31:11,057 INFO L93 Difference]: Finished difference Result 3119 states and 4574 transitions. [2025-03-08 09:31:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 09:31:11,058 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 25.96875) internal successors, (831), 32 states have internal predecessors, (831), 0 states have call successors, (0), 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 281 [2025-03-08 09:31:11,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:31:11,061 INFO L225 Difference]: With dead ends: 3119 [2025-03-08 09:31:11,062 INFO L226 Difference]: Without dead ends: 2287 [2025-03-08 09:31:11,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=508, Invalid=2572, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 09:31:11,063 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 9254 mSDsluCounter, 10510 mSDsCounter, 0 mSdLazyCounter, 4593 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9254 SdHoareTripleChecker+Valid, 11021 SdHoareTripleChecker+Invalid, 4601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 4593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:31:11,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9254 Valid, 11021 Invalid, 4601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 4593 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 09:31:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2025-03-08 09:31:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 1718. [2025-03-08 09:31:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1717 states have (on average 1.4589400116482236) internal successors, (2505), 1717 states have internal predecessors, (2505), 0 states have call successors, (0), 0 states 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:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2505 transitions. [2025-03-08 09:31:11,077 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2505 transitions. Word has length 281 [2025-03-08 09:31:11,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:31:11,077 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2505 transitions. [2025-03-08 09:31:11,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 25.96875) internal successors, (831), 32 states have internal predecessors, (831), 0 states have call successors, (0), 0 states 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:11,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2505 transitions. [2025-03-08 09:31:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-08 09:31:11,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:31:11,078 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,090 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:31:11,279 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,SelfDestructingSolverStorable32 [2025-03-08 09:31:11,279 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:31:11,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:31:11,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1315836369, now seen corresponding path program 1 times [2025-03-08 09:31:11,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:31:11,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602070659] [2025-03-08 09:31:11,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:31:11,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-08 09:31:11,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-08 09:31:11,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:11,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:11,647 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:31:11,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:31:11,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602070659] [2025-03-08 09:31:11,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602070659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:31:11,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:31:11,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:31:11,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929591342] [2025-03-08 09:31:11,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:31:11,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:31:11,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:31:11,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:31:11,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:31:11,649 INFO L87 Difference]: Start difference. First operand 1718 states and 2505 transitions. Second operand has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:31:11,887 INFO L93 Difference]: Finished difference Result 2593 states and 3783 transitions. [2025-03-08 09:31:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:31:11,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 0 states have call successors, (0), 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 282 [2025-03-08 09:31:11,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:31:11,893 INFO L225 Difference]: With dead ends: 2593 [2025-03-08 09:31:11,893 INFO L226 Difference]: Without dead ends: 1759 [2025-03-08 09:31:11,894 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:31:11,894 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1851 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1851 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:31:11,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1851 Valid, 1805 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:31:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2025-03-08 09:31:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1715. [2025-03-08 09:31:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1714 states have (on average 1.4579929988331388) internal successors, (2499), 1714 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states 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:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2499 transitions. [2025-03-08 09:31:11,904 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2499 transitions. Word has length 282 [2025-03-08 09:31:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:31:11,904 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 2499 transitions. [2025-03-08 09:31:11,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2499 transitions. [2025-03-08 09:31:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-08 09:31:11,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:31:11,906 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 09:31:11,906 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:31:11,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:31:11,906 INFO L85 PathProgramCache]: Analyzing trace with hash -823050826, now seen corresponding path program 1 times [2025-03-08 09:31:11,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:31:11,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37900712] [2025-03-08 09:31:11,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:11,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:31:11,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-08 09:31:12,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-08 09:31:12,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:12,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:12,308 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:31:12,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:31:12,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37900712] [2025-03-08 09:31:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37900712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:31:12,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:31:12,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:31:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566940578] [2025-03-08 09:31:12,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:31:12,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:31:12,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:31:12,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:31:12,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:31:12,309 INFO L87 Difference]: Start difference. First operand 1715 states and 2499 transitions. Second operand has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:31:12,517 INFO L93 Difference]: Finished difference Result 2164 states and 3168 transitions. [2025-03-08 09:31:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:31:12,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 0 states have call successors, (0), 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 282 [2025-03-08 09:31:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:31:12,519 INFO L225 Difference]: With dead ends: 2164 [2025-03-08 09:31:12,519 INFO L226 Difference]: Without dead ends: 1329 [2025-03-08 09:31:12,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:31:12,520 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 1755 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:31:12,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 1801 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:31:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2025-03-08 09:31:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2025-03-08 09:31:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1328 states have (on average 1.466867469879518) internal successors, (1948), 1328 states have internal predecessors, (1948), 0 states have call successors, (0), 0 states 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:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1948 transitions. [2025-03-08 09:31:12,530 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1948 transitions. Word has length 282 [2025-03-08 09:31:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:31:12,531 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1948 transitions. [2025-03-08 09:31:12,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1948 transitions. [2025-03-08 09:31:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-03-08 09:31:12,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:31:12,533 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:31:12,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 09:31:12,534 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:31:12,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:31:12,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2018632961, now seen corresponding path program 1 times [2025-03-08 09:31:12,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:31:12,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590516573] [2025-03-08 09:31:12,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:12,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:31:12,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-08 09:31:17,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-08 09:31:17,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:17,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 227 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:18,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:31:18,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590516573] [2025-03-08 09:31:18,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590516573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:31:18,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112905956] [2025-03-08 09:31:18,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:31:18,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:31:18,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:31:18,957 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:31:18,959 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:31:19,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-08 09:31:19,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-08 09:31:19,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:31:19,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:31:20,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 3256 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-03-08 09:31:20,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:31:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 118 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:21,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:31:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 89 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:31:25,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112905956] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:31:25,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:31:25,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19, 20] total 42 [2025-03-08 09:31:25,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016306312] [2025-03-08 09:31:25,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:31:25,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 09:31:25,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:31:25,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 09:31:25,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1499, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 09:31:25,704 INFO L87 Difference]: Start difference. First operand 1329 states and 1948 transitions. Second operand has 42 states, 42 states have (on average 33.76190476190476) internal successors, (1418), 42 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)