./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/Problem13_label33.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 aaccf385f935203878b819a92144fc9de308865fc678d0507ba69ad2b46a0a7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:44:41,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:44:41,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:44:41,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:44:41,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:44:41,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:44:41,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:44:41,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:44:41,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:44:41,430 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:44:41,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:44:41,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:44:41,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:44:41,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:44:41,431 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:44:41,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:44:41,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:44:41,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:44:41,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:44:41,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:44:41,432 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:44:41,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:44:41,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:44:41,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:44:41,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:44:41,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:44:41,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:44:41,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:44:41,432 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 -> aaccf385f935203878b819a92144fc9de308865fc678d0507ba69ad2b46a0a7a [2025-02-05 11:44:41,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:44:41,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:44:41,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:44:41,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:44:41,695 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:44:41,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label33.c [2025-02-05 11:44:42,888 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/984bcb8cc/dab0c8ea2e1c42fda53c2cb495175f5c/FLAGdca1b7dba [2025-02-05 11:44:43,295 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:44:43,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label33.c [2025-02-05 11:44:43,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/984bcb8cc/dab0c8ea2e1c42fda53c2cb495175f5c/FLAGdca1b7dba [2025-02-05 11:44:43,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/984bcb8cc/dab0c8ea2e1c42fda53c2cb495175f5c [2025-02-05 11:44:43,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:44:43,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:44:43,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:44:43,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:44:43,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:44:43,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:44:43" (1/1) ... [2025-02-05 11:44:43,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfdea61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:43, skipping insertion in model container [2025-02-05 11:44:43,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:44:43" (1/1) ... [2025-02-05 11:44:43,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:44:43,640 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/Problem13_label33.c[5177,5190] [2025-02-05 11:44:44,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:44:44,176 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:44:44,194 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/Problem13_label33.c[5177,5190] [2025-02-05 11:44:44,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:44:44,524 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:44:44,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44 WrapperNode [2025-02-05 11:44:44,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:44:44,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:44:44,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:44:44,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:44:44,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (1/1) ... [2025-02-05 11:44:44,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (1/1) ... [2025-02-05 11:44:44,893 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:44:44,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:44:44,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:44:44,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:44:44,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:44:44,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (1/1) ... [2025-02-05 11:44:44,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (1/1) ... [2025-02-05 11:44:44,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (1/1) ... [2025-02-05 11:44:45,246 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-02-05 11:44:45,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (1/1) ... [2025-02-05 11:44:45,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (1/1) ... [2025-02-05 11:44:45,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (1/1) ... [2025-02-05 11:44:45,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (1/1) ... [2025-02-05 11:44:45,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (1/1) ... [2025-02-05 11:44:45,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (1/1) ... [2025-02-05 11:44:45,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:44:45,536 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:44:45,537 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:44:45,537 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:44:45,538 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (1/1) ... [2025-02-05 11:44:45,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:44:45,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:44:45,569 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-02-05 11:44:45,572 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-02-05 11:44:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:44:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:44:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:44:45,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:44:45,646 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:44:45,648 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:44:49,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:44:49,545 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:44:49,545 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:44:49,733 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:44:49,733 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:44:49,771 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:44:49,771 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:44:49,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:44:49 BoogieIcfgContainer [2025-02-05 11:44:49,772 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:44:49,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:44:49,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:44:49,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:44:49,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:44:43" (1/3) ... [2025-02-05 11:44:49,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc205cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:44:49, skipping insertion in model container [2025-02-05 11:44:49,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:44" (2/3) ... [2025-02-05 11:44:49,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc205cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:44:49, skipping insertion in model container [2025-02-05 11:44:49,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:44:49" (3/3) ... [2025-02-05 11:44:49,784 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label33.c [2025-02-05 11:44:49,795 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:44:49,797 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label33.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:44:49,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:44:49,874 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;@10602486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:44:49,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:44:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:49,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 11:44:49,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:49,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:49,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:49,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:49,889 INFO L85 PathProgramCache]: Analyzing trace with hash -324096993, now seen corresponding path program 1 times [2025-02-05 11:44:49,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:49,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232906904] [2025-02-05 11:44:49,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:49,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 11:44:49,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 11:44:49,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:49,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:50,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:50,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232906904] [2025-02-05 11:44:50,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232906904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:50,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:50,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101090542] [2025-02-05 11:44:50,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:50,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:50,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:50,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:50,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:50,181 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:53,727 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-02-05 11:44:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:53,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-05 11:44:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:53,755 INFO L225 Difference]: With dead ends: 3035 [2025-02-05 11:44:53,756 INFO L226 Difference]: Without dead ends: 1873 [2025-02-05 11:44:53,766 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-02-05 11:44:53,769 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 870 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:53,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:44:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-02-05 11:44:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-02-05 11:44:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-02-05 11:44:53,885 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 35 [2025-02-05 11:44:53,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:53,886 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-02-05 11:44:53,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-02-05 11:44:53,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 11:44:53,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:53,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:53,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:44:53,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:53,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1669234985, now seen corresponding path program 1 times [2025-02-05 11:44:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:53,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890728967] [2025-02-05 11:44:53,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:53,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 11:44:53,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 11:44:53,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:53,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:54,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:54,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890728967] [2025-02-05 11:44:54,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890728967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:54,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:54,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:54,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837490452] [2025-02-05 11:44:54,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:54,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:54,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:54,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:54,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:54,213 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:57,776 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2025-02-05 11:44:57,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:57,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-02-05 11:44:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:57,790 INFO L225 Difference]: With dead ends: 5317 [2025-02-05 11:44:57,791 INFO L226 Difference]: Without dead ends: 3460 [2025-02-05 11:44:57,795 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-02-05 11:44:57,797 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:57,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:44:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2025-02-05 11:44:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2025-02-05 11:44:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2025-02-05 11:44:57,873 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 107 [2025-02-05 11:44:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:57,874 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2025-02-05 11:44:57,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2025-02-05 11:44:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 11:44:57,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:57,875 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:44:57,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:44:57,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:57,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:57,876 INFO L85 PathProgramCache]: Analyzing trace with hash -138884703, now seen corresponding path program 1 times [2025-02-05 11:44:57,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:57,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576262305] [2025-02-05 11:44:57,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:57,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:57,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 11:44:57,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 11:44:57,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:57,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:58,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:58,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576262305] [2025-02-05 11:44:58,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576262305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:58,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:58,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:58,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358466632] [2025-02-05 11:44:58,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:58,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:58,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:58,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:58,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:58,035 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:00,995 INFO L93 Difference]: Finished difference Result 10095 states and 13939 transitions. [2025-02-05 11:45:00,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:00,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-02-05 11:45:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:01,015 INFO L225 Difference]: With dead ends: 10095 [2025-02-05 11:45:01,016 INFO L226 Difference]: Without dead ends: 6638 [2025-02-05 11:45:01,022 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-02-05 11:45:01,023 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 932 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:01,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 903 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:45:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2025-02-05 11:45:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6631. [2025-02-05 11:45:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6631 states, 6630 states have (on average 1.2722473604826545) internal successors, (8435), 6630 states have internal predecessors, (8435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6631 states to 6631 states and 8435 transitions. [2025-02-05 11:45:01,150 INFO L78 Accepts]: Start accepts. Automaton has 6631 states and 8435 transitions. Word has length 121 [2025-02-05 11:45:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:01,152 INFO L471 AbstractCegarLoop]: Abstraction has 6631 states and 8435 transitions. [2025-02-05 11:45:01,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 6631 states and 8435 transitions. [2025-02-05 11:45:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 11:45:01,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:01,157 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:45:01,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:45:01,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:01,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:01,158 INFO L85 PathProgramCache]: Analyzing trace with hash -181855607, now seen corresponding path program 1 times [2025-02-05 11:45:01,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:01,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248757498] [2025-02-05 11:45:01,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:01,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:01,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 11:45:01,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 11:45:01,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:01,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:45:01,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248757498] [2025-02-05 11:45:01,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248757498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:01,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:01,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:01,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524419548] [2025-02-05 11:45:01,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:01,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:01,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:01,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:01,313 INFO L87 Difference]: Start difference. First operand 6631 states and 8435 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:04,407 INFO L93 Difference]: Finished difference Result 16437 states and 21419 transitions. [2025-02-05 11:45:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:04,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-02-05 11:45:04,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:04,432 INFO L225 Difference]: With dead ends: 16437 [2025-02-05 11:45:04,432 INFO L226 Difference]: Without dead ends: 9808 [2025-02-05 11:45:04,437 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-02-05 11:45:04,438 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1003 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 3396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:04,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 831 Invalid, 3396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:45:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9808 states. [2025-02-05 11:45:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9808 to 9797. [2025-02-05 11:45:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9797 states, 9796 states have (on average 1.273887300939159) internal successors, (12479), 9796 states have internal predecessors, (12479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9797 states to 9797 states and 12479 transitions. [2025-02-05 11:45:04,566 INFO L78 Accepts]: Start accepts. Automaton has 9797 states and 12479 transitions. Word has length 124 [2025-02-05 11:45:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:04,566 INFO L471 AbstractCegarLoop]: Abstraction has 9797 states and 12479 transitions. [2025-02-05 11:45:04,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 9797 states and 12479 transitions. [2025-02-05 11:45:04,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 11:45:04,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:04,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:45:04,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:45:04,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:04,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:04,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1835079257, now seen corresponding path program 1 times [2025-02-05 11:45:04,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:04,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427704157] [2025-02-05 11:45:04,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:04,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:04,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 11:45:04,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 11:45:04,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:04,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:45:05,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:05,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427704157] [2025-02-05 11:45:05,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427704157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:05,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:05,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:05,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500695048] [2025-02-05 11:45:05,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:05,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:45:05,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:05,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:45:05,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:45:05,226 INFO L87 Difference]: Start difference. First operand 9797 states and 12479 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:10,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:10,674 INFO L93 Difference]: Finished difference Result 29889 states and 37879 transitions. [2025-02-05 11:45:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:45:10,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-02-05 11:45:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:10,727 INFO L225 Difference]: With dead ends: 29889 [2025-02-05 11:45:10,728 INFO L226 Difference]: Without dead ends: 20094 [2025-02-05 11:45:10,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:45:10,739 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 2125 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 5793 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2125 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 6340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 5793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:10,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2125 Valid, 1309 Invalid, 6340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 5793 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-02-05 11:45:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20094 states. [2025-02-05 11:45:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20094 to 20066. [2025-02-05 11:45:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20066 states, 20065 states have (on average 1.184500373785198) internal successors, (23767), 20065 states have internal predecessors, (23767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20066 states to 20066 states and 23767 transitions. [2025-02-05 11:45:11,030 INFO L78 Accepts]: Start accepts. Automaton has 20066 states and 23767 transitions. Word has length 201 [2025-02-05 11:45:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:11,031 INFO L471 AbstractCegarLoop]: Abstraction has 20066 states and 23767 transitions. [2025-02-05 11:45:11,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 20066 states and 23767 transitions. [2025-02-05 11:45:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-05 11:45:11,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:11,035 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:45:11,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:45:11,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:11,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash 723322400, now seen corresponding path program 1 times [2025-02-05 11:45:11,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:11,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550381264] [2025-02-05 11:45:11,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:11,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:11,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-05 11:45:11,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-05 11:45:11,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:11,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:45:11,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:11,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550381264] [2025-02-05 11:45:11,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550381264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:11,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:11,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:11,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069888400] [2025-02-05 11:45:11,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:11,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:11,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:11,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:11,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:11,216 INFO L87 Difference]: Start difference. First operand 20066 states and 23767 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:14,151 INFO L93 Difference]: Finished difference Result 45653 states and 54278 transitions. [2025-02-05 11:45:14,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:14,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2025-02-05 11:45:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:14,194 INFO L225 Difference]: With dead ends: 45653 [2025-02-05 11:45:14,194 INFO L226 Difference]: Without dead ends: 26376 [2025-02-05 11:45:14,211 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-02-05 11:45:14,213 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 859 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 3043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:14,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 950 Invalid, 3043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:45:14,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26376 states. [2025-02-05 11:45:14,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26376 to 25578. [2025-02-05 11:45:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25578 states, 25577 states have (on average 1.177581420807757) internal successors, (30119), 25577 states have internal predecessors, (30119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25578 states to 25578 states and 30119 transitions. [2025-02-05 11:45:14,476 INFO L78 Accepts]: Start accepts. Automaton has 25578 states and 30119 transitions. Word has length 234 [2025-02-05 11:45:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:14,477 INFO L471 AbstractCegarLoop]: Abstraction has 25578 states and 30119 transitions. [2025-02-05 11:45:14,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 25578 states and 30119 transitions. [2025-02-05 11:45:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-05 11:45:14,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:14,484 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:14,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:45:14,485 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:14,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1323708837, now seen corresponding path program 1 times [2025-02-05 11:45:14,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:14,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096945756] [2025-02-05 11:45:14,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:14,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:14,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-05 11:45:14,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-05 11:45:14,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:14,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:45:14,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:14,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096945756] [2025-02-05 11:45:14,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096945756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:14,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:14,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:14,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921829271] [2025-02-05 11:45:14,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:14,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:14,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:14,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:14,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:14,876 INFO L87 Difference]: Start difference. First operand 25578 states and 30119 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:17,761 INFO L93 Difference]: Finished difference Result 51187 states and 60296 transitions. [2025-02-05 11:45:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:17,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 297 [2025-02-05 11:45:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:17,800 INFO L225 Difference]: With dead ends: 51187 [2025-02-05 11:45:17,800 INFO L226 Difference]: Without dead ends: 26398 [2025-02-05 11:45:17,819 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-02-05 11:45:17,821 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 722 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:17,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1918 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:45:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26398 states. [2025-02-05 11:45:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26398 to 26366. [2025-02-05 11:45:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26366 states, 26365 states have (on average 1.1610847714773374) internal successors, (30612), 26365 states have internal predecessors, (30612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26366 states to 26366 states and 30612 transitions. [2025-02-05 11:45:18,121 INFO L78 Accepts]: Start accepts. Automaton has 26366 states and 30612 transitions. Word has length 297 [2025-02-05 11:45:18,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:18,122 INFO L471 AbstractCegarLoop]: Abstraction has 26366 states and 30612 transitions. [2025-02-05 11:45:18,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:18,122 INFO L276 IsEmpty]: Start isEmpty. Operand 26366 states and 30612 transitions. [2025-02-05 11:45:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-02-05 11:45:18,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:18,127 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:18,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:45:18,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:18,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1814418, now seen corresponding path program 1 times [2025-02-05 11:45:18,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:18,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732727074] [2025-02-05 11:45:18,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:18,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:18,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-02-05 11:45:18,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-02-05 11:45:18,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:18,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 11:45:18,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:18,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732727074] [2025-02-05 11:45:18,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732727074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:18,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:18,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:18,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048585265] [2025-02-05 11:45:18,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:18,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:45:18,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:18,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:45:18,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:45:18,387 INFO L87 Difference]: Start difference. First operand 26366 states and 30612 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:24,040 INFO L93 Difference]: Finished difference Result 77342 states and 91874 transitions. [2025-02-05 11:45:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:45:24,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 323 [2025-02-05 11:45:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:24,109 INFO L225 Difference]: With dead ends: 77342 [2025-02-05 11:45:24,109 INFO L226 Difference]: Without dead ends: 51765 [2025-02-05 11:45:24,127 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-02-05 11:45:24,127 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 1718 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 6368 mSolverCounterSat, 1047 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 7415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1047 IncrementalHoareTripleChecker+Valid, 6368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:24,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 1063 Invalid, 7415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1047 Valid, 6368 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-02-05 11:45:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51765 states. [2025-02-05 11:45:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51765 to 51641. [2025-02-05 11:45:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51641 states, 51640 states have (on average 1.167254066615027) internal successors, (60277), 51640 states have internal predecessors, (60277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51641 states to 51641 states and 60277 transitions. [2025-02-05 11:45:24,611 INFO L78 Accepts]: Start accepts. Automaton has 51641 states and 60277 transitions. Word has length 323 [2025-02-05 11:45:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:24,614 INFO L471 AbstractCegarLoop]: Abstraction has 51641 states and 60277 transitions. [2025-02-05 11:45:24,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 51641 states and 60277 transitions. [2025-02-05 11:45:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-05 11:45:24,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:24,620 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:24,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:45:24,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:24,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash 340600966, now seen corresponding path program 1 times [2025-02-05 11:45:24,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:24,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897939660] [2025-02-05 11:45:24,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:24,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:24,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-05 11:45:24,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-05 11:45:24,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:24,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 11:45:24,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897939660] [2025-02-05 11:45:24,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897939660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:24,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:24,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123794684] [2025-02-05 11:45:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:24,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:24,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:24,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:24,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:24,792 INFO L87 Difference]: Start difference. First operand 51641 states and 60277 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-02-05 11:45:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:28,240 INFO L93 Difference]: Finished difference Result 115093 states and 136200 transitions. [2025-02-05 11:45:28,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:28,241 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 326 [2025-02-05 11:45:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:28,320 INFO L225 Difference]: With dead ends: 115093 [2025-02-05 11:45:28,320 INFO L226 Difference]: Without dead ends: 64241 [2025-02-05 11:45:28,357 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-02-05 11:45:28,358 INFO L435 NwaCegarLoop]: 1834 mSDtfsCounter, 821 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 727 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:28,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1985 Invalid, 3291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [727 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:45:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64241 states. [2025-02-05 11:45:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64241 to 63445. [2025-02-05 11:45:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63445 states, 63444 states have (on average 1.1513775928377783) internal successors, (73048), 63444 states have internal predecessors, (73048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63445 states to 63445 states and 73048 transitions. [2025-02-05 11:45:29,383 INFO L78 Accepts]: Start accepts. Automaton has 63445 states and 73048 transitions. Word has length 326 [2025-02-05 11:45:29,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:29,383 INFO L471 AbstractCegarLoop]: Abstraction has 63445 states and 73048 transitions. [2025-02-05 11:45:29,383 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-02-05 11:45:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 63445 states and 73048 transitions. [2025-02-05 11:45:29,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-02-05 11:45:29,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:29,387 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:29,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:45:29,388 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:29,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1515130393, now seen corresponding path program 1 times [2025-02-05 11:45:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:29,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758311986] [2025-02-05 11:45:29,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:29,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:29,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-02-05 11:45:29,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-02-05 11:45:29,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:29,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:45:29,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:29,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758311986] [2025-02-05 11:45:29,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758311986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:29,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:29,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:29,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756100145] [2025-02-05 11:45:29,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:29,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:29,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:29,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:29,665 INFO L87 Difference]: Start difference. First operand 63445 states and 73048 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 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-02-05 11:45:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:32,685 INFO L93 Difference]: Finished difference Result 136320 states and 159234 transitions. [2025-02-05 11:45:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:32,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 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 351 [2025-02-05 11:45:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:32,769 INFO L225 Difference]: With dead ends: 136320 [2025-02-05 11:45:32,769 INFO L226 Difference]: Without dead ends: 73664 [2025-02-05 11:45:32,798 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-02-05 11:45:32,799 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 1130 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:32,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 1560 Invalid, 3175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:45:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73664 states. [2025-02-05 11:45:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73664 to 73663. [2025-02-05 11:45:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73663 states, 73662 states have (on average 1.1366376150525372) internal successors, (83727), 73662 states have internal predecessors, (83727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73663 states to 73663 states and 83727 transitions. [2025-02-05 11:45:33,541 INFO L78 Accepts]: Start accepts. Automaton has 73663 states and 83727 transitions. Word has length 351 [2025-02-05 11:45:33,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:33,541 INFO L471 AbstractCegarLoop]: Abstraction has 73663 states and 83727 transitions. [2025-02-05 11:45:33,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 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-02-05 11:45:33,541 INFO L276 IsEmpty]: Start isEmpty. Operand 73663 states and 83727 transitions. [2025-02-05 11:45:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-05 11:45:33,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:33,547 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:33,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:45:33,548 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:33,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1908157890, now seen corresponding path program 1 times [2025-02-05 11:45:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:33,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972067683] [2025-02-05 11:45:33,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:33,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:33,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-05 11:45:33,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-05 11:45:33,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:33,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:45:33,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:33,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972067683] [2025-02-05 11:45:33,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972067683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:33,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:33,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:33,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072513618] [2025-02-05 11:45:33,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:33,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:33,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:33,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:33,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:33,959 INFO L87 Difference]: Start difference. First operand 73663 states and 83727 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:37,033 INFO L93 Difference]: Finished difference Result 146532 states and 166659 transitions. [2025-02-05 11:45:37,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:37,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 429 [2025-02-05 11:45:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:37,137 INFO L225 Difference]: With dead ends: 146532 [2025-02-05 11:45:37,137 INFO L226 Difference]: Without dead ends: 73658 [2025-02-05 11:45:37,189 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-02-05 11:45:37,190 INFO L435 NwaCegarLoop]: 1708 mSDtfsCounter, 796 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2499 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:37,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1851 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2499 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:45:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73658 states. [2025-02-05 11:45:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73658 to 72850. [2025-02-05 11:45:38,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72850 states, 72849 states have (on average 1.0964598004090653) internal successors, (79876), 72849 states have internal predecessors, (79876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72850 states to 72850 states and 79876 transitions. [2025-02-05 11:45:38,102 INFO L78 Accepts]: Start accepts. Automaton has 72850 states and 79876 transitions. Word has length 429 [2025-02-05 11:45:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:38,103 INFO L471 AbstractCegarLoop]: Abstraction has 72850 states and 79876 transitions. [2025-02-05 11:45:38,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 72850 states and 79876 transitions. [2025-02-05 11:45:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 11:45:38,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:38,110 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:45:38,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:45:38,110 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:38,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:38,111 INFO L85 PathProgramCache]: Analyzing trace with hash -971663066, now seen corresponding path program 1 times [2025-02-05 11:45:38,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:38,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412492717] [2025-02-05 11:45:38,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:38,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:38,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 11:45:38,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 11:45:38,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:38,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 11:45:38,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:38,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412492717] [2025-02-05 11:45:38,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412492717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:38,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:38,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:38,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736607424] [2025-02-05 11:45:38,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:38,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:38,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:38,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:38,237 INFO L87 Difference]: Start difference. First operand 72850 states and 79876 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:41,729 INFO L93 Difference]: Finished difference Result 183453 states and 201156 transitions. [2025-02-05 11:45:41,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:41,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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 457 [2025-02-05 11:45:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:41,864 INFO L225 Difference]: With dead ends: 183453 [2025-02-05 11:45:41,864 INFO L226 Difference]: Without dead ends: 107452 [2025-02-05 11:45:41,900 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-02-05 11:45:41,900 INFO L435 NwaCegarLoop]: 1734 mSDtfsCounter, 865 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 3210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:41,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1864 Invalid, 3210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:45:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107452 states. [2025-02-05 11:45:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107452 to 103509. [2025-02-05 11:45:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103509 states, 103508 states have (on average 1.076061753680875) internal successors, (111381), 103508 states have internal predecessors, (111381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103509 states to 103509 states and 111381 transitions. [2025-02-05 11:45:43,072 INFO L78 Accepts]: Start accepts. Automaton has 103509 states and 111381 transitions. Word has length 457 [2025-02-05 11:45:43,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:43,073 INFO L471 AbstractCegarLoop]: Abstraction has 103509 states and 111381 transitions. [2025-02-05 11:45:43,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 103509 states and 111381 transitions. [2025-02-05 11:45:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-05 11:45:43,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:43,081 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:45:43,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:45:43,081 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:43,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1632689649, now seen corresponding path program 1 times [2025-02-05 11:45:43,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:43,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818632967] [2025-02-05 11:45:43,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:43,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:43,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 11:45:43,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 11:45:43,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:43,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:45:43,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:43,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818632967] [2025-02-05 11:45:43,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818632967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:43,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:43,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:43,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560141794] [2025-02-05 11:45:43,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:43,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:45:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:43,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:45:43,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:45:43,703 INFO L87 Difference]: Start difference. First operand 103509 states and 111381 transitions. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:50,071 INFO L93 Difference]: Finished difference Result 297588 states and 320219 transitions. [2025-02-05 11:45:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:45:50,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 481 [2025-02-05 11:45:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:50,324 INFO L225 Difference]: With dead ends: 297588 [2025-02-05 11:45:50,324 INFO L226 Difference]: Without dead ends: 194868 [2025-02-05 11:45:50,364 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-02-05 11:45:50,365 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 1599 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4749 mSolverCounterSat, 865 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 5614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 865 IncrementalHoareTripleChecker+Valid, 4749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:50,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 810 Invalid, 5614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [865 Valid, 4749 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-02-05 11:45:50,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194868 states. [2025-02-05 11:45:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194868 to 191706. [2025-02-05 11:45:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191706 states, 191705 states have (on average 1.0678751206280483) internal successors, (204717), 191705 states have internal predecessors, (204717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191706 states to 191706 states and 204717 transitions. [2025-02-05 11:45:52,839 INFO L78 Accepts]: Start accepts. Automaton has 191706 states and 204717 transitions. Word has length 481 [2025-02-05 11:45:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:52,840 INFO L471 AbstractCegarLoop]: Abstraction has 191706 states and 204717 transitions. [2025-02-05 11:45:52,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 191706 states and 204717 transitions. [2025-02-05 11:45:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-02-05 11:45:52,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:52,851 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:45:52,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:45:52,851 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:52,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1443306424, now seen corresponding path program 1 times [2025-02-05 11:45:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:52,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041770282] [2025-02-05 11:45:52,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:52,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-02-05 11:45:52,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-02-05 11:45:52,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:52,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-02-05 11:45:53,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:53,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041770282] [2025-02-05 11:45:53,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041770282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:53,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:53,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:53,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514319157] [2025-02-05 11:45:53,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:53,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:53,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:53,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:53,455 INFO L87 Difference]: Start difference. First operand 191706 states and 204717 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:57,571 INFO L93 Difference]: Finished difference Result 383402 states and 409392 transitions. [2025-02-05 11:45:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:57,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 495 [2025-02-05 11:45:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:57,826 INFO L225 Difference]: With dead ends: 383402 [2025-02-05 11:45:57,826 INFO L226 Difference]: Without dead ends: 192485 [2025-02-05 11:45:57,908 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-02-05 11:45:57,908 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 817 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:57,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1445 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:45:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192485 states. [2025-02-05 11:46:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192485 to 190897. [2025-02-05 11:46:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190897 states, 190896 states have (on average 1.0534165199899421) internal successors, (201093), 190896 states have internal predecessors, (201093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190897 states to 190897 states and 201093 transitions. [2025-02-05 11:46:00,290 INFO L78 Accepts]: Start accepts. Automaton has 190897 states and 201093 transitions. Word has length 495 [2025-02-05 11:46:00,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:00,291 INFO L471 AbstractCegarLoop]: Abstraction has 190897 states and 201093 transitions. [2025-02-05 11:46:00,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:00,291 INFO L276 IsEmpty]: Start isEmpty. Operand 190897 states and 201093 transitions. [2025-02-05 11:46:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-02-05 11:46:00,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:00,309 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:46:00,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:46:00,309 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:00,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:00,310 INFO L85 PathProgramCache]: Analyzing trace with hash 191315801, now seen corresponding path program 1 times [2025-02-05 11:46:00,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:00,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150318881] [2025-02-05 11:46:00,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:00,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:00,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-02-05 11:46:00,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-02-05 11:46:00,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:00,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 11:46:01,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:01,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150318881] [2025-02-05 11:46:01,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150318881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:01,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:01,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:46:01,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076046661] [2025-02-05 11:46:01,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:01,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:46:01,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:01,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:46:01,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:46:01,058 INFO L87 Difference]: Start difference. First operand 190897 states and 201093 transitions. Second operand has 4 states, 4 states have (on average 140.5) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:05,142 INFO L93 Difference]: Finished difference Result 373131 states and 393440 transitions. [2025-02-05 11:46:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:46:05,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 140.5) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 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 594 [2025-02-05 11:46:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:05,608 INFO L225 Difference]: With dead ends: 373131 [2025-02-05 11:46:05,609 INFO L226 Difference]: Without dead ends: 197193 [2025-02-05 11:46:05,683 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-02-05 11:46:05,683 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 1331 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 4655 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 5019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 4655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:05,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1028 Invalid, 5019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 4655 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:46:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197193 states.