./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label35.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 d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:47:00,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:47:00,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:47:00,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:47:00,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:47:00,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:47:00,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:47:00,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:47:00,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:47:00,552 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:47:00,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:47:00,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:47:00,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:47:00,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:47:00,553 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:47:00,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:47:00,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:47:00,553 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:47:00,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:47:00,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:47:00,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:47:00,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:47:00,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:47:00,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:47:00,554 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:47:00,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:47:00,554 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:47:00,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:47:00,554 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:47:00,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:47:00,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:47:00,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:47:00,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:47:00,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:47:00,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:47:00,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:47:00,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:47:00,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:47:00,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:47:00,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:47:00,556 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:47:00,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:47:00,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:47:00,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:47:00,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:47:00,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:47:00,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:47:00,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:47:00,557 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 -> d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d [2025-01-08 23:47:00,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:47:00,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:47:00,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:47:00,844 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:47:00,844 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:47:00,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2025-01-08 23:47:02,080 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f48682bf5/e59d40bda84142eb8d926be005a9b824/FLAG476132a14 [2025-01-08 23:47:02,558 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:47:02,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2025-01-08 23:47:02,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f48682bf5/e59d40bda84142eb8d926be005a9b824/FLAG476132a14 [2025-01-08 23:47:02,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f48682bf5/e59d40bda84142eb8d926be005a9b824 [2025-01-08 23:47:02,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:47:02,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:47:02,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:47:02,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:47:02,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:47:02,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:47:02" (1/1) ... [2025-01-08 23:47:02,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575fa61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:02, skipping insertion in model container [2025-01-08 23:47:02,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:47:02" (1/1) ... [2025-01-08 23:47:02,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:47:02,832 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/Problem12_label35.c[1310,1323] [2025-01-08 23:47:03,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:47:03,402 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:47:03,413 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/Problem12_label35.c[1310,1323] [2025-01-08 23:47:03,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:47:03,684 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:47:03,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03 WrapperNode [2025-01-08 23:47:03,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:47:03,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:47:03,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:47:03,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:47:03,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:03,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:03,983 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-01-08 23:47:03,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:47:03,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:47:03,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:47:03,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:47:03,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:03,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:04,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:04,181 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:47:04,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:04,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:04,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:04,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:04,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:04,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:04,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:04,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:47:04,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:47:04,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:47:04,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:47:04,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (1/1) ... [2025-01-08 23:47:04,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:47:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:47:04,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:47:04,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:47:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:47:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:47:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:47:04,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:47:04,512 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:47:04,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:47:07,914 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-01-08 23:47:07,915 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:47:07,933 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:47:07,933 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:47:07,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:47:07 BoogieIcfgContainer [2025-01-08 23:47:07,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:47:07,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:47:07,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:47:07,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:47:07,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:47:02" (1/3) ... [2025-01-08 23:47:07,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bf39e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:47:07, skipping insertion in model container [2025-01-08 23:47:07,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:03" (2/3) ... [2025-01-08 23:47:07,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bf39e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:47:07, skipping insertion in model container [2025-01-08 23:47:07,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:47:07" (3/3) ... [2025-01-08 23:47:07,941 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label35.c [2025-01-08 23:47:07,951 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:47:07,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label35.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:47:08,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:47:08,011 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;@1290c667, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:47:08,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:47:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-08 23:47:08,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:08,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:47:08,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:08,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1805955468, now seen corresponding path program 1 times [2025-01-08 23:47:08,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:08,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045217855] [2025-01-08 23:47:08,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:08,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:08,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-08 23:47:08,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-08 23:47:08,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:08,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:47:08,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:08,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045217855] [2025-01-08 23:47:08,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045217855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:08,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:08,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:47:08,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994392269] [2025-01-08 23:47:08,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:08,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:08,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:08,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:08,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:08,157 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:11,300 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-01-08 23:47:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:11,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-01-08 23:47:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:11,315 INFO L225 Difference]: With dead ends: 2388 [2025-01-08 23:47:11,316 INFO L226 Difference]: Without dead ends: 1506 [2025-01-08 23:47:11,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:11,322 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 827 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:11,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 481 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:47:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-08 23:47:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-01-08 23:47:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2466 transitions. [2025-01-08 23:47:11,396 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2466 transitions. Word has length 7 [2025-01-08 23:47:11,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:11,396 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2466 transitions. [2025-01-08 23:47:11,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2025-01-08 23:47:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-08 23:47:11,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:11,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:47:11,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:47:11,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:11,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash 740214499, now seen corresponding path program 1 times [2025-01-08 23:47:11,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:11,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805038478] [2025-01-08 23:47:11,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:11,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:11,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-08 23:47:11,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-08 23:47:11,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:11,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:47:11,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:11,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805038478] [2025-01-08 23:47:11,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805038478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:11,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:11,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563816645] [2025-01-08 23:47:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:11,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:11,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:11,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:11,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:11,602 INFO L87 Difference]: Start difference. First operand 1506 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:14,135 INFO L93 Difference]: Finished difference Result 4512 states and 7393 transitions. [2025-01-08 23:47:14,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:14,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-01-08 23:47:14,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:14,144 INFO L225 Difference]: With dead ends: 4512 [2025-01-08 23:47:14,144 INFO L226 Difference]: Without dead ends: 3008 [2025-01-08 23:47:14,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:14,148 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 772 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:14,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1391 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:47:14,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-01-08 23:47:14,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2025-01-08 23:47:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.3634852011972065) internal successors, (4100), 3007 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4100 transitions. [2025-01-08 23:47:14,198 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4100 transitions. Word has length 78 [2025-01-08 23:47:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:14,198 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4100 transitions. [2025-01-08 23:47:14,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4100 transitions. [2025-01-08 23:47:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-08 23:47:14,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:14,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:47:14,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:47:14,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:14,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1111903736, now seen corresponding path program 1 times [2025-01-08 23:47:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:14,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447161373] [2025-01-08 23:47:14,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:14,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-08 23:47:14,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-08 23:47:14,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:14,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:47:14,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:14,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447161373] [2025-01-08 23:47:14,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447161373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:14,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:14,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:47:14,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945824564] [2025-01-08 23:47:14,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:14,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:14,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:14,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:14,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:14,354 INFO L87 Difference]: Start difference. First operand 3008 states and 4100 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:16,771 INFO L93 Difference]: Finished difference Result 7516 states and 10661 transitions. [2025-01-08 23:47:16,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:16,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-01-08 23:47:16,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:16,783 INFO L225 Difference]: With dead ends: 7516 [2025-01-08 23:47:16,783 INFO L226 Difference]: Without dead ends: 4510 [2025-01-08 23:47:16,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:16,786 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 748 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:16,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 520 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:47:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2025-01-08 23:47:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4510. [2025-01-08 23:47:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.3251275227323132) internal successors, (5975), 4509 states have internal predecessors, (5975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 5975 transitions. [2025-01-08 23:47:16,834 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 5975 transitions. Word has length 81 [2025-01-08 23:47:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:16,834 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 5975 transitions. [2025-01-08 23:47:16,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5975 transitions. [2025-01-08 23:47:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-08 23:47:16,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:16,836 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:47:16,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:47:16,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:16,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:16,837 INFO L85 PathProgramCache]: Analyzing trace with hash -839353146, now seen corresponding path program 1 times [2025-01-08 23:47:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:16,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240739492] [2025-01-08 23:47:16,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:16,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:16,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-08 23:47:16,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-08 23:47:16,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:16,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:47:17,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:17,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240739492] [2025-01-08 23:47:17,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240739492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:17,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:17,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670455143] [2025-01-08 23:47:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:17,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:47:17,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:17,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:47:17,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:47:17,082 INFO L87 Difference]: Start difference. First operand 4510 states and 5975 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:20,799 INFO L93 Difference]: Finished difference Result 14275 states and 18791 transitions. [2025-01-08 23:47:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:47:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-08 23:47:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:20,825 INFO L225 Difference]: With dead ends: 14275 [2025-01-08 23:47:20,826 INFO L226 Difference]: Without dead ends: 9767 [2025-01-08 23:47:20,831 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-01-08 23:47:20,833 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 2160 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4749 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 5527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 4749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:20,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 187 Invalid, 5527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 4749 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:47:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-01-08 23:47:20,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9016. [2025-01-08 23:47:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9016 states, 9015 states have (on average 1.303716028840821) internal successors, (11753), 9015 states have internal predecessors, (11753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9016 states to 9016 states and 11753 transitions. [2025-01-08 23:47:20,947 INFO L78 Accepts]: Start accepts. Automaton has 9016 states and 11753 transitions. Word has length 92 [2025-01-08 23:47:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:20,947 INFO L471 AbstractCegarLoop]: Abstraction has 9016 states and 11753 transitions. [2025-01-08 23:47:20,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 9016 states and 11753 transitions. [2025-01-08 23:47:20,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-08 23:47:20,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:20,951 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:47:20,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:47:20,952 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:20,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1179164400, now seen corresponding path program 1 times [2025-01-08 23:47:20,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:20,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809566986] [2025-01-08 23:47:20,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:20,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:20,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-08 23:47:20,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-08 23:47:20,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:20,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-08 23:47:21,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809566986] [2025-01-08 23:47:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809566986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:21,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:21,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:21,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66967408] [2025-01-08 23:47:21,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:21,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:47:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:21,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:47:21,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:47:21,337 INFO L87 Difference]: Start difference. First operand 9016 states and 11753 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:24,421 INFO L93 Difference]: Finished difference Result 22575 states and 30203 transitions. [2025-01-08 23:47:24,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:47:24,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 211 [2025-01-08 23:47:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:24,453 INFO L225 Difference]: With dead ends: 22575 [2025-01-08 23:47:24,455 INFO L226 Difference]: Without dead ends: 12773 [2025-01-08 23:47:24,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:47:24,462 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 690 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 4469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 3806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:24,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 714 Invalid, 4469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 3806 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:47:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12773 states. [2025-01-08 23:47:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12773 to 12771. [2025-01-08 23:47:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12771 states, 12770 states have (on average 1.2170712607674237) internal successors, (15542), 12770 states have internal predecessors, (15542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12771 states to 12771 states and 15542 transitions. [2025-01-08 23:47:24,603 INFO L78 Accepts]: Start accepts. Automaton has 12771 states and 15542 transitions. Word has length 211 [2025-01-08 23:47:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:24,604 INFO L471 AbstractCegarLoop]: Abstraction has 12771 states and 15542 transitions. [2025-01-08 23:47:24,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 12771 states and 15542 transitions. [2025-01-08 23:47:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-08 23:47:24,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:24,607 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:47:24,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:47:24,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:24,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1843681142, now seen corresponding path program 1 times [2025-01-08 23:47:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715977439] [2025-01-08 23:47:24,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:24,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:24,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-08 23:47:24,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-08 23:47:24,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:24,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 41 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:47:24,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:24,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715977439] [2025-01-08 23:47:24,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715977439] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:47:24,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298212550] [2025-01-08 23:47:24,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:24,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:47:24,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:47:24,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:47:24,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:47:25,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-08 23:47:25,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-08 23:47:25,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:25,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:25,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:47:25,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:47:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:47:25,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:47:25,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298212550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:25,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:47:25,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 23:47:25,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650292352] [2025-01-08 23:47:25,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:25,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:25,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:25,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:25,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:47:25,120 INFO L87 Difference]: Start difference. First operand 12771 states and 15542 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:27,675 INFO L93 Difference]: Finished difference Result 32299 states and 40251 transitions. [2025-01-08 23:47:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:27,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 237 [2025-01-08 23:47:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:27,723 INFO L225 Difference]: With dead ends: 32299 [2025-01-08 23:47:27,723 INFO L226 Difference]: Without dead ends: 20281 [2025-01-08 23:47:27,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:47:27,733 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 805 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2300 mSolverCounterSat, 745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 745 IncrementalHoareTripleChecker+Valid, 2300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:27,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 972 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [745 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:47:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20281 states. [2025-01-08 23:47:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20281 to 18779. [2025-01-08 23:47:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18779 states, 18778 states have (on average 1.2514644797102994) internal successors, (23500), 18778 states have internal predecessors, (23500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18779 states to 18779 states and 23500 transitions. [2025-01-08 23:47:27,887 INFO L78 Accepts]: Start accepts. Automaton has 18779 states and 23500 transitions. Word has length 237 [2025-01-08 23:47:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:27,888 INFO L471 AbstractCegarLoop]: Abstraction has 18779 states and 23500 transitions. [2025-01-08 23:47:27,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18779 states and 23500 transitions. [2025-01-08 23:47:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-01-08 23:47:27,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:27,893 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:47:27,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:47:28,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:47:28,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:28,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:28,095 INFO L85 PathProgramCache]: Analyzing trace with hash -67749264, now seen corresponding path program 1 times [2025-01-08 23:47:28,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:28,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098904134] [2025-01-08 23:47:28,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:28,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:28,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-01-08 23:47:28,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-01-08 23:47:28,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:28,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:47:28,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098904134] [2025-01-08 23:47:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098904134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:28,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:28,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655015061] [2025-01-08 23:47:28,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:28,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:28,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:28,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:28,363 INFO L87 Difference]: Start difference. First operand 18779 states and 23500 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:31,151 INFO L93 Difference]: Finished difference Result 50323 states and 64012 transitions. [2025-01-08 23:47:31,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:31,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 387 [2025-01-08 23:47:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:31,203 INFO L225 Difference]: With dead ends: 50323 [2025-01-08 23:47:31,203 INFO L226 Difference]: Without dead ends: 32297 [2025-01-08 23:47:31,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:31,219 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 671 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2203 mSolverCounterSat, 732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 2203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:31,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 316 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 2203 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:47:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32297 states. [2025-01-08 23:47:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32297 to 32297. [2025-01-08 23:47:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32297 states, 32296 states have (on average 1.21916026752539) internal successors, (39374), 32296 states have internal predecessors, (39374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32297 states to 32297 states and 39374 transitions. [2025-01-08 23:47:31,590 INFO L78 Accepts]: Start accepts. Automaton has 32297 states and 39374 transitions. Word has length 387 [2025-01-08 23:47:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:31,590 INFO L471 AbstractCegarLoop]: Abstraction has 32297 states and 39374 transitions. [2025-01-08 23:47:31,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 32297 states and 39374 transitions. [2025-01-08 23:47:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-01-08 23:47:31,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:31,610 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:47:31,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:47:31,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:31,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1496008811, now seen corresponding path program 1 times [2025-01-08 23:47:31,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:31,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299501357] [2025-01-08 23:47:31,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:31,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-01-08 23:47:31,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-01-08 23:47:31,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:31,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:47:32,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299501357] [2025-01-08 23:47:32,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299501357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:32,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:32,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844479124] [2025-01-08 23:47:32,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:32,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:32,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:32,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:32,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:32,055 INFO L87 Difference]: Start difference. First operand 32297 states and 39374 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:35,020 INFO L93 Difference]: Finished difference Result 75857 states and 94531 transitions. [2025-01-08 23:47:35,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:35,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 396 [2025-01-08 23:47:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:35,122 INFO L225 Difference]: With dead ends: 75857 [2025-01-08 23:47:35,123 INFO L226 Difference]: Without dead ends: 44313 [2025-01-08 23:47:35,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:35,148 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 681 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 863 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 2966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 863 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:35,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 332 Invalid, 2966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [863 Valid, 2103 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:47:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44313 states. [2025-01-08 23:47:35,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44313 to 44313. [2025-01-08 23:47:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44313 states, 44312 states have (on average 1.2252888608051995) internal successors, (54295), 44312 states have internal predecessors, (54295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44313 states to 44313 states and 54295 transitions. [2025-01-08 23:47:35,651 INFO L78 Accepts]: Start accepts. Automaton has 44313 states and 54295 transitions. Word has length 396 [2025-01-08 23:47:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:35,652 INFO L471 AbstractCegarLoop]: Abstraction has 44313 states and 54295 transitions. [2025-01-08 23:47:35,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 44313 states and 54295 transitions. [2025-01-08 23:47:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-01-08 23:47:35,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:35,662 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:47:35,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:47:35,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:35,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:35,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1429629901, now seen corresponding path program 1 times [2025-01-08 23:47:35,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:35,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844554261] [2025-01-08 23:47:35,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:35,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:35,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-08 23:47:35,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-08 23:47:35,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:35,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-01-08 23:47:36,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:36,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844554261] [2025-01-08 23:47:36,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844554261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:36,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:36,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:47:36,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234793592] [2025-01-08 23:47:36,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:36,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:36,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:36,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:36,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:36,032 INFO L87 Difference]: Start difference. First operand 44313 states and 54295 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:38,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:38,692 INFO L93 Difference]: Finished difference Result 120168 states and 148618 transitions. [2025-01-08 23:47:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:38,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 408 [2025-01-08 23:47:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:38,766 INFO L225 Difference]: With dead ends: 120168 [2025-01-08 23:47:38,766 INFO L226 Difference]: Without dead ends: 71351 [2025-01-08 23:47:38,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:38,806 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 817 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:38,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 323 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:47:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71351 states. [2025-01-08 23:47:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71351 to 69096. [2025-01-08 23:47:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69096 states, 69095 states have (on average 1.171937187929662) internal successors, (80975), 69095 states have internal predecessors, (80975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69096 states to 69096 states and 80975 transitions. [2025-01-08 23:47:39,577 INFO L78 Accepts]: Start accepts. Automaton has 69096 states and 80975 transitions. Word has length 408 [2025-01-08 23:47:39,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:39,578 INFO L471 AbstractCegarLoop]: Abstraction has 69096 states and 80975 transitions. [2025-01-08 23:47:39,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 69096 states and 80975 transitions. [2025-01-08 23:47:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-01-08 23:47:39,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:39,583 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:47:39,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:47:39,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:39,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:39,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1255384561, now seen corresponding path program 1 times [2025-01-08 23:47:39,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:39,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804771162] [2025-01-08 23:47:39,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:39,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:39,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-01-08 23:47:39,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-01-08 23:47:39,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:39,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 23:47:40,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:40,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804771162] [2025-01-08 23:47:40,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804771162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:40,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:40,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:40,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890672234] [2025-01-08 23:47:40,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:40,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:40,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:40,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:40,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:40,057 INFO L87 Difference]: Start difference. First operand 69096 states and 80975 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:43,040 INFO L93 Difference]: Finished difference Result 153961 states and 181220 transitions. [2025-01-08 23:47:43,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:43,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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 425 [2025-01-08 23:47:43,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:43,131 INFO L225 Difference]: With dead ends: 153961 [2025-01-08 23:47:43,132 INFO L226 Difference]: Without dead ends: 85618 [2025-01-08 23:47:43,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:43,157 INFO L435 NwaCegarLoop]: 1237 mSDtfsCounter, 696 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:43,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1245 Invalid, 2662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2287 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:47:43,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85618 states. [2025-01-08 23:47:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85618 to 81863. [2025-01-08 23:47:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81863 states, 81862 states have (on average 1.1589137817302289) internal successors, (94871), 81862 states have internal predecessors, (94871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81863 states to 81863 states and 94871 transitions. [2025-01-08 23:47:44,141 INFO L78 Accepts]: Start accepts. Automaton has 81863 states and 94871 transitions. Word has length 425 [2025-01-08 23:47:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:44,142 INFO L471 AbstractCegarLoop]: Abstraction has 81863 states and 94871 transitions. [2025-01-08 23:47:44,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 81863 states and 94871 transitions. [2025-01-08 23:47:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-08 23:47:44,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:44,156 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:47:44,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:47:44,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:44,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1288779451, now seen corresponding path program 1 times [2025-01-08 23:47:44,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:44,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504339448] [2025-01-08 23:47:44,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:44,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-08 23:47:44,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-08 23:47:44,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:44,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-01-08 23:47:44,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:44,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504339448] [2025-01-08 23:47:44,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504339448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:44,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376036180] [2025-01-08 23:47:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:44,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:44,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:44,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:44,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:44,426 INFO L87 Difference]: Start difference. First operand 81863 states and 94871 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:47,177 INFO L93 Difference]: Finished difference Result 188507 states and 219994 transitions. [2025-01-08 23:47:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:47,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 428 [2025-01-08 23:47:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:47,296 INFO L225 Difference]: With dead ends: 188507 [2025-01-08 23:47:47,296 INFO L226 Difference]: Without dead ends: 107397 [2025-01-08 23:47:47,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:47,336 INFO L435 NwaCegarLoop]: 1241 mSDtfsCounter, 606 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:47,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1249 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 2192 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:47:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107397 states. [2025-01-08 23:47:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107397 to 102891. [2025-01-08 23:47:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102891 states, 102890 states have (on average 1.1285256098746235) internal successors, (116114), 102890 states have internal predecessors, (116114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102891 states to 102891 states and 116114 transitions. [2025-01-08 23:47:48,290 INFO L78 Accepts]: Start accepts. Automaton has 102891 states and 116114 transitions. Word has length 428 [2025-01-08 23:47:48,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:48,291 INFO L471 AbstractCegarLoop]: Abstraction has 102891 states and 116114 transitions. [2025-01-08 23:47:48,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 102891 states and 116114 transitions. [2025-01-08 23:47:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-08 23:47:48,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:48,295 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:47:48,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:47:48,295 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:48,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:48,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2056465781, now seen corresponding path program 1 times [2025-01-08 23:47:48,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:48,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137134156] [2025-01-08 23:47:48,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:48,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:48,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-08 23:47:48,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-08 23:47:48,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:48,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-08 23:47:48,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:48,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137134156] [2025-01-08 23:47:48,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137134156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:48,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:48,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125024780] [2025-01-08 23:47:48,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:48,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:48,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:48,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:48,663 INFO L87 Difference]: Start difference. First operand 102891 states and 116114 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:51,698 INFO L93 Difference]: Finished difference Result 250089 states and 281683 transitions. [2025-01-08 23:47:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:51,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 441 [2025-01-08 23:47:51,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:51,859 INFO L225 Difference]: With dead ends: 250089 [2025-01-08 23:47:51,859 INFO L226 Difference]: Without dead ends: 147951 [2025-01-08 23:47:51,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:51,915 INFO L435 NwaCegarLoop]: 1240 mSDtfsCounter, 564 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:51,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1248 Invalid, 2872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:47:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147951 states. [2025-01-08 23:47:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147951 to 143445. [2025-01-08 23:47:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143445 states, 143444 states have (on average 1.11825520760715) internal successors, (160407), 143444 states have internal predecessors, (160407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143445 states to 143445 states and 160407 transitions. [2025-01-08 23:47:53,539 INFO L78 Accepts]: Start accepts. Automaton has 143445 states and 160407 transitions. Word has length 441 [2025-01-08 23:47:53,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:53,540 INFO L471 AbstractCegarLoop]: Abstraction has 143445 states and 160407 transitions. [2025-01-08 23:47:53,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 143445 states and 160407 transitions. [2025-01-08 23:47:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-01-08 23:47:53,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:53,550 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-01-08 23:47:53,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:47:53,551 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:53,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash 952219012, now seen corresponding path program 1 times [2025-01-08 23:47:53,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:53,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347175388] [2025-01-08 23:47:53,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:53,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-01-08 23:47:53,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-01-08 23:47:53,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:53,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 511 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-08 23:47:53,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:53,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347175388] [2025-01-08 23:47:53,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347175388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:53,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:53,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:53,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803714243] [2025-01-08 23:47:53,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:53,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:53,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:53,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:53,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:53,741 INFO L87 Difference]: Start difference. First operand 143445 states and 160407 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:56,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:56,842 INFO L93 Difference]: Finished difference Result 290643 states and 324666 transitions. [2025-01-08 23:47:56,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:56,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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 529 [2025-01-08 23:47:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:56,996 INFO L225 Difference]: With dead ends: 290643 [2025-01-08 23:47:56,996 INFO L226 Difference]: Without dead ends: 147951 [2025-01-08 23:47:57,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:57,054 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 735 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 604 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:57,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 216 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [604 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:47:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147951 states. [2025-01-08 23:47:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147951 to 143445. [2025-01-08 23:47:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143445 states, 143444 states have (on average 1.1122528652296366) internal successors, (159546), 143444 states have internal predecessors, (159546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143445 states to 143445 states and 159546 transitions. [2025-01-08 23:47:58,512 INFO L78 Accepts]: Start accepts. Automaton has 143445 states and 159546 transitions. Word has length 529 [2025-01-08 23:47:58,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:58,513 INFO L471 AbstractCegarLoop]: Abstraction has 143445 states and 159546 transitions. [2025-01-08 23:47:58,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:58,513 INFO L276 IsEmpty]: Start isEmpty. Operand 143445 states and 159546 transitions. [2025-01-08 23:47:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-01-08 23:47:58,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:58,522 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:47:58,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:47:58,522 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:58,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:58,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2123022922, now seen corresponding path program 1 times [2025-01-08 23:47:58,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:58,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564732239] [2025-01-08 23:47:58,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:58,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:58,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-01-08 23:47:58,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-01-08 23:47:58,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:58,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-01-08 23:47:58,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564732239] [2025-01-08 23:47:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564732239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:58,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:58,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:58,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998312480] [2025-01-08 23:47:58,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:58,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:58,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:58,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:58,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:58,727 INFO L87 Difference]: Start difference. First operand 143445 states and 159546 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:02,414 INFO L93 Difference]: Finished difference Result 337205 states and 377089 transitions. [2025-01-08 23:48:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:02,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 552 [2025-01-08 23:48:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:02,672 INFO L225 Difference]: With dead ends: 337205 [2025-01-08 23:48:02,672 INFO L226 Difference]: Without dead ends: 194513 [2025-01-08 23:48:02,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:02,740 INFO L435 NwaCegarLoop]: 1231 mSDtfsCounter, 535 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:02,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1238 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 2113 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:48:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194513 states. [2025-01-08 23:48:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194513 to 184750. [2025-01-08 23:48:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184750 states, 184749 states have (on average 1.0961141873569005) internal successors, (202506), 184749 states have internal predecessors, (202506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184750 states to 184750 states and 202506 transitions. [2025-01-08 23:48:05,149 INFO L78 Accepts]: Start accepts. Automaton has 184750 states and 202506 transitions. Word has length 552 [2025-01-08 23:48:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:05,149 INFO L471 AbstractCegarLoop]: Abstraction has 184750 states and 202506 transitions. [2025-01-08 23:48:05,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 184750 states and 202506 transitions. [2025-01-08 23:48:05,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-01-08 23:48:05,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:05,176 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:48:05,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:48:05,176 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:05,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:05,177 INFO L85 PathProgramCache]: Analyzing trace with hash -430923444, now seen corresponding path program 1 times [2025-01-08 23:48:05,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:05,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859633896] [2025-01-08 23:48:05,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:05,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:05,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-01-08 23:48:05,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-01-08 23:48:05,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:05,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-01-08 23:48:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:06,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859633896] [2025-01-08 23:48:06,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859633896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:06,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:06,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:06,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427272030] [2025-01-08 23:48:06,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:06,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:06,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:06,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:06,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:06,056 INFO L87 Difference]: Start difference. First operand 184750 states and 202506 transitions. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:08,779 INFO L93 Difference]: Finished difference Result 371751 states and 407320 transitions. [2025-01-08 23:48:08,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:08,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 560 [2025-01-08 23:48:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:08,987 INFO L225 Difference]: With dead ends: 371751 [2025-01-08 23:48:08,988 INFO L226 Difference]: Without dead ends: 187754 [2025-01-08 23:48:09,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:09,327 INFO L435 NwaCegarLoop]: 1198 mSDtfsCounter, 591 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:09,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1206 Invalid, 2616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2346 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:48:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187754 states. [2025-01-08 23:48:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187754 to 184750. [2025-01-08 23:48:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184750 states, 184749 states have (on average 1.0897758580560652) internal successors, (201335), 184749 states have internal predecessors, (201335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184750 states to 184750 states and 201335 transitions. [2025-01-08 23:48:11,312 INFO L78 Accepts]: Start accepts. Automaton has 184750 states and 201335 transitions. Word has length 560 [2025-01-08 23:48:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:11,313 INFO L471 AbstractCegarLoop]: Abstraction has 184750 states and 201335 transitions. [2025-01-08 23:48:11,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 184750 states and 201335 transitions. [2025-01-08 23:48:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-01-08 23:48:11,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:11,328 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:48:11,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:48:11,329 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:11,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1214767378, now seen corresponding path program 1 times [2025-01-08 23:48:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:11,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289141808] [2025-01-08 23:48:11,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:11,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:11,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-01-08 23:48:11,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-01-08 23:48:11,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:11,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-08 23:48:12,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:12,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289141808] [2025-01-08 23:48:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289141808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801205597] [2025-01-08 23:48:12,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:12,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:48:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:12,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:48:12,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:48:12,054 INFO L87 Difference]: Start difference. First operand 184750 states and 201335 transitions. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:17,095 INFO L93 Difference]: Finished difference Result 547487 states and 598012 transitions. [2025-01-08 23:48:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:48:17,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 585 [2025-01-08 23:48:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:17,544 INFO L225 Difference]: With dead ends: 547487 [2025-01-08 23:48:17,544 INFO L226 Difference]: Without dead ends: 363490 [2025-01-08 23:48:17,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:48:17,618 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 1710 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4713 mSolverCounterSat, 618 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 5331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 618 IncrementalHoareTripleChecker+Valid, 4713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:17,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 77 Invalid, 5331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [618 Valid, 4713 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-08 23:48:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363490 states. [2025-01-08 23:48:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363490 to 342460. [2025-01-08 23:48:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342460 states, 342459 states have (on average 1.0928957919050164) internal successors, (374272), 342459 states have internal predecessors, (374272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342460 states to 342460 states and 374272 transitions. [2025-01-08 23:48:22,069 INFO L78 Accepts]: Start accepts. Automaton has 342460 states and 374272 transitions. Word has length 585 [2025-01-08 23:48:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:22,073 INFO L471 AbstractCegarLoop]: Abstraction has 342460 states and 374272 transitions. [2025-01-08 23:48:22,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 342460 states and 374272 transitions. [2025-01-08 23:48:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-01-08 23:48:22,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:22,093 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-08 23:48:22,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:48:22,093 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:22,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1995846566, now seen corresponding path program 1 times [2025-01-08 23:48:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:22,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958770849] [2025-01-08 23:48:22,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:22,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-01-08 23:48:22,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-01-08 23:48:22,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:22,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 716 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-08 23:48:22,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:22,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958770849] [2025-01-08 23:48:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958770849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:22,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:22,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:22,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784223837] [2025-01-08 23:48:22,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:22,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:22,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:22,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:22,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:22,854 INFO L87 Difference]: Start difference. First operand 342460 states and 374272 transitions. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:26,721 INFO L93 Difference]: Finished difference Result 688673 states and 752408 transitions. [2025-01-08 23:48:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:26,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 597 [2025-01-08 23:48:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:27,168 INFO L225 Difference]: With dead ends: 688673 [2025-01-08 23:48:27,168 INFO L226 Difference]: Without dead ends: 346966 [2025-01-08 23:48:27,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:27,258 INFO L435 NwaCegarLoop]: 1283 mSDtfsCounter, 601 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:27,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1290 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:48:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346966 states.