./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label13.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67239f1bf7e0cdf325715bd48f4c9c86a0588f752ce48acb5db8e3f7bfd7cd18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:55:00,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:55:00,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:55:00,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:55:00,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:55:00,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:55:00,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:55:00,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:55:00,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:55:00,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:55:00,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:55:00,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:55:00,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:55:00,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:55:00,941 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:55:00,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:55:00,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:55:00,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:55:00,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:55:00,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:55:00,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:55:00,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:55:00,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:55:00,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:55:00,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:55:00,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:55:00,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:55:00,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:55:00,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:55:00,943 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 67239f1bf7e0cdf325715bd48f4c9c86a0588f752ce48acb5db8e3f7bfd7cd18 [2025-01-08 22:55:01,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:55:01,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:55:01,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:55:01,155 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:55:01,155 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:55:01,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label13.c [2025-01-08 22:55:02,284 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/645ca33a5/e6448d1dc92f4a309ef21ccfb283c4ad/FLAG0afa57aa7 [2025-01-08 22:55:02,648 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:55:02,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label13.c [2025-01-08 22:55:02,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/645ca33a5/e6448d1dc92f4a309ef21ccfb283c4ad/FLAG0afa57aa7 [2025-01-08 22:55:02,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/645ca33a5/e6448d1dc92f4a309ef21ccfb283c4ad [2025-01-08 22:55:02,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:55:02,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:55:02,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:55:02,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:55:02,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:55:02,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:55:02" (1/1) ... [2025-01-08 22:55:02,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5943cc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:02, skipping insertion in model container [2025-01-08 22:55:02,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:55:02" (1/1) ... [2025-01-08 22:55:02,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:55:03,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label13.c[55139,55152] [2025-01-08 22:55:03,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:55:03,115 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:55:03,231 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label13.c[55139,55152] [2025-01-08 22:55:03,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:55:03,255 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:55:03,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03 WrapperNode [2025-01-08 22:55:03,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:55:03,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:55:03,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:55:03,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:55:03,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,372 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-01-08 22:55:03,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:55:03,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:55:03,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:55:03,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:55:03,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,421 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-01-08 22:55:03,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,460 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:55:03,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:55:03,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:55:03,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:55:03,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (1/1) ... [2025-01-08 22:55:03,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:55:03,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:03,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:55:03,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:55:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:55:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:55:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:55:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:55:03,615 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:55:03,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:55:04,953 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-08 22:55:04,954 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:55:04,968 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:55:04,970 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:55:04,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:55:04 BoogieIcfgContainer [2025-01-08 22:55:04,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:55:04,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:55:04,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:55:04,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:55:04,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:55:02" (1/3) ... [2025-01-08 22:55:04,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f605ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:55:04, skipping insertion in model container [2025-01-08 22:55:04,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:03" (2/3) ... [2025-01-08 22:55:04,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f605ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:55:04, skipping insertion in model container [2025-01-08 22:55:04,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:55:04" (3/3) ... [2025-01-08 22:55:04,979 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label13.c [2025-01-08 22:55:04,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:55:04,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label13.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:55:05,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:55:05,051 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;@676548d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:55:05,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:55:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-08 22:55:05,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:05,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:55:05,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:05,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:05,070 INFO L85 PathProgramCache]: Analyzing trace with hash 533765182, now seen corresponding path program 1 times [2025-01-08 22:55:05,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:05,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824389755] [2025-01-08 22:55:05,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:05,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:05,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-08 22:55:05,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-08 22:55:05,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:05,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:05,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:05,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824389755] [2025-01-08 22:55:05,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824389755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:05,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:05,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:05,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020929611] [2025-01-08 22:55:05,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:05,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:05,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:05,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:05,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:05,761 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:06,535 INFO L93 Difference]: Finished difference Result 864 states and 1511 transitions. [2025-01-08 22:55:06,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:06,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-01-08 22:55:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:06,547 INFO L225 Difference]: With dead ends: 864 [2025-01-08 22:55:06,547 INFO L226 Difference]: Without dead ends: 468 [2025-01-08 22:55:06,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:06,557 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 123 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:06,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 165 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:55:06,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-08 22:55:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 454. [2025-01-08 22:55:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.6269315673289184) internal successors, (737), 453 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 737 transitions. [2025-01-08 22:55:06,599 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 737 transitions. Word has length 155 [2025-01-08 22:55:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:06,600 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 737 transitions. [2025-01-08 22:55:06,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 737 transitions. [2025-01-08 22:55:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-08 22:55:06,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:06,602 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] [2025-01-08 22:55:06,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:55:06,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:06,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash -923608941, now seen corresponding path program 1 times [2025-01-08 22:55:06,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:06,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726355385] [2025-01-08 22:55:06,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:06,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-08 22:55:06,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-08 22:55:06,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:06,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:06,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726355385] [2025-01-08 22:55:06,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726355385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:06,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:06,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:06,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230180584] [2025-01-08 22:55:06,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:06,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:06,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:06,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:06,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:06,827 INFO L87 Difference]: Start difference. First operand 454 states and 737 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:07,034 INFO L93 Difference]: Finished difference Result 1354 states and 2203 transitions. [2025-01-08 22:55:07,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:07,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-01-08 22:55:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:07,038 INFO L225 Difference]: With dead ends: 1354 [2025-01-08 22:55:07,038 INFO L226 Difference]: Without dead ends: 902 [2025-01-08 22:55:07,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:07,039 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:07,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 601 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:55:07,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-01-08 22:55:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 899. [2025-01-08 22:55:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 1.6291759465478841) internal successors, (1463), 898 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1463 transitions. [2025-01-08 22:55:07,072 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1463 transitions. Word has length 160 [2025-01-08 22:55:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:07,072 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1463 transitions. [2025-01-08 22:55:07,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1463 transitions. [2025-01-08 22:55:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-08 22:55:07,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:07,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:07,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:55:07,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:07,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2134173422, now seen corresponding path program 1 times [2025-01-08 22:55:07,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:07,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256753722] [2025-01-08 22:55:07,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:07,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:07,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-08 22:55:07,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-08 22:55:07,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:07,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:07,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:07,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256753722] [2025-01-08 22:55:07,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256753722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:07,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:07,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:07,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383805881] [2025-01-08 22:55:07,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:07,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:07,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:07,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:07,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:07,297 INFO L87 Difference]: Start difference. First operand 899 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:07,967 INFO L93 Difference]: Finished difference Result 2638 states and 4312 transitions. [2025-01-08 22:55:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:07,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2025-01-08 22:55:07,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:07,975 INFO L225 Difference]: With dead ends: 2638 [2025-01-08 22:55:07,975 INFO L226 Difference]: Without dead ends: 1741 [2025-01-08 22:55:07,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:07,979 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 258 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:07,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 141 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2025-01-08 22:55:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1739. [2025-01-08 22:55:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1738 states have (on average 1.5379746835443038) internal successors, (2673), 1738 states have internal predecessors, (2673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2673 transitions. [2025-01-08 22:55:08,018 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2673 transitions. Word has length 161 [2025-01-08 22:55:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:08,018 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2673 transitions. [2025-01-08 22:55:08,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2673 transitions. [2025-01-08 22:55:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-08 22:55:08,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:08,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:55:08,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:55:08,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:08,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash 185105855, now seen corresponding path program 1 times [2025-01-08 22:55:08,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:08,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144163202] [2025-01-08 22:55:08,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:08,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:08,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-08 22:55:08,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-08 22:55:08,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:08,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:08,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:08,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144163202] [2025-01-08 22:55:08,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144163202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:08,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:08,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:08,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835881854] [2025-01-08 22:55:08,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:08,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:08,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:08,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:08,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:08,130 INFO L87 Difference]: Start difference. First operand 1739 states and 2673 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:08,793 INFO L93 Difference]: Finished difference Result 5141 states and 7935 transitions. [2025-01-08 22:55:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:08,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2025-01-08 22:55:08,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:08,802 INFO L225 Difference]: With dead ends: 5141 [2025-01-08 22:55:08,802 INFO L226 Difference]: Without dead ends: 3404 [2025-01-08 22:55:08,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:08,804 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 236 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:08,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 155 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:08,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2025-01-08 22:55:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3368. [2025-01-08 22:55:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 1.50994950994951) internal successors, (5084), 3367 states have internal predecessors, (5084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5084 transitions. [2025-01-08 22:55:08,853 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5084 transitions. Word has length 163 [2025-01-08 22:55:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:08,853 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5084 transitions. [2025-01-08 22:55:08,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5084 transitions. [2025-01-08 22:55:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-08 22:55:08,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:08,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:55:08,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:55:08,857 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:08,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash -487456690, now seen corresponding path program 1 times [2025-01-08 22:55:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:08,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930462204] [2025-01-08 22:55:08,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:08,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:08,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-08 22:55:08,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-08 22:55:08,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:08,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:09,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:09,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930462204] [2025-01-08 22:55:09,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930462204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:09,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:09,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:09,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488671752] [2025-01-08 22:55:09,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:09,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:09,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:09,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:09,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:09,012 INFO L87 Difference]: Start difference. First operand 3368 states and 5084 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:09,642 INFO L93 Difference]: Finished difference Result 10012 states and 15134 transitions. [2025-01-08 22:55:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:09,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2025-01-08 22:55:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:09,660 INFO L225 Difference]: With dead ends: 10012 [2025-01-08 22:55:09,660 INFO L226 Difference]: Without dead ends: 6646 [2025-01-08 22:55:09,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:09,666 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 242 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:09,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 182 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2025-01-08 22:55:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 6638. [2025-01-08 22:55:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6638 states, 6637 states have (on average 1.4260961277685702) internal successors, (9465), 6637 states have internal predecessors, (9465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6638 states to 6638 states and 9465 transitions. [2025-01-08 22:55:09,773 INFO L78 Accepts]: Start accepts. Automaton has 6638 states and 9465 transitions. Word has length 169 [2025-01-08 22:55:09,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:09,773 INFO L471 AbstractCegarLoop]: Abstraction has 6638 states and 9465 transitions. [2025-01-08 22:55:09,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 6638 states and 9465 transitions. [2025-01-08 22:55:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-08 22:55:09,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:09,780 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2025-01-08 22:55:09,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:55:09,781 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:09,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1155359837, now seen corresponding path program 1 times [2025-01-08 22:55:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125754834] [2025-01-08 22:55:09,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:09,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:09,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-08 22:55:09,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-08 22:55:09,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:09,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:55:09,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:09,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125754834] [2025-01-08 22:55:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125754834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:09,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:09,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:09,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546721846] [2025-01-08 22:55:09,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:09,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:09,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:09,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:09,924 INFO L87 Difference]: Start difference. First operand 6638 states and 9465 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:10,541 INFO L93 Difference]: Finished difference Result 13268 states and 18917 transitions. [2025-01-08 22:55:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:10,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2025-01-08 22:55:10,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:10,557 INFO L225 Difference]: With dead ends: 13268 [2025-01-08 22:55:10,557 INFO L226 Difference]: Without dead ends: 6632 [2025-01-08 22:55:10,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:10,561 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 269 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:10,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 375 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6632 states. [2025-01-08 22:55:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6632 to 5814. [2025-01-08 22:55:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5814 states, 5813 states have (on average 1.347669017718906) internal successors, (7834), 5813 states have internal predecessors, (7834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5814 states to 5814 states and 7834 transitions. [2025-01-08 22:55:10,640 INFO L78 Accepts]: Start accepts. Automaton has 5814 states and 7834 transitions. Word has length 177 [2025-01-08 22:55:10,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:10,641 INFO L471 AbstractCegarLoop]: Abstraction has 5814 states and 7834 transitions. [2025-01-08 22:55:10,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5814 states and 7834 transitions. [2025-01-08 22:55:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-08 22:55:10,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:10,647 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:10,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:55:10,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:10,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash -796114741, now seen corresponding path program 1 times [2025-01-08 22:55:10,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:10,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432967511] [2025-01-08 22:55:10,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:10,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-08 22:55:10,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-08 22:55:10,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:10,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:55:10,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:10,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432967511] [2025-01-08 22:55:10,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432967511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:10,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:10,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:10,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889833787] [2025-01-08 22:55:10,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:10,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:10,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:10,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:10,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:10,860 INFO L87 Difference]: Start difference. First operand 5814 states and 7834 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:11,492 INFO L93 Difference]: Finished difference Result 14092 states and 18932 transitions. [2025-01-08 22:55:11,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:11,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2025-01-08 22:55:11,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:11,514 INFO L225 Difference]: With dead ends: 14092 [2025-01-08 22:55:11,517 INFO L226 Difference]: Without dead ends: 8280 [2025-01-08 22:55:11,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:11,524 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 218 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:11,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 403 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2025-01-08 22:55:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 8270. [2025-01-08 22:55:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8270 states, 8269 states have (on average 1.3058410932398112) internal successors, (10798), 8269 states have internal predecessors, (10798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8270 states to 8270 states and 10798 transitions. [2025-01-08 22:55:11,647 INFO L78 Accepts]: Start accepts. Automaton has 8270 states and 10798 transitions. Word has length 183 [2025-01-08 22:55:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:11,648 INFO L471 AbstractCegarLoop]: Abstraction has 8270 states and 10798 transitions. [2025-01-08 22:55:11,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 8270 states and 10798 transitions. [2025-01-08 22:55:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-08 22:55:11,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:11,655 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:55:11,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:55:11,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:11,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash -183776887, now seen corresponding path program 1 times [2025-01-08 22:55:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:11,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494286605] [2025-01-08 22:55:11,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:11,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-08 22:55:11,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-08 22:55:11,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:11,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:55:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494286605] [2025-01-08 22:55:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494286605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:11,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:11,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864158501] [2025-01-08 22:55:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:11,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:11,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:11,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:11,787 INFO L87 Difference]: Start difference. First operand 8270 states and 10798 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:12,096 INFO L93 Difference]: Finished difference Result 24765 states and 32336 transitions. [2025-01-08 22:55:12,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:12,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 184 [2025-01-08 22:55:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:12,126 INFO L225 Difference]: With dead ends: 24765 [2025-01-08 22:55:12,126 INFO L226 Difference]: Without dead ends: 16497 [2025-01-08 22:55:12,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:12,137 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 353 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:12,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 543 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:55:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16497 states. [2025-01-08 22:55:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16497 to 16495. [2025-01-08 22:55:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16495 states, 16494 states have (on average 1.303928701345944) internal successors, (21507), 16494 states have internal predecessors, (21507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16495 states to 16495 states and 21507 transitions. [2025-01-08 22:55:12,370 INFO L78 Accepts]: Start accepts. Automaton has 16495 states and 21507 transitions. Word has length 184 [2025-01-08 22:55:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:12,370 INFO L471 AbstractCegarLoop]: Abstraction has 16495 states and 21507 transitions. [2025-01-08 22:55:12,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16495 states and 21507 transitions. [2025-01-08 22:55:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-08 22:55:12,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:12,386 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:55:12,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:55:12,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:12,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:12,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1873395280, now seen corresponding path program 1 times [2025-01-08 22:55:12,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:12,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2838100] [2025-01-08 22:55:12,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:12,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:12,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-08 22:55:12,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-08 22:55:12,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:12,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:55:12,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:12,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2838100] [2025-01-08 22:55:12,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2838100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:12,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:12,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:12,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60027146] [2025-01-08 22:55:12,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:12,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:12,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:12,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:12,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:12,604 INFO L87 Difference]: Start difference. First operand 16495 states and 21507 transitions. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:13,717 INFO L93 Difference]: Finished difference Result 35924 states and 46924 transitions. [2025-01-08 22:55:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:13,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 199 [2025-01-08 22:55:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:13,749 INFO L225 Difference]: With dead ends: 35924 [2025-01-08 22:55:13,749 INFO L226 Difference]: Without dead ends: 19431 [2025-01-08 22:55:13,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:13,764 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 438 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:13,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 155 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 22:55:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19431 states. [2025-01-08 22:55:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19431 to 16495. [2025-01-08 22:55:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16495 states, 16494 states have (on average 1.303928701345944) internal successors, (21507), 16494 states have internal predecessors, (21507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16495 states to 16495 states and 21507 transitions. [2025-01-08 22:55:13,971 INFO L78 Accepts]: Start accepts. Automaton has 16495 states and 21507 transitions. Word has length 199 [2025-01-08 22:55:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:13,971 INFO L471 AbstractCegarLoop]: Abstraction has 16495 states and 21507 transitions. [2025-01-08 22:55:13,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 16495 states and 21507 transitions. [2025-01-08 22:55:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-08 22:55:13,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:13,985 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:55:13,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:55:13,985 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:13,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:13,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2000305944, now seen corresponding path program 1 times [2025-01-08 22:55:13,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:13,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526585687] [2025-01-08 22:55:13,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:14,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-08 22:55:14,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-08 22:55:14,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:14,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-08 22:55:14,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:14,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526585687] [2025-01-08 22:55:14,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526585687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:14,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:14,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:14,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314483715] [2025-01-08 22:55:14,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:14,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:14,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:14,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:14,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:14,101 INFO L87 Difference]: Start difference. First operand 16495 states and 21507 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:14,464 INFO L93 Difference]: Finished difference Result 32036 states and 41836 transitions. [2025-01-08 22:55:14,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:14,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2025-01-08 22:55:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:14,489 INFO L225 Difference]: With dead ends: 32036 [2025-01-08 22:55:14,489 INFO L226 Difference]: Without dead ends: 15543 [2025-01-08 22:55:14,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:14,504 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:14,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:55:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15543 states. [2025-01-08 22:55:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15543 to 15543. [2025-01-08 22:55:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15543 states, 15542 states have (on average 1.2857418607643805) internal successors, (19983), 15542 states have internal predecessors, (19983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15543 states to 15543 states and 19983 transitions. [2025-01-08 22:55:14,764 INFO L78 Accepts]: Start accepts. Automaton has 15543 states and 19983 transitions. Word has length 202 [2025-01-08 22:55:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:14,765 INFO L471 AbstractCegarLoop]: Abstraction has 15543 states and 19983 transitions. [2025-01-08 22:55:14,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 15543 states and 19983 transitions. [2025-01-08 22:55:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-08 22:55:14,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:14,780 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:55:14,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:55:14,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:14,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:14,781 INFO L85 PathProgramCache]: Analyzing trace with hash -360084476, now seen corresponding path program 1 times [2025-01-08 22:55:14,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:14,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501949902] [2025-01-08 22:55:14,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:14,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:14,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-08 22:55:14,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-08 22:55:14,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:14,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-08 22:55:14,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:14,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501949902] [2025-01-08 22:55:14,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501949902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:14,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:14,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:14,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512633209] [2025-01-08 22:55:14,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:14,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:14,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:14,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:14,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:14,957 INFO L87 Difference]: Start difference. First operand 15543 states and 19983 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:15,652 INFO L93 Difference]: Finished difference Result 40080 states and 51200 transitions. [2025-01-08 22:55:15,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:15,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 205 [2025-01-08 22:55:15,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:15,681 INFO L225 Difference]: With dead ends: 40080 [2025-01-08 22:55:15,681 INFO L226 Difference]: Without dead ends: 24539 [2025-01-08 22:55:15,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:15,691 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:15,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 107 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24539 states. [2025-01-08 22:55:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24539 to 24537. [2025-01-08 22:55:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24537 states, 24536 states have (on average 1.2697668731659602) internal successors, (31155), 24536 states have internal predecessors, (31155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24537 states to 24537 states and 31155 transitions. [2025-01-08 22:55:15,904 INFO L78 Accepts]: Start accepts. Automaton has 24537 states and 31155 transitions. Word has length 205 [2025-01-08 22:55:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:15,904 INFO L471 AbstractCegarLoop]: Abstraction has 24537 states and 31155 transitions. [2025-01-08 22:55:15,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 24537 states and 31155 transitions. [2025-01-08 22:55:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-08 22:55:15,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:15,919 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:55:15,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:55:15,920 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:15,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:15,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1080548278, now seen corresponding path program 2 times [2025-01-08 22:55:15,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:15,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578243415] [2025-01-08 22:55:15,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:55:15,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:15,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 206 statements into 2 equivalence classes. [2025-01-08 22:55:16,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 206 of 206 statements. [2025-01-08 22:55:16,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:55:16,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:55:16,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:16,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578243415] [2025-01-08 22:55:16,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578243415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:16,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:16,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:55:16,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197899268] [2025-01-08 22:55:16,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:16,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:55:16,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:16,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:55:16,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:16,452 INFO L87 Difference]: Start difference. First operand 24537 states and 31155 transitions. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:18,108 INFO L93 Difference]: Finished difference Result 77077 states and 98331 transitions. [2025-01-08 22:55:18,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:55:18,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 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 206 [2025-01-08 22:55:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:18,193 INFO L225 Difference]: With dead ends: 77077 [2025-01-08 22:55:18,193 INFO L226 Difference]: Without dead ends: 52542 [2025-01-08 22:55:18,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:55:18,220 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1264 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:18,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 79 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-08 22:55:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52542 states. [2025-01-08 22:55:18,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52542 to 52512. [2025-01-08 22:55:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52512 states, 52511 states have (on average 1.2690864771190797) internal successors, (66641), 52511 states have internal predecessors, (66641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52512 states to 52512 states and 66641 transitions. [2025-01-08 22:55:18,960 INFO L78 Accepts]: Start accepts. Automaton has 52512 states and 66641 transitions. Word has length 206 [2025-01-08 22:55:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:18,960 INFO L471 AbstractCegarLoop]: Abstraction has 52512 states and 66641 transitions. [2025-01-08 22:55:18,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 52512 states and 66641 transitions. [2025-01-08 22:55:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-01-08 22:55:18,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:18,980 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:55:18,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:55:18,980 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:18,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1587845174, now seen corresponding path program 1 times [2025-01-08 22:55:18,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:18,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585986849] [2025-01-08 22:55:18,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:18,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:19,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-08 22:55:19,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-08 22:55:19,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:19,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:55:19,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:19,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585986849] [2025-01-08 22:55:19,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585986849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:19,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:19,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:19,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934340439] [2025-01-08 22:55:19,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:19,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:19,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:19,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:19,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:19,277 INFO L87 Difference]: Start difference. First operand 52512 states and 66641 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:20,050 INFO L93 Difference]: Finished difference Result 105022 states and 133280 transitions. [2025-01-08 22:55:20,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:20,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 243 [2025-01-08 22:55:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:20,125 INFO L225 Difference]: With dead ends: 105022 [2025-01-08 22:55:20,125 INFO L226 Difference]: Without dead ends: 52512 [2025-01-08 22:55:20,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:20,166 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 516 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:20,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 52 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:55:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52512 states. [2025-01-08 22:55:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52512 to 52512. [2025-01-08 22:55:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52512 states, 52511 states have (on average 1.2572032526518253) internal successors, (66017), 52511 states have internal predecessors, (66017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52512 states to 52512 states and 66017 transitions. [2025-01-08 22:55:20,804 INFO L78 Accepts]: Start accepts. Automaton has 52512 states and 66017 transitions. Word has length 243 [2025-01-08 22:55:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:20,805 INFO L471 AbstractCegarLoop]: Abstraction has 52512 states and 66017 transitions. [2025-01-08 22:55:20,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 52512 states and 66017 transitions. [2025-01-08 22:55:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-01-08 22:55:20,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:20,826 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:55:20,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:55:20,827 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:20,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:20,827 INFO L85 PathProgramCache]: Analyzing trace with hash -471031640, now seen corresponding path program 1 times [2025-01-08 22:55:20,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:20,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929028186] [2025-01-08 22:55:20,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:20,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-08 22:55:20,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-08 22:55:20,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:20,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:55:21,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:21,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929028186] [2025-01-08 22:55:21,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929028186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:21,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:21,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:21,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465541258] [2025-01-08 22:55:21,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:21,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:21,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:21,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:21,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:21,024 INFO L87 Difference]: Start difference. First operand 52512 states and 66017 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 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-01-08 22:55:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:21,838 INFO L93 Difference]: Finished difference Result 122202 states and 153324 transitions. [2025-01-08 22:55:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:21,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 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 267 [2025-01-08 22:55:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:21,920 INFO L225 Difference]: With dead ends: 122202 [2025-01-08 22:55:21,920 INFO L226 Difference]: Without dead ends: 69692 [2025-01-08 22:55:21,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:21,961 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 124 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:21,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 355 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:55:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69692 states. [2025-01-08 22:55:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69692 to 69564. [2025-01-08 22:55:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69564 states, 69563 states have (on average 1.221468309302359) internal successors, (84969), 69563 states have internal predecessors, (84969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69564 states to 69564 states and 84969 transitions. [2025-01-08 22:55:22,935 INFO L78 Accepts]: Start accepts. Automaton has 69564 states and 84969 transitions. Word has length 267 [2025-01-08 22:55:22,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:22,936 INFO L471 AbstractCegarLoop]: Abstraction has 69564 states and 84969 transitions. [2025-01-08 22:55:22,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 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-01-08 22:55:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 69564 states and 84969 transitions. [2025-01-08 22:55:22,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-08 22:55:22,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:22,969 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:55:22,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:55:22,970 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:22,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:22,970 INFO L85 PathProgramCache]: Analyzing trace with hash 398519887, now seen corresponding path program 1 times [2025-01-08 22:55:22,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:22,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053981275] [2025-01-08 22:55:22,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:22,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:23,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-08 22:55:23,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-08 22:55:23,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:23,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-08 22:55:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:23,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053981275] [2025-01-08 22:55:23,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053981275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:23,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:23,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:23,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251170577] [2025-01-08 22:55:23,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:23,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:23,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:23,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:23,203 INFO L87 Difference]: Start difference. First operand 69564 states and 84969 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:24,162 INFO L93 Difference]: Finished difference Result 183380 states and 224923 transitions. [2025-01-08 22:55:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 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-01-08 22:55:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:24,579 INFO L225 Difference]: With dead ends: 183380 [2025-01-08 22:55:24,580 INFO L226 Difference]: Without dead ends: 113818 [2025-01-08 22:55:24,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:24,611 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 172 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:24,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 150 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:55:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113818 states. [2025-01-08 22:55:25,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113818 to 113818. [2025-01-08 22:55:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113818 states, 113817 states have (on average 1.155442508588348) internal successors, (131509), 113817 states have internal predecessors, (131509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113818 states to 113818 states and 131509 transitions. [2025-01-08 22:55:25,751 INFO L78 Accepts]: Start accepts. Automaton has 113818 states and 131509 transitions. Word has length 272 [2025-01-08 22:55:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:25,751 INFO L471 AbstractCegarLoop]: Abstraction has 113818 states and 131509 transitions. [2025-01-08 22:55:25,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 113818 states and 131509 transitions. [2025-01-08 22:55:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-08 22:55:25,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:25,776 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:25,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:55:25,776 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:25,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash -468470249, now seen corresponding path program 1 times [2025-01-08 22:55:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:25,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255920291] [2025-01-08 22:55:25,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:25,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-08 22:55:25,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-08 22:55:25,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:25,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-08 22:55:26,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:26,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255920291] [2025-01-08 22:55:26,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255920291] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:55:26,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782627323] [2025-01-08 22:55:26,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:26,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:26,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:26,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:55:26,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:55:26,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-08 22:55:26,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-08 22:55:26,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:26,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:26,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:55:26,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:55:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-01-08 22:55:26,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:55:26,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782627323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:26,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:55:26,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:55:26,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839006674] [2025-01-08 22:55:26,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:26,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:26,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:26,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:26,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:26,337 INFO L87 Difference]: Start difference. First operand 113818 states and 131509 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:27,604 INFO L93 Difference]: Finished difference Result 271311 states and 316466 transitions. [2025-01-08 22:55:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:27,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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-01-08 22:55:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:27,785 INFO L225 Difference]: With dead ends: 271311 [2025-01-08 22:55:27,785 INFO L226 Difference]: Without dead ends: 148969 [2025-01-08 22:55:27,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:27,874 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 204 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:27,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 366 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148969 states. [2025-01-08 22:55:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148969 to 93528. [2025-01-08 22:55:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93528 states, 93527 states have (on average 1.0898670972018776) internal successors, (101932), 93527 states have internal predecessors, (101932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93528 states to 93528 states and 101932 transitions. [2025-01-08 22:55:29,678 INFO L78 Accepts]: Start accepts. Automaton has 93528 states and 101932 transitions. Word has length 278 [2025-01-08 22:55:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:29,679 INFO L471 AbstractCegarLoop]: Abstraction has 93528 states and 101932 transitions. [2025-01-08 22:55:29,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 93528 states and 101932 transitions. [2025-01-08 22:55:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-01-08 22:55:29,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:29,697 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:29,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:55:29,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-08 22:55:29,898 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:29,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash 640066233, now seen corresponding path program 1 times [2025-01-08 22:55:29,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:29,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723017676] [2025-01-08 22:55:29,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:29,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:29,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-08 22:55:29,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-08 22:55:29,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:29,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-08 22:55:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:30,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723017676] [2025-01-08 22:55:30,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723017676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:30,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:30,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:30,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578802404] [2025-01-08 22:55:30,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:30,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:30,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:30,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:30,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:30,218 INFO L87 Difference]: Start difference. First operand 93528 states and 101932 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:31,385 INFO L93 Difference]: Finished difference Result 190175 states and 207254 transitions. [2025-01-08 22:55:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:31,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 313 [2025-01-08 22:55:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:31,498 INFO L225 Difference]: With dead ends: 190175 [2025-01-08 22:55:31,498 INFO L226 Difference]: Without dead ends: 95431 [2025-01-08 22:55:31,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:31,559 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 378 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:31,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 102 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:55:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95431 states. [2025-01-08 22:55:32,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95431 to 92107. [2025-01-08 22:55:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92107 states, 92106 states have (on average 1.0892450003257117) internal successors, (100326), 92106 states have internal predecessors, (100326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92107 states to 92107 states and 100326 transitions. [2025-01-08 22:55:32,862 INFO L78 Accepts]: Start accepts. Automaton has 92107 states and 100326 transitions. Word has length 313 [2025-01-08 22:55:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:32,862 INFO L471 AbstractCegarLoop]: Abstraction has 92107 states and 100326 transitions. [2025-01-08 22:55:32,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 92107 states and 100326 transitions. [2025-01-08 22:55:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-01-08 22:55:32,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:32,877 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:55:32,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:55:32,877 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:32,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:32,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1927804328, now seen corresponding path program 1 times [2025-01-08 22:55:32,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:32,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644233284] [2025-01-08 22:55:32,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:32,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:32,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-08 22:55:32,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-08 22:55:32,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:32,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:33,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:33,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644233284] [2025-01-08 22:55:33,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644233284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:33,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:33,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:33,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698012686] [2025-01-08 22:55:33,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:33,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:33,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:33,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:33,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:33,021 INFO L87 Difference]: Start difference. First operand 92107 states and 100326 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:33,785 INFO L93 Difference]: Finished difference Result 174016 states and 189740 transitions. [2025-01-08 22:55:33,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:33,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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 348 [2025-01-08 22:55:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:33,871 INFO L225 Difference]: With dead ends: 174016 [2025-01-08 22:55:33,871 INFO L226 Difference]: Without dead ends: 81708 [2025-01-08 22:55:33,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:33,923 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 146 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:33,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 313 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:55:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81708 states. [2025-01-08 22:55:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81708 to 78034. [2025-01-08 22:55:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78034 states, 78033 states have (on average 1.0757243730216703) internal successors, (83942), 78033 states have internal predecessors, (83942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78034 states to 78034 states and 83942 transitions. [2025-01-08 22:55:34,767 INFO L78 Accepts]: Start accepts. Automaton has 78034 states and 83942 transitions. Word has length 348 [2025-01-08 22:55:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:34,768 INFO L471 AbstractCegarLoop]: Abstraction has 78034 states and 83942 transitions. [2025-01-08 22:55:34,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 78034 states and 83942 transitions. [2025-01-08 22:55:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-01-08 22:55:34,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:34,780 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:55:34,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:55:34,780 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:34,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash -446288223, now seen corresponding path program 1 times [2025-01-08 22:55:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:34,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962134273] [2025-01-08 22:55:34,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:34,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-01-08 22:55:34,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-01-08 22:55:34,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:34,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:35,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:35,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962134273] [2025-01-08 22:55:35,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962134273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:35,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:35,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:55:35,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062600069] [2025-01-08 22:55:35,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:35,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:35,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:35,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:35,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:35,303 INFO L87 Difference]: Start difference. First operand 78034 states and 83942 transitions. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:36,346 INFO L93 Difference]: Finished difference Result 167231 states and 180054 transitions. [2025-01-08 22:55:36,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:36,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 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 358 [2025-01-08 22:55:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:36,444 INFO L225 Difference]: With dead ends: 167231 [2025-01-08 22:55:36,444 INFO L226 Difference]: Without dead ends: 86763 [2025-01-08 22:55:36,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:36,479 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 281 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:36,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 105 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86763 states. [2025-01-08 22:55:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86763 to 84124. [2025-01-08 22:55:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84124 states, 84123 states have (on average 1.0724772059959822) internal successors, (90220), 84123 states have internal predecessors, (90220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84124 states to 84124 states and 90220 transitions. [2025-01-08 22:55:37,690 INFO L78 Accepts]: Start accepts. Automaton has 84124 states and 90220 transitions. Word has length 358 [2025-01-08 22:55:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:37,692 INFO L471 AbstractCegarLoop]: Abstraction has 84124 states and 90220 transitions. [2025-01-08 22:55:37,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 84124 states and 90220 transitions. [2025-01-08 22:55:37,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-01-08 22:55:37,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:37,706 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:37,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 22:55:37,707 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:37,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:37,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2088243676, now seen corresponding path program 1 times [2025-01-08 22:55:37,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:37,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678154840] [2025-01-08 22:55:37,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:37,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:37,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-01-08 22:55:37,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-01-08 22:55:37,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:37,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-08 22:55:38,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:38,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678154840] [2025-01-08 22:55:38,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678154840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:38,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:38,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:38,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198788712] [2025-01-08 22:55:38,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:38,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:38,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:38,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:38,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:38,061 INFO L87 Difference]: Start difference. First operand 84124 states and 90220 transitions. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:38,988 INFO L93 Difference]: Finished difference Result 226363 states and 242616 transitions. [2025-01-08 22:55:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:38,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 378 [2025-01-08 22:55:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:39,145 INFO L225 Difference]: With dead ends: 226363 [2025-01-08 22:55:39,146 INFO L226 Difference]: Without dead ends: 142239 [2025-01-08 22:55:39,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:39,208 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 341 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:39,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 405 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:55:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142239 states. [2025-01-08 22:55:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142239 to 122126. [2025-01-08 22:55:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122126 states, 122125 states have (on average 1.070386898669396) internal successors, (130721), 122125 states have internal predecessors, (130721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122126 states to 122126 states and 130721 transitions. [2025-01-08 22:55:41,016 INFO L78 Accepts]: Start accepts. Automaton has 122126 states and 130721 transitions. Word has length 378 [2025-01-08 22:55:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:41,016 INFO L471 AbstractCegarLoop]: Abstraction has 122126 states and 130721 transitions. [2025-01-08 22:55:41,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 122126 states and 130721 transitions. [2025-01-08 22:55:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-08 22:55:41,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:41,039 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 22:55:41,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 22:55:41,040 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:41,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash -72592111, now seen corresponding path program 1 times [2025-01-08 22:55:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:41,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62386811] [2025-01-08 22:55:41,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:41,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:41,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-08 22:55:41,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-08 22:55:41,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:41,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-01-08 22:55:41,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:41,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62386811] [2025-01-08 22:55:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62386811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:41,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:41,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:41,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491928858] [2025-01-08 22:55:41,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:41,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:41,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:41,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:41,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:41,461 INFO L87 Difference]: Start difference. First operand 122126 states and 130721 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 2 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-01-08 22:55:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:42,402 INFO L93 Difference]: Finished difference Result 363317 states and 389006 transitions. [2025-01-08 22:55:42,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:42,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 2 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 382 [2025-01-08 22:55:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:42,675 INFO L225 Difference]: With dead ends: 363317 [2025-01-08 22:55:42,676 INFO L226 Difference]: Without dead ends: 241193 [2025-01-08 22:55:42,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:42,769 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 181 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:42,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 479 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:55:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241193 states. [2025-01-08 22:55:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241193 to 241185. [2025-01-08 22:55:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241185 states, 241184 states have (on average 1.0706141369245057) internal successors, (258215), 241184 states have internal predecessors, (258215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241185 states to 241185 states and 258215 transitions. [2025-01-08 22:55:46,013 INFO L78 Accepts]: Start accepts. Automaton has 241185 states and 258215 transitions. Word has length 382 [2025-01-08 22:55:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:46,013 INFO L471 AbstractCegarLoop]: Abstraction has 241185 states and 258215 transitions. [2025-01-08 22:55:46,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 2 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-01-08 22:55:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 241185 states and 258215 transitions. [2025-01-08 22:55:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-08 22:55:46,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:46,050 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:46,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:55:46,051 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:46,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:46,055 INFO L85 PathProgramCache]: Analyzing trace with hash -134156615, now seen corresponding path program 1 times [2025-01-08 22:55:46,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:46,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904554298] [2025-01-08 22:55:46,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:46,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:46,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-08 22:55:46,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-08 22:55:46,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:46,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 390 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:46,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904554298] [2025-01-08 22:55:46,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904554298] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:55:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873069819] [2025-01-08 22:55:46,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:46,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:46,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:46,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:55:46,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:55:46,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-08 22:55:47,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-08 22:55:47,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:47,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:47,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:55:47,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:55:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 251 proven. 123 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:55:48,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:55:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 285 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:49,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873069819] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:55:49,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:55:49,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 11 [2025-01-08 22:55:49,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905865005] [2025-01-08 22:55:49,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:55:49,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:55:49,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:49,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:55:49,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:55:49,957 INFO L87 Difference]: Start difference. First operand 241185 states and 258215 transitions. Second operand has 11 states, 11 states have (on average 79.54545454545455) internal successors, (875), 11 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:56,412 INFO L93 Difference]: Finished difference Result 496748 states and 530236 transitions. [2025-01-08 22:55:56,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-08 22:55:56,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 79.54545454545455) internal successors, (875), 11 states have internal predecessors, (875), 0 states have call successors, (0), 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 409 [2025-01-08 22:55:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:56,684 INFO L225 Difference]: With dead ends: 496748 [2025-01-08 22:55:56,684 INFO L226 Difference]: Without dead ends: 248663 [2025-01-08 22:55:56,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=749, Invalid=2113, Unknown=0, NotChecked=0, Total=2862 [2025-01-08 22:55:56,724 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 10067 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 5867 mSolverCounterSat, 1238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10067 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 7105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1238 IncrementalHoareTripleChecker+Valid, 5867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:56,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10067 Valid, 222 Invalid, 7105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1238 Valid, 5867 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-08 22:55:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248663 states.