./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label33.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/Problem11_label33.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7166744474158954665024dc8c8b3712d72f905c129b3d2684427468d2506fe1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:42:12,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:42:12,891 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:42:12,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:42:12,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:42:12,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:42:12,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:42:12,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:42:12,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:42:12,928 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:42:12,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:42:12,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:42:12,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:42:12,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:42:12,930 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:42:12,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:42:12,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:42:12,931 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:42:12,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:42:12,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:42:12,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:42:12,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:42:12,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:42:12,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:42:12,932 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:42:12,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:42:12,932 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:42:12,932 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:42:12,932 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:42:12,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:42:12,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:42:12,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:42:12,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:12,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:42:12,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:42:12,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:42:12,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:42:12,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:12,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:42:12,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:42:12,933 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:42:12,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:42:12,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:42:12,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:42:12,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:42:12,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:42:12,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:42:12,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:42:12,933 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 -> 7166744474158954665024dc8c8b3712d72f905c129b3d2684427468d2506fe1 [2025-01-08 23:42:13,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:42:13,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:42:13,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:42:13,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:42:13,188 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:42:13,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label33.c [2025-01-08 23:42:14,315 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0863a82ab/68d50fcec28b4c7e9b81008261cbb868/FLAGc77f35c7e [2025-01-08 23:42:14,644 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:42:14,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label33.c [2025-01-08 23:42:14,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0863a82ab/68d50fcec28b4c7e9b81008261cbb868/FLAGc77f35c7e [2025-01-08 23:42:14,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0863a82ab/68d50fcec28b4c7e9b81008261cbb868 [2025-01-08 23:42:14,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:42:14,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:42:14,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:42:14,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:42:14,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:42:14,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:42:14" (1/1) ... [2025-01-08 23:42:14,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:14, skipping insertion in model container [2025-01-08 23:42:14,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:42:14" (1/1) ... [2025-01-08 23:42:14,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:42:15,034 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/Problem11_label33.c[4121,4134] [2025-01-08 23:42:15,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:42:15,206 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:42:15,222 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/Problem11_label33.c[4121,4134] [2025-01-08 23:42:15,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:42:15,316 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:42:15,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15 WrapperNode [2025-01-08 23:42:15,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:42:15,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:42:15,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:42:15,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:42:15,324 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:42:15" (1/1) ... [2025-01-08 23:42:15,344 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:42:15" (1/1) ... [2025-01-08 23:42:15,425 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:42:15,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:42:15,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:42:15,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:42:15,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:42:15,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15" (1/1) ... [2025-01-08 23:42:15,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15" (1/1) ... [2025-01-08 23:42:15,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15" (1/1) ... [2025-01-08 23:42:15,506 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:42:15,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15" (1/1) ... [2025-01-08 23:42:15,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15" (1/1) ... [2025-01-08 23:42:15,530 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15" (1/1) ... [2025-01-08 23:42:15,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15" (1/1) ... [2025-01-08 23:42:15,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15" (1/1) ... [2025-01-08 23:42:15,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15" (1/1) ... [2025-01-08 23:42:15,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15" (1/1) ... [2025-01-08 23:42:15,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:42:15,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:42:15,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:42:15,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:42:15,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15" (1/1) ... [2025-01-08 23:42:15,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:15,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:15,607 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:42:15,610 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:42:15,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:42:15,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:42:15,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:42:15,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:42:15,678 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:42:15,680 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:42:16,871 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:42:16,871 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:42:16,884 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:42:16,884 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:42:16,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:16 BoogieIcfgContainer [2025-01-08 23:42:16,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:42:16,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:42:16,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:42:16,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:42:16,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:42:14" (1/3) ... [2025-01-08 23:42:16,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532307ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:42:16, skipping insertion in model container [2025-01-08 23:42:16,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:15" (2/3) ... [2025-01-08 23:42:16,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532307ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:42:16, skipping insertion in model container [2025-01-08 23:42:16,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:16" (3/3) ... [2025-01-08 23:42:16,901 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label33.c [2025-01-08 23:42:16,912 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:42:16,915 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label33.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:42:16,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:42:16,975 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;@300bec35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:42:16,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:42:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 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:42:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 23:42:16,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:16,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:16,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:16,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:16,992 INFO L85 PathProgramCache]: Analyzing trace with hash -161316190, now seen corresponding path program 1 times [2025-01-08 23:42:16,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:16,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749305660] [2025-01-08 23:42:16,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:16,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:17,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 23:42:17,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 23:42:17,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:17,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:17,209 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:42:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:17,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749305660] [2025-01-08 23:42:17,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749305660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:17,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:17,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:17,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017394302] [2025-01-08 23:42:17,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:17,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:17,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:17,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:17,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:17,227 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:18,046 INFO L93 Difference]: Finished difference Result 776 states and 1360 transitions. [2025-01-08 23:42:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:18,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-08 23:42:18,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:18,054 INFO L225 Difference]: With dead ends: 776 [2025-01-08 23:42:18,054 INFO L226 Difference]: Without dead ends: 413 [2025-01-08 23:42:18,056 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:42:18,058 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 199 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:18,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 197 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-08 23:42:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2025-01-08 23:42:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:42:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2025-01-08 23:42:18,094 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 28 [2025-01-08 23:42:18,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:18,094 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2025-01-08 23:42:18,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2025-01-08 23:42:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-08 23:42:18,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:18,096 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:18,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:42:18,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:18,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1233470758, now seen corresponding path program 1 times [2025-01-08 23:42:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:18,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656799398] [2025-01-08 23:42:18,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:18,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:18,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-08 23:42:18,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-08 23:42:18,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:18,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:18,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:18,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656799398] [2025-01-08 23:42:18,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656799398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:18,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:18,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:18,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217586469] [2025-01-08 23:42:18,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:18,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:18,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:18,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:18,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:18,304 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:42:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:18,853 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2025-01-08 23:42:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:18,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-08 23:42:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:18,857 INFO L225 Difference]: With dead ends: 1209 [2025-01-08 23:42:18,857 INFO L226 Difference]: Without dead ends: 800 [2025-01-08 23:42:18,858 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:42:18,858 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:18,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-08 23:42:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2025-01-08 23:42:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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:42:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2025-01-08 23:42:18,891 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 96 [2025-01-08 23:42:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:18,891 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2025-01-08 23:42:18,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:42:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2025-01-08 23:42:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-08 23:42:18,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:18,894 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:18,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:42:18,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:18,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:18,897 INFO L85 PathProgramCache]: Analyzing trace with hash 734271317, now seen corresponding path program 1 times [2025-01-08 23:42:18,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:18,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225747324] [2025-01-08 23:42:18,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:18,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:18,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-08 23:42:18,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-08 23:42:18,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:18,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:19,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:19,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225747324] [2025-01-08 23:42:19,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225747324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:19,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:19,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:19,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082275777] [2025-01-08 23:42:19,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:19,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:19,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:19,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:19,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:19,120 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:42:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:19,604 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2025-01-08 23:42:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:19,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-01-08 23:42:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:19,611 INFO L225 Difference]: With dead ends: 1941 [2025-01-08 23:42:19,612 INFO L226 Difference]: Without dead ends: 1156 [2025-01-08 23:42:19,614 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:42:19,615 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:19,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-01-08 23:42:19,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2025-01-08 23:42:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 0 states have call successors, (0), 0 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:42:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2025-01-08 23:42:19,650 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 98 [2025-01-08 23:42:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:19,651 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2025-01-08 23:42:19,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:42:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2025-01-08 23:42:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-08 23:42:19,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:19,656 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:19,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:42:19,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:19,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2126498338, now seen corresponding path program 1 times [2025-01-08 23:42:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555842524] [2025-01-08 23:42:19,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:19,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-08 23:42:19,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-08 23:42:19,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:19,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 23:42:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:19,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555842524] [2025-01-08 23:42:19,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555842524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:19,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:19,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40745978] [2025-01-08 23:42:19,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:19,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:19,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:19,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:19,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:19,855 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:42:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:20,450 INFO L93 Difference]: Finished difference Result 3056 states and 3914 transitions. [2025-01-08 23:42:20,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:20,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 140 [2025-01-08 23:42:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:20,457 INFO L225 Difference]: With dead ends: 3056 [2025-01-08 23:42:20,457 INFO L226 Difference]: Without dead ends: 1902 [2025-01-08 23:42:20,458 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:42:20,460 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:20,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2025-01-08 23:42:20,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1901. [2025-01-08 23:42:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1900 states have (on average 1.22) internal successors, (2318), 1900 states have internal predecessors, (2318), 0 states have call successors, (0), 0 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:42:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2318 transitions. [2025-01-08 23:42:20,492 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2318 transitions. Word has length 140 [2025-01-08 23:42:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:20,492 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2318 transitions. [2025-01-08 23:42:20,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:42:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2318 transitions. [2025-01-08 23:42:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-08 23:42:20,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:20,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:20,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:42:20,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:20,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash -236083118, now seen corresponding path program 1 times [2025-01-08 23:42:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965328999] [2025-01-08 23:42:20,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:20,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-08 23:42:20,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-08 23:42:20,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:20,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:20,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:20,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965328999] [2025-01-08 23:42:20,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965328999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:20,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:20,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:20,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696179292] [2025-01-08 23:42:20,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:20,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:20,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:20,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:20,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:20,713 INFO L87 Difference]: Start difference. First operand 1901 states and 2318 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:21,298 INFO L93 Difference]: Finished difference Result 4382 states and 5509 transitions. [2025-01-08 23:42:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:21,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-01-08 23:42:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:21,307 INFO L225 Difference]: With dead ends: 4382 [2025-01-08 23:42:21,307 INFO L226 Difference]: Without dead ends: 2667 [2025-01-08 23:42:21,309 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:42:21,309 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 207 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:21,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:21,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2025-01-08 23:42:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2664. [2025-01-08 23:42:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2663 states have (on average 1.2350732256853174) internal successors, (3289), 2663 states have internal predecessors, (3289), 0 states have call successors, (0), 0 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:42:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3289 transitions. [2025-01-08 23:42:21,348 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3289 transitions. Word has length 155 [2025-01-08 23:42:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:21,349 INFO L471 AbstractCegarLoop]: Abstraction has 2664 states and 3289 transitions. [2025-01-08 23:42:21,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3289 transitions. [2025-01-08 23:42:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-08 23:42:21,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:21,352 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:42:21,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:42:21,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:21,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:21,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1049260655, now seen corresponding path program 1 times [2025-01-08 23:42:21,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:21,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919126208] [2025-01-08 23:42:21,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:21,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:21,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-08 23:42:21,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-08 23:42:21,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:21,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:42:21,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:21,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919126208] [2025-01-08 23:42:21,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919126208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:21,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:21,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:21,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063847592] [2025-01-08 23:42:21,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:21,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:21,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:21,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:21,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:21,548 INFO L87 Difference]: Start difference. First operand 2664 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:42:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:22,200 INFO L93 Difference]: Finished difference Result 6261 states and 7859 transitions. [2025-01-08 23:42:22,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:22,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 210 [2025-01-08 23:42:22,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:22,210 INFO L225 Difference]: With dead ends: 6261 [2025-01-08 23:42:22,210 INFO L226 Difference]: Without dead ends: 3783 [2025-01-08 23:42:22,213 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:42:22,214 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 169 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:22,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 391 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2025-01-08 23:42:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3585. [2025-01-08 23:42:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 3584 states have (on average 1.2131696428571428) internal successors, (4348), 3584 states have internal predecessors, (4348), 0 states have call successors, (0), 0 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:42:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 4348 transitions. [2025-01-08 23:42:22,262 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 4348 transitions. Word has length 210 [2025-01-08 23:42:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:22,262 INFO L471 AbstractCegarLoop]: Abstraction has 3585 states and 4348 transitions. [2025-01-08 23:42:22,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:42:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 4348 transitions. [2025-01-08 23:42:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-08 23:42:22,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:22,265 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:42:22,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:42:22,265 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:22,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1152065026, now seen corresponding path program 1 times [2025-01-08 23:42:22,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:22,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195717820] [2025-01-08 23:42:22,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:22,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:22,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-08 23:42:22,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-08 23:42:22,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:22,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 23:42:22,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195717820] [2025-01-08 23:42:22,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195717820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:22,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:22,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:22,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436066022] [2025-01-08 23:42:22,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:22,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:22,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:22,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:22,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:22,420 INFO L87 Difference]: Start difference. First operand 3585 states and 4348 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:42:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:23,046 INFO L93 Difference]: Finished difference Result 8825 states and 10868 transitions. [2025-01-08 23:42:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:23,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 216 [2025-01-08 23:42:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:23,059 INFO L225 Difference]: With dead ends: 8825 [2025-01-08 23:42:23,059 INFO L226 Difference]: Without dead ends: 5242 [2025-01-08 23:42:23,063 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:42:23,063 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 183 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:23,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 147 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2025-01-08 23:42:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 5242. [2025-01-08 23:42:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5242 states, 5241 states have (on average 1.2144628887616866) internal successors, (6365), 5241 states have internal predecessors, (6365), 0 states have call successors, (0), 0 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:42:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 6365 transitions. [2025-01-08 23:42:23,142 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 6365 transitions. Word has length 216 [2025-01-08 23:42:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:23,143 INFO L471 AbstractCegarLoop]: Abstraction has 5242 states and 6365 transitions. [2025-01-08 23:42:23,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:42:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 6365 transitions. [2025-01-08 23:42:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-08 23:42:23,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:23,146 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:42:23,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:42:23,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:23,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1737846034, now seen corresponding path program 1 times [2025-01-08 23:42:23,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:23,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878103358] [2025-01-08 23:42:23,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:23,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-08 23:42:23,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-08 23:42:23,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:23,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:23,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:23,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878103358] [2025-01-08 23:42:23,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878103358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:23,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:23,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751141231] [2025-01-08 23:42:23,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:23,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:42:23,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:23,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:42:23,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:42:23,623 INFO L87 Difference]: Start difference. First operand 5242 states and 6365 transitions. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:25,058 INFO L93 Difference]: Finished difference Result 16408 states and 20407 transitions. [2025-01-08 23:42:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:42:25,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2025-01-08 23:42:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:25,082 INFO L225 Difference]: With dead ends: 16408 [2025-01-08 23:42:25,082 INFO L226 Difference]: Without dead ends: 11168 [2025-01-08 23:42:25,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:42:25,087 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 395 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:25,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 84 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-08 23:42:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11168 states. [2025-01-08 23:42:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11168 to 10962. [2025-01-08 23:42:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10962 states, 10961 states have (on average 1.205546939147888) internal successors, (13214), 10961 states have internal predecessors, (13214), 0 states have call successors, (0), 0 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:42:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10962 states to 10962 states and 13214 transitions. [2025-01-08 23:42:25,215 INFO L78 Accepts]: Start accepts. Automaton has 10962 states and 13214 transitions. Word has length 247 [2025-01-08 23:42:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:25,217 INFO L471 AbstractCegarLoop]: Abstraction has 10962 states and 13214 transitions. [2025-01-08 23:42:25,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:25,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10962 states and 13214 transitions. [2025-01-08 23:42:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-01-08 23:42:25,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:25,224 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:25,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:42:25,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:25,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:25,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1076543877, now seen corresponding path program 1 times [2025-01-08 23:42:25,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:25,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072908152] [2025-01-08 23:42:25,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:25,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:25,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-08 23:42:25,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-08 23:42:25,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:25,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-01-08 23:42:25,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:25,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072908152] [2025-01-08 23:42:25,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072908152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:25,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:25,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:25,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402328239] [2025-01-08 23:42:25,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:25,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:25,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:25,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:25,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:25,389 INFO L87 Difference]: Start difference. First operand 10962 states and 13214 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:42:26,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:26,016 INFO L93 Difference]: Finished difference Result 24497 states and 29904 transitions. [2025-01-08 23:42:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:26,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 293 [2025-01-08 23:42:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:26,049 INFO L225 Difference]: With dead ends: 24497 [2025-01-08 23:42:26,050 INFO L226 Difference]: Without dead ends: 13905 [2025-01-08 23:42:26,060 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:42:26,060 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 195 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:26,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 152 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13905 states. [2025-01-08 23:42:26,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13905 to 10955. [2025-01-08 23:42:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10955 states, 10954 states have (on average 1.205952163593208) internal successors, (13210), 10954 states have internal predecessors, (13210), 0 states have call successors, (0), 0 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:42:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10955 states to 10955 states and 13210 transitions. [2025-01-08 23:42:26,282 INFO L78 Accepts]: Start accepts. Automaton has 10955 states and 13210 transitions. Word has length 293 [2025-01-08 23:42:26,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:26,282 INFO L471 AbstractCegarLoop]: Abstraction has 10955 states and 13210 transitions. [2025-01-08 23:42:26,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:42:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 10955 states and 13210 transitions. [2025-01-08 23:42:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-01-08 23:42:26,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:26,292 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:42:26,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:42:26,293 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:26,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:26,294 INFO L85 PathProgramCache]: Analyzing trace with hash -312031700, now seen corresponding path program 1 times [2025-01-08 23:42:26,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:26,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538288582] [2025-01-08 23:42:26,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:26,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-01-08 23:42:26,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-01-08 23:42:26,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:26,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:26,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:26,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538288582] [2025-01-08 23:42:26,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538288582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:26,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:26,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:26,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106790496] [2025-01-08 23:42:26,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:26,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:26,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:26,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:26,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:26,534 INFO L87 Difference]: Start difference. First operand 10955 states and 13210 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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:42:27,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:27,159 INFO L93 Difference]: Finished difference Result 22849 states and 27886 transitions. [2025-01-08 23:42:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:27,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 298 [2025-01-08 23:42:27,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:27,178 INFO L225 Difference]: With dead ends: 22849 [2025-01-08 23:42:27,178 INFO L226 Difference]: Without dead ends: 12264 [2025-01-08 23:42:27,186 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:42:27,187 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 61 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:27,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 334 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12264 states. [2025-01-08 23:42:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12264 to 11875. [2025-01-08 23:42:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11875 states, 11874 states have (on average 1.1910055583628094) internal successors, (14142), 11874 states have internal predecessors, (14142), 0 states have call successors, (0), 0 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:42:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11875 states to 11875 states and 14142 transitions. [2025-01-08 23:42:27,302 INFO L78 Accepts]: Start accepts. Automaton has 11875 states and 14142 transitions. Word has length 298 [2025-01-08 23:42:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:27,302 INFO L471 AbstractCegarLoop]: Abstraction has 11875 states and 14142 transitions. [2025-01-08 23:42:27,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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:42:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 11875 states and 14142 transitions. [2025-01-08 23:42:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-08 23:42:27,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:27,309 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:27,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:42:27,309 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:27,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:27,310 INFO L85 PathProgramCache]: Analyzing trace with hash -854041335, now seen corresponding path program 1 times [2025-01-08 23:42:27,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:27,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624052913] [2025-01-08 23:42:27,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:27,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:27,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-08 23:42:27,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-08 23:42:27,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:27,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-08 23:42:27,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:27,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624052913] [2025-01-08 23:42:27,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624052913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:27,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:27,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:27,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421910269] [2025-01-08 23:42:27,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:27,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:27,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:27,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:27,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:27,475 INFO L87 Difference]: Start difference. First operand 11875 states and 14142 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:42:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:28,032 INFO L93 Difference]: Finished difference Result 22056 states and 26170 transitions. [2025-01-08 23:42:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:28,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 312 [2025-01-08 23:42:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:28,052 INFO L225 Difference]: With dead ends: 22056 [2025-01-08 23:42:28,052 INFO L226 Difference]: Without dead ends: 10551 [2025-01-08 23:42:28,061 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:42:28,061 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 137 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:28,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 150 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10551 states. [2025-01-08 23:42:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10551 to 8342. [2025-01-08 23:42:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8342 states, 8341 states have (on average 1.1379930463973145) internal successors, (9492), 8341 states have internal predecessors, (9492), 0 states have call successors, (0), 0 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:42:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 9492 transitions. [2025-01-08 23:42:28,148 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 9492 transitions. Word has length 312 [2025-01-08 23:42:28,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:28,148 INFO L471 AbstractCegarLoop]: Abstraction has 8342 states and 9492 transitions. [2025-01-08 23:42:28,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:42:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 9492 transitions. [2025-01-08 23:42:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-01-08 23:42:28,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:28,158 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:28,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:42:28,159 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:28,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1309224575, now seen corresponding path program 1 times [2025-01-08 23:42:28,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:28,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734472059] [2025-01-08 23:42:28,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:28,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:28,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-01-08 23:42:28,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-01-08 23:42:28,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:28,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-01-08 23:42:28,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:28,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734472059] [2025-01-08 23:42:28,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734472059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:28,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:28,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:28,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510907256] [2025-01-08 23:42:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:28,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:28,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:28,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:28,412 INFO L87 Difference]: Start difference. First operand 8342 states and 9492 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:42:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:29,037 INFO L93 Difference]: Finished difference Result 19626 states and 22280 transitions. [2025-01-08 23:42:29,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:29,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 397 [2025-01-08 23:42:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:29,051 INFO L225 Difference]: With dead ends: 19626 [2025-01-08 23:42:29,051 INFO L226 Difference]: Without dead ends: 10727 [2025-01-08 23:42:29,058 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:42:29,059 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 121 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:29,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 313 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:29,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10727 states. [2025-01-08 23:42:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10727 to 9623. [2025-01-08 23:42:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9623 states, 9622 states have (on average 1.1262731240906256) internal successors, (10837), 9622 states have internal predecessors, (10837), 0 states have call successors, (0), 0 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:42:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9623 states to 9623 states and 10837 transitions. [2025-01-08 23:42:29,178 INFO L78 Accepts]: Start accepts. Automaton has 9623 states and 10837 transitions. Word has length 397 [2025-01-08 23:42:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:29,180 INFO L471 AbstractCegarLoop]: Abstraction has 9623 states and 10837 transitions. [2025-01-08 23:42:29,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:42:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 9623 states and 10837 transitions. [2025-01-08 23:42:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-01-08 23:42:29,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:29,193 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:29,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:42:29,194 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:29,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:29,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1599048687, now seen corresponding path program 1 times [2025-01-08 23:42:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:29,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448467747] [2025-01-08 23:42:29,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:29,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:29,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-01-08 23:42:29,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-01-08 23:42:29,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:29,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-08 23:42:29,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:29,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448467747] [2025-01-08 23:42:29,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448467747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:29,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:29,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:42:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673423091] [2025-01-08 23:42:29,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:29,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:42:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:29,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:42:29,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:42:29,974 INFO L87 Difference]: Start difference. First operand 9623 states and 10837 transitions. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 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:42:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:31,050 INFO L93 Difference]: Finished difference Result 22194 states and 24963 transitions. [2025-01-08 23:42:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 23:42:31,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 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 398 [2025-01-08 23:42:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:31,065 INFO L225 Difference]: With dead ends: 22194 [2025-01-08 23:42:31,065 INFO L226 Difference]: Without dead ends: 12941 [2025-01-08 23:42:31,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:42:31,073 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 274 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:31,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 210 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:42:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12941 states. [2025-01-08 23:42:31,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12941 to 12754. [2025-01-08 23:42:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12754 states, 12753 states have (on average 1.1220889202540578) internal successors, (14310), 12753 states have internal predecessors, (14310), 0 states have call successors, (0), 0 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:42:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12754 states to 12754 states and 14310 transitions. [2025-01-08 23:42:31,214 INFO L78 Accepts]: Start accepts. Automaton has 12754 states and 14310 transitions. Word has length 398 [2025-01-08 23:42:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:31,215 INFO L471 AbstractCegarLoop]: Abstraction has 12754 states and 14310 transitions. [2025-01-08 23:42:31,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 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:42:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 12754 states and 14310 transitions. [2025-01-08 23:42:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-01-08 23:42:31,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:31,225 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:31,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:42:31,225 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:31,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1688030058, now seen corresponding path program 1 times [2025-01-08 23:42:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:31,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801298607] [2025-01-08 23:42:31,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:31,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:31,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-08 23:42:31,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-08 23:42:31,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:31,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 357 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-08 23:42:32,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:32,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801298607] [2025-01-08 23:42:32,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801298607] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:32,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904395748] [2025-01-08 23:42:32,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:32,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:32,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:32,084 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:42:32,085 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:42:32,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-08 23:42:32,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-08 23:42:32,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:32,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:32,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 23:42:32,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 244 proven. 121 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-08 23:42:33,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:42:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 244 proven. 121 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-08 23:42:35,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904395748] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:42:35,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:42:35,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-01-08 23:42:35,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666009925] [2025-01-08 23:42:35,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:42:35,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 23:42:35,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:35,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 23:42:35,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-08 23:42:35,562 INFO L87 Difference]: Start difference. First operand 12754 states and 14310 transitions. Second operand has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 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:42:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:38,882 INFO L93 Difference]: Finished difference Result 32880 states and 36812 transitions. [2025-01-08 23:42:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-08 23:42:38,886 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 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:42:38,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:38,905 INFO L225 Difference]: With dead ends: 32880 [2025-01-08 23:42:38,905 INFO L226 Difference]: Without dead ends: 19760 [2025-01-08 23:42:38,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2025-01-08 23:42:38,911 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1462 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4479 mSolverCounterSat, 609 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 5088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 609 IncrementalHoareTripleChecker+Valid, 4479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:38,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 223 Invalid, 5088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [609 Valid, 4479 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:42:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19760 states. [2025-01-08 23:42:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19760 to 11650. [2025-01-08 23:42:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11650 states, 11649 states have (on average 1.097261567516525) internal successors, (12782), 11649 states have internal predecessors, (12782), 0 states have call successors, (0), 0 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:42:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11650 states to 11650 states and 12782 transitions. [2025-01-08 23:42:39,033 INFO L78 Accepts]: Start accepts. Automaton has 11650 states and 12782 transitions. Word has length 408 [2025-01-08 23:42:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:39,034 INFO L471 AbstractCegarLoop]: Abstraction has 11650 states and 12782 transitions. [2025-01-08 23:42:39,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 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:42:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 11650 states and 12782 transitions. [2025-01-08 23:42:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-08 23:42:39,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:39,043 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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:42:39,050 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:42:39,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-08 23:42:39,247 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:39,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2126961618, now seen corresponding path program 1 times [2025-01-08 23:42:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:39,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220935351] [2025-01-08 23:42:39,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:39,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-08 23:42:39,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-08 23:42:39,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:39,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:39,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:39,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220935351] [2025-01-08 23:42:39,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220935351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:39,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:39,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:39,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234553599] [2025-01-08 23:42:39,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:39,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:39,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:39,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:39,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:39,513 INFO L87 Difference]: Start difference. First operand 11650 states and 12782 transitions. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 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:42:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:40,311 INFO L93 Difference]: Finished difference Result 25330 states and 27795 transitions. [2025-01-08 23:42:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:40,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 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 430 [2025-01-08 23:42:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:40,323 INFO L225 Difference]: With dead ends: 25330 [2025-01-08 23:42:40,323 INFO L226 Difference]: Without dead ends: 14050 [2025-01-08 23:42:40,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:40,330 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 180 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:40,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 63 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:42:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14050 states. [2025-01-08 23:42:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14050 to 12386. [2025-01-08 23:42:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12386 states, 12385 states have (on average 1.09245054501413) internal successors, (13530), 12385 states have internal predecessors, (13530), 0 states have call successors, (0), 0 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:42:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 13530 transitions. [2025-01-08 23:42:40,426 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 13530 transitions. Word has length 430 [2025-01-08 23:42:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:40,426 INFO L471 AbstractCegarLoop]: Abstraction has 12386 states and 13530 transitions. [2025-01-08 23:42:40,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 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:42:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 13530 transitions. [2025-01-08 23:42:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-01-08 23:42:40,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:40,435 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:42:40,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:42:40,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:40,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash 764975806, now seen corresponding path program 1 times [2025-01-08 23:42:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961201123] [2025-01-08 23:42:40,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:40,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-01-08 23:42:40,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-01-08 23:42:40,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:40,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-01-08 23:42:40,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:40,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961201123] [2025-01-08 23:42:40,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961201123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:40,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:40,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520743755] [2025-01-08 23:42:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:40,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:40,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:40,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:40,650 INFO L87 Difference]: Start difference. First operand 12386 states and 13530 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:41,254 INFO L93 Difference]: Finished difference Result 26426 states and 28854 transitions. [2025-01-08 23:42:41,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:41,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 445 [2025-01-08 23:42:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:41,264 INFO L225 Difference]: With dead ends: 26426 [2025-01-08 23:42:41,265 INFO L226 Difference]: Without dead ends: 12568 [2025-01-08 23:42:41,271 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:42:41,272 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 117 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:41,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 294 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:41,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12568 states. [2025-01-08 23:42:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12568 to 10911. [2025-01-08 23:42:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10911 states, 10910 states have (on average 1.0778185151237396) internal successors, (11759), 10910 states have internal predecessors, (11759), 0 states have call successors, (0), 0 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:42:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10911 states to 10911 states and 11759 transitions. [2025-01-08 23:42:41,362 INFO L78 Accepts]: Start accepts. Automaton has 10911 states and 11759 transitions. Word has length 445 [2025-01-08 23:42:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:41,362 INFO L471 AbstractCegarLoop]: Abstraction has 10911 states and 11759 transitions. [2025-01-08 23:42:41,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 10911 states and 11759 transitions. [2025-01-08 23:42:41,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-08 23:42:41,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:41,371 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 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] [2025-01-08 23:42:41,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:42:41,371 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:41,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:41,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2132610443, now seen corresponding path program 1 times [2025-01-08 23:42:41,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:41,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401116292] [2025-01-08 23:42:41,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:41,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:41,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-08 23:42:41,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-08 23:42:41,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:41,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-01-08 23:42:41,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:41,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401116292] [2025-01-08 23:42:41,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401116292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:41,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:41,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:41,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435728638] [2025-01-08 23:42:41,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:41,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:41,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:41,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:41,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:41,514 INFO L87 Difference]: Start difference. First operand 10911 states and 11759 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:42:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:41,929 INFO L93 Difference]: Finished difference Result 22555 states and 24296 transitions. [2025-01-08 23:42:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 483 [2025-01-08 23:42:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:41,940 INFO L225 Difference]: With dead ends: 22555 [2025-01-08 23:42:41,941 INFO L226 Difference]: Without dead ends: 12014 [2025-01-08 23:42:41,952 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:42:41,953 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 68 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:41,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 307 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12014 states. [2025-01-08 23:42:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12014 to 11830. [2025-01-08 23:42:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11830 states, 11829 states have (on average 1.0695747738608505) internal successors, (12652), 11829 states have internal predecessors, (12652), 0 states have call successors, (0), 0 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:42:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11830 states to 11830 states and 12652 transitions. [2025-01-08 23:42:42,050 INFO L78 Accepts]: Start accepts. Automaton has 11830 states and 12652 transitions. Word has length 483 [2025-01-08 23:42:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:42,050 INFO L471 AbstractCegarLoop]: Abstraction has 11830 states and 12652 transitions. [2025-01-08 23:42:42,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:42:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 11830 states and 12652 transitions. [2025-01-08 23:42:42,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-08 23:42:42,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:42,059 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-08 23:42:42,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:42:42,059 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:42,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash 163964554, now seen corresponding path program 1 times [2025-01-08 23:42:42,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:42,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398371811] [2025-01-08 23:42:42,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:42,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:42,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-08 23:42:42,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-08 23:42:42,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:42,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 578 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-08 23:42:42,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:42,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398371811] [2025-01-08 23:42:42,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398371811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:42,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:42,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:42,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046578786] [2025-01-08 23:42:42,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:42,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:42,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:42,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:42,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:42,410 INFO L87 Difference]: Start difference. First operand 11830 states and 12652 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:42:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:43,126 INFO L93 Difference]: Finished difference Result 24032 states and 25730 transitions. [2025-01-08 23:42:43,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:43,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 483 [2025-01-08 23:42:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:43,138 INFO L225 Difference]: With dead ends: 24032 [2025-01-08 23:42:43,138 INFO L226 Difference]: Without dead ends: 12572 [2025-01-08 23:42:43,145 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:42:43,146 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 192 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:43,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 100 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12572 states. [2025-01-08 23:42:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12572 to 12016. [2025-01-08 23:42:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12016 states, 12015 states have (on average 1.0689138576779027) internal successors, (12843), 12015 states have internal predecessors, (12843), 0 states have call successors, (0), 0 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:42:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12016 states to 12016 states and 12843 transitions. [2025-01-08 23:42:43,291 INFO L78 Accepts]: Start accepts. Automaton has 12016 states and 12843 transitions. Word has length 483 [2025-01-08 23:42:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:43,291 INFO L471 AbstractCegarLoop]: Abstraction has 12016 states and 12843 transitions. [2025-01-08 23:42:43,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:42:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 12016 states and 12843 transitions. [2025-01-08 23:42:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-01-08 23:42:43,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:43,300 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-08 23:42:43,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:42:43,301 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:43,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:43,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1529879953, now seen corresponding path program 1 times [2025-01-08 23:42:43,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:43,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080397859] [2025-01-08 23:42:43,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:43,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:43,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-01-08 23:42:43,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-01-08 23:42:43,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:43,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-08 23:42:43,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:43,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080397859] [2025-01-08 23:42:43,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080397859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:43,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:43,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:43,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747007289] [2025-01-08 23:42:43,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:43,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:43,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:43,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:43,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:43,585 INFO L87 Difference]: Start difference. First operand 12016 states and 12843 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:42:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:44,060 INFO L93 Difference]: Finished difference Result 24033 states and 25696 transitions. [2025-01-08 23:42:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:44,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 488 [2025-01-08 23:42:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:44,070 INFO L225 Difference]: With dead ends: 24033 [2025-01-08 23:42:44,070 INFO L226 Difference]: Without dead ends: 12203 [2025-01-08 23:42:44,077 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:42:44,077 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 66 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:44,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 323 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12203 states. [2025-01-08 23:42:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12203 to 12015. [2025-01-08 23:42:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12015 states, 12014 states have (on average 1.057516231063759) internal successors, (12705), 12014 states have internal predecessors, (12705), 0 states have call successors, (0), 0 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:42:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 12705 transitions. [2025-01-08 23:42:44,164 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 12705 transitions. Word has length 488 [2025-01-08 23:42:44,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:44,164 INFO L471 AbstractCegarLoop]: Abstraction has 12015 states and 12705 transitions. [2025-01-08 23:42:44,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:42:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 12705 transitions. [2025-01-08 23:42:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-01-08 23:42:44,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:44,170 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-08 23:42:44,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 23:42:44,171 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:44,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:44,171 INFO L85 PathProgramCache]: Analyzing trace with hash -587816149, now seen corresponding path program 1 times [2025-01-08 23:42:44,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:44,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017918911] [2025-01-08 23:42:44,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:44,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:44,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-01-08 23:42:44,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-01-08 23:42:44,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:44,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-01-08 23:42:44,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:44,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017918911] [2025-01-08 23:42:44,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017918911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:44,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:44,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:44,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064533968] [2025-01-08 23:42:44,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:44,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:44,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:44,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:44,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:44,401 INFO L87 Difference]: Start difference. First operand 12015 states and 12705 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:42:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:44,986 INFO L93 Difference]: Finished difference Result 29007 states and 30670 transitions. [2025-01-08 23:42:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:44,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 497 [2025-01-08 23:42:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:45,002 INFO L225 Difference]: With dead ends: 29007 [2025-01-08 23:42:45,002 INFO L226 Difference]: Without dead ends: 17362 [2025-01-08 23:42:45,010 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:42:45,011 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 179 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:45,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 70 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:45,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17362 states. [2025-01-08 23:42:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17362 to 16253. [2025-01-08 23:42:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16253 states, 16252 states have (on average 1.0558700467634752) internal successors, (17160), 16252 states have internal predecessors, (17160), 0 states have call successors, (0), 0 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:42:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16253 states to 16253 states and 17160 transitions. [2025-01-08 23:42:45,132 INFO L78 Accepts]: Start accepts. Automaton has 16253 states and 17160 transitions. Word has length 497 [2025-01-08 23:42:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:45,132 INFO L471 AbstractCegarLoop]: Abstraction has 16253 states and 17160 transitions. [2025-01-08 23:42:45,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:42:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 16253 states and 17160 transitions. [2025-01-08 23:42:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2025-01-08 23:42:45,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:45,141 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:45,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 23:42:45,141 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:45,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:45,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1490925103, now seen corresponding path program 1 times [2025-01-08 23:42:45,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:45,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657229851] [2025-01-08 23:42:45,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:45,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 564 statements into 1 equivalence classes. [2025-01-08 23:42:45,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 564 of 564 statements. [2025-01-08 23:42:45,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:45,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-01-08 23:42:45,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:45,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657229851] [2025-01-08 23:42:45,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657229851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:45,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:45,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703442893] [2025-01-08 23:42:45,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:45,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:45,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:45,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:45,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:45,310 INFO L87 Difference]: Start difference. First operand 16253 states and 17160 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:42:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:45,727 INFO L93 Difference]: Finished difference Result 30477 states and 32201 transitions. [2025-01-08 23:42:45,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:45,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 564 [2025-01-08 23:42:45,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:45,740 INFO L225 Difference]: With dead ends: 30477 [2025-01-08 23:42:45,740 INFO L226 Difference]: Without dead ends: 16068 [2025-01-08 23:42:45,747 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:42:45,748 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 192 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:45,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 325 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16068 states. [2025-01-08 23:42:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16068 to 16068. [2025-01-08 23:42:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16068 states, 16067 states have (on average 1.0548951266571234) internal successors, (16949), 16067 states have internal predecessors, (16949), 0 states have call successors, (0), 0 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:42:45,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16068 states to 16068 states and 16949 transitions. [2025-01-08 23:42:45,870 INFO L78 Accepts]: Start accepts. Automaton has 16068 states and 16949 transitions. Word has length 564 [2025-01-08 23:42:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:45,870 INFO L471 AbstractCegarLoop]: Abstraction has 16068 states and 16949 transitions. [2025-01-08 23:42:45,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:42:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 16068 states and 16949 transitions. [2025-01-08 23:42:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-01-08 23:42:45,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:45,879 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:45,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 23:42:45,880 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:45,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash -911388315, now seen corresponding path program 1 times [2025-01-08 23:42:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:45,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628459821] [2025-01-08 23:42:45,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:45,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:45,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-01-08 23:42:45,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-01-08 23:42:45,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:45,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-01-08 23:42:46,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:46,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628459821] [2025-01-08 23:42:46,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628459821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:46,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:46,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647628509] [2025-01-08 23:42:46,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:46,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:46,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:46,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:46,117 INFO L87 Difference]: Start difference. First operand 16068 states and 16949 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:42:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:46,575 INFO L93 Difference]: Finished difference Result 32499 states and 34314 transitions. [2025-01-08 23:42:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:46,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 590 [2025-01-08 23:42:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:46,596 INFO L225 Difference]: With dead ends: 32499 [2025-01-08 23:42:46,597 INFO L226 Difference]: Without dead ends: 18275 [2025-01-08 23:42:46,606 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:42:46,607 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 143 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:46,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 61 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18275 states. [2025-01-08 23:42:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18275 to 16616. [2025-01-08 23:42:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16616 states, 16615 states have (on average 1.052181763466747) internal successors, (17482), 16615 states have internal predecessors, (17482), 0 states have call successors, (0), 0 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:42:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16616 states to 16616 states and 17482 transitions. [2025-01-08 23:42:46,777 INFO L78 Accepts]: Start accepts. Automaton has 16616 states and 17482 transitions. Word has length 590 [2025-01-08 23:42:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:46,778 INFO L471 AbstractCegarLoop]: Abstraction has 16616 states and 17482 transitions. [2025-01-08 23:42:46,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:42:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 16616 states and 17482 transitions. [2025-01-08 23:42:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-08 23:42:46,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:46,787 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:46,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 23:42:46,787 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:46,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:46,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2073786975, now seen corresponding path program 1 times [2025-01-08 23:42:46,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:46,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106169266] [2025-01-08 23:42:46,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:46,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:46,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-08 23:42:46,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-08 23:42:46,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:46,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 776 proven. 34 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-01-08 23:42:47,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:47,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106169266] [2025-01-08 23:42:47,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106169266] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:47,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097729921] [2025-01-08 23:42:47,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:47,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:47,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:47,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:42:47,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:42:47,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-08 23:42:47,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-08 23:42:47,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:47,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:47,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:42:47,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:47,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 810 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-01-08 23:42:47,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:42:47,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097729921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:47,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:42:47,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:42:47,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120822853] [2025-01-08 23:42:47,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:47,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:47,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:47,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:47,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:42:47,662 INFO L87 Difference]: Start difference. First operand 16616 states and 17482 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:42:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:48,104 INFO L93 Difference]: Finished difference Result 34344 states and 36172 transitions. [2025-01-08 23:42:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:48,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 594 [2025-01-08 23:42:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:48,121 INFO L225 Difference]: With dead ends: 34344 [2025-01-08 23:42:48,121 INFO L226 Difference]: Without dead ends: 19572 [2025-01-08 23:42:48,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:42:48,131 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:48,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 63 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19572 states. [2025-01-08 23:42:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19572 to 17168. [2025-01-08 23:42:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17168 states, 17167 states have (on average 1.0517271509291082) internal successors, (18055), 17167 states have internal predecessors, (18055), 0 states have call successors, (0), 0 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:42:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17168 states to 17168 states and 18055 transitions. [2025-01-08 23:42:48,279 INFO L78 Accepts]: Start accepts. Automaton has 17168 states and 18055 transitions. Word has length 594 [2025-01-08 23:42:48,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:48,279 INFO L471 AbstractCegarLoop]: Abstraction has 17168 states and 18055 transitions. [2025-01-08 23:42:48,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:42:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 17168 states and 18055 transitions. [2025-01-08 23:42:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-01-08 23:42:48,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:48,289 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-01-08 23:42:48,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:42:48,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:48,490 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:48,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash -993226335, now seen corresponding path program 1 times [2025-01-08 23:42:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:48,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465627198] [2025-01-08 23:42:48,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:48,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:48,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-01-08 23:42:48,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-01-08 23:42:48,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:48,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 889 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-01-08 23:42:48,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:48,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465627198] [2025-01-08 23:42:48,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465627198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:48,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:48,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:48,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477522331] [2025-01-08 23:42:48,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:48,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:48,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:48,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:48,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:48,845 INFO L87 Difference]: Start difference. First operand 17168 states and 18055 transitions. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 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:42:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:49,482 INFO L93 Difference]: Finished difference Result 34896 states and 36732 transitions. [2025-01-08 23:42:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:49,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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 595 [2025-01-08 23:42:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:49,499 INFO L225 Difference]: With dead ends: 34896 [2025-01-08 23:42:49,499 INFO L226 Difference]: Without dead ends: 19204 [2025-01-08 23:42:49,509 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:42:49,510 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 181 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:49,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 71 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19204 states. [2025-01-08 23:42:49,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19204 to 16250. [2025-01-08 23:42:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16250 states, 16249 states have (on average 1.0510800664656286) internal successors, (17079), 16249 states have internal predecessors, (17079), 0 states have call successors, (0), 0 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:42:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16250 states to 16250 states and 17079 transitions. [2025-01-08 23:42:49,636 INFO L78 Accepts]: Start accepts. Automaton has 16250 states and 17079 transitions. Word has length 595 [2025-01-08 23:42:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:49,637 INFO L471 AbstractCegarLoop]: Abstraction has 16250 states and 17079 transitions. [2025-01-08 23:42:49,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 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:42:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 16250 states and 17079 transitions. [2025-01-08 23:42:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-01-08 23:42:49,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:49,645 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:49,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-08 23:42:49,645 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:49,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash 693026854, now seen corresponding path program 1 times [2025-01-08 23:42:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:49,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263717119] [2025-01-08 23:42:49,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:49,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:49,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-01-08 23:42:49,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-01-08 23:42:49,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:49,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 1064 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-01-08 23:42:50,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:50,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263717119] [2025-01-08 23:42:50,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263717119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:50,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:50,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:50,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878535222] [2025-01-08 23:42:50,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:50,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:50,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:50,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:50,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:50,063 INFO L87 Difference]: Start difference. First operand 16250 states and 17079 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 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:42:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:50,714 INFO L93 Difference]: Finished difference Result 33977 states and 35796 transitions. [2025-01-08 23:42:50,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:50,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 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 601 [2025-01-08 23:42:50,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:50,731 INFO L225 Difference]: With dead ends: 33977 [2025-01-08 23:42:50,731 INFO L226 Difference]: Without dead ends: 17915 [2025-01-08 23:42:50,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:50,741 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 186 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:50,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 73 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17915 states. [2025-01-08 23:42:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17915 to 17910. [2025-01-08 23:42:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17910 states, 17909 states have (on average 1.0521525489977106) internal successors, (18843), 17909 states have internal predecessors, (18843), 0 states have call successors, (0), 0 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:42:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17910 states to 17910 states and 18843 transitions. [2025-01-08 23:42:50,872 INFO L78 Accepts]: Start accepts. Automaton has 17910 states and 18843 transitions. Word has length 601 [2025-01-08 23:42:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:50,873 INFO L471 AbstractCegarLoop]: Abstraction has 17910 states and 18843 transitions. [2025-01-08 23:42:50,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 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:42:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 17910 states and 18843 transitions. [2025-01-08 23:42:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-08 23:42:50,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:50,880 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:50,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-08 23:42:50,880 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:50,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:50,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1708629832, now seen corresponding path program 1 times [2025-01-08 23:42:50,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:50,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672511983] [2025-01-08 23:42:50,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:50,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:50,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-08 23:42:50,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-08 23:42:50,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:50,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2025-01-08 23:42:51,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:51,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672511983] [2025-01-08 23:42:51,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672511983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:51,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:51,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:51,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916912075] [2025-01-08 23:42:51,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:51,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:51,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:51,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:51,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:51,273 INFO L87 Difference]: Start difference. First operand 17910 states and 18843 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 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:42:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:51,619 INFO L93 Difference]: Finished difference Result 18097 states and 19041 transitions. [2025-01-08 23:42:51,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:51,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 608 [2025-01-08 23:42:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:51,620 INFO L225 Difference]: With dead ends: 18097 [2025-01-08 23:42:51,620 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:42:51,626 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:42:51,626 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 162 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:51,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 322 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:42:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:42:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:42:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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:42:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:42:51,627 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 608 [2025-01-08 23:42:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:51,627 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:42:51,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 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:42:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:42:51,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:42:51,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:42:51,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-08 23:42:51,632 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:51,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:42:59,127 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:42:59,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:42:59 BoogieIcfgContainer [2025-01-08 23:42:59,147 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:42:59,147 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:42:59,147 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:42:59,147 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:42:59,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:16" (3/4) ... [2025-01-08 23:42:59,153 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:42:59,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:42:59,171 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:42:59,172 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:42:59,173 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:42:59,347 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:42:59,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:42:59,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:42:59,351 INFO L158 Benchmark]: Toolchain (without parser) took 44458.52ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 104.2MB in the beginning and 177.3MB in the end (delta: -73.1MB). Peak memory consumption was 688.3MB. Max. memory is 16.1GB. [2025-01-08 23:42:59,351 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:42:59,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.26ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 61.1MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 23:42:59,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.79ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 44.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:42:59,352 INFO L158 Benchmark]: Boogie Preprocessor took 151.83ms. Allocated memory is still 142.6MB. Free memory was 44.2MB in the beginning and 81.0MB in the end (delta: -36.8MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2025-01-08 23:42:59,352 INFO L158 Benchmark]: RCFGBuilder took 1307.28ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 35.3MB in the end (delta: 45.8MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2025-01-08 23:42:59,352 INFO L158 Benchmark]: TraceAbstraction took 42258.98ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 35.3MB in the beginning and 778.9MB in the end (delta: -743.6MB). Peak memory consumption was 883.9MB. Max. memory is 16.1GB. [2025-01-08 23:42:59,352 INFO L158 Benchmark]: Witness Printer took 201.27ms. Allocated memory was 1.5GB in the beginning and 251.7MB in the end (delta: -1.2GB). Free memory was 778.9MB in the beginning and 177.3MB in the end (delta: 601.6MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2025-01-08 23:42:59,353 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.26ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 61.1MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.79ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 44.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 151.83ms. Allocated memory is still 142.6MB. Free memory was 44.2MB in the beginning and 81.0MB in the end (delta: -36.8MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1307.28ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 35.3MB in the end (delta: 45.8MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * TraceAbstraction took 42258.98ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 35.3MB in the beginning and 778.9MB in the end (delta: -743.6MB). Peak memory consumption was 883.9MB. Max. memory is 16.1GB. * Witness Printer took 201.27ms. Allocated memory was 1.5GB in the beginning and 251.7MB in the end (delta: -1.2GB). Free memory was 778.9MB in the beginning and 177.3MB in the end (delta: 601.6MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 100]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.7s, OverallIterations: 26, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5516 SdHoareTripleChecker+Valid, 17.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5516 mSDsluCounter, 5066 SdHoareTripleChecker+Invalid, 14.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 847 mSDsCounter, 2989 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22375 IncrementalHoareTripleChecker+Invalid, 25364 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2989 mSolverCounterUnsat, 4219 mSDtfsCounter, 22375 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1514 GetRequests, 1447 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17910occurred in iteration=25, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 27752 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 10676 NumberOfCodeBlocks, 10676 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 11055 ConstructedInterpolants, 0 QuantifiedInterpolants, 40451 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1330 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 29 InterpolantComputations, 25 PerfectInterpolantSequences, 14407/14691 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((a4 == 0) && (a29 <= 274)) && (a23 <= 138)) && (0 <= ((long long) a23 + 42))) || ((((a25 == 11) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || (((((((long long) a23 + 43) <= 0) && (261 <= a29)) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998))) || (((140 < a29) || (a25 != 9)) && ((((a25 <= 10) && (a4 == 1)) && (130 <= a29)) || ((((a29 <= 245) && (a23 <= 138)) && (a4 == 1)) && (130 <= a29))))) || ((((a25 == 13) && (307 <= a23)) && (a29 <= 599998)) && (a4 == 1))) || ((a4 == 1) && (a25 == 10))) || ((((a25 == 13) && (a29 <= 245)) && (a4 == 1)) && (130 <= a29))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (0 <= ((long long) a29 + 28553))) && (a25 == 10))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a25 <= 10))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 274)) && (130 <= a29))) || (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a29 <= 274)) && (130 <= a29))) || (((((261 <= a29) && (a4 == 0)) && (a25 == 11)) && (a29 <= 599998)) && (((long long) 119992 + a23) <= 0))) || (((a25 == 11) && (a4 == 1)) && (130 <= a29))) || ((((a25 == 13) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || ((((a25 <= 10) && (a4 == 1)) && (0 <= ((long long) a23 + 42))) && (130 <= a29))) || (((((a25 == 13) && (a23 <= 278)) && (99912 <= a29)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (((long long) a29 + 22) <= 0))) || ((((a4 == 0) && (a25 == 11)) && (a29 <= 245)) && (((long long) 119992 + a23) <= 0))) || ((((a25 <= 10) && (a23 <= 138)) && (a4 == 1)) && (a29 <= 130))) || (((((a25 != 13) || (a23 < 307)) && (((a23 < 307) || (a25 != 12)) || (a29 < 278))) && (a4 == 1)) && (99915 <= a29))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 11)) && (((long long) a29 + 22) <= 0))) || (((((a23 < 307) || (a25 != 12)) || (a29 < 278)) && ((((a4 == 0) && (a25 <= 10)) && (99915 <= a29)) || (((a25 == 12) && (261 <= a29)) && (a4 == 0)))) && (a29 <= 599998))) || (((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a4 == 1))) || (((a25 == 12) && (a4 == 0)) && (((long long) a29 + 22) <= 0))) || ((((a23 <= 278) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || (((a23 <= 278) && (a25 == 12)) && (a4 == 1))) || ((((a25 == 12) && (((a23 < 307) || (a25 != 12)) || (a29 < 278))) && (a4 == 1)) && (130 <= a29))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:42:59,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE