./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label05.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/Problem16_label05.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 0645d92d946523ae7f73519b10a8044529081b14933ba5ba70a68277fba7b19b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:05:25,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:05:25,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:05:25,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:05:25,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:05:25,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:05:25,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:05:25,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:05:25,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:05:25,143 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:05:25,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:05:25,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:05:25,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:05:25,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:05:25,144 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:05:25,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:05:25,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:05:25,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:05:25,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:05:25,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:05:25,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:05:25,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:05:25,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:05:25,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:05:25,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:05:25,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:05:25,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:05:25,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:05:25,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:05:25,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:05:25,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:05:25,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:05:25,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:05:25,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:05:25,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:05:25,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:05:25,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:05:25,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:05:25,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:05:25,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:05:25,147 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:05:25,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:05:25,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:05:25,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:05:25,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:05:25,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:05:25,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:05:25,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:05:25,148 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 -> 0645d92d946523ae7f73519b10a8044529081b14933ba5ba70a68277fba7b19b [2025-01-09 00:05:25,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:05:25,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:05:25,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:05:25,425 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:05:25,425 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:05:25,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label05.c [2025-01-09 00:05:26,703 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9ff2542f/fd2c1d106dfd4e9e8bff28ede09c06e1/FLAG40cf659d3 [2025-01-09 00:05:27,033 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:05:27,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label05.c [2025-01-09 00:05:27,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9ff2542f/fd2c1d106dfd4e9e8bff28ede09c06e1/FLAG40cf659d3 [2025-01-09 00:05:27,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9ff2542f/fd2c1d106dfd4e9e8bff28ede09c06e1 [2025-01-09 00:05:27,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:05:27,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:05:27,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:05:27,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:05:27,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:05:27,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b4a522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27, skipping insertion in model container [2025-01-09 00:05:27,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:05:27,234 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/Problem16_label05.c[2198,2211] [2025-01-09 00:05:27,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:05:27,443 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:05:27,452 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/Problem16_label05.c[2198,2211] [2025-01-09 00:05:27,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:05:27,569 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:05:27,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27 WrapperNode [2025-01-09 00:05:27,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:05:27,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:05:27,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:05:27,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:05:27,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,697 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-01-09 00:05:27,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:05:27,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:05:27,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:05:27,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:05:27,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,799 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-09 00:05:27,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:05:27,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:05:27,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:05:27,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:05:27,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (1/1) ... [2025-01-09 00:05:27,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:05:27,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:05:27,942 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-09 00:05:27,944 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-09 00:05:27,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:05:27,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:05:27,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:05:27,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:05:28,015 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:05:28,016 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:05:29,612 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-01-09 00:05:29,612 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:05:29,640 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:05:29,640 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:05:29,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:05:29 BoogieIcfgContainer [2025-01-09 00:05:29,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:05:29,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:05:29,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:05:29,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:05:29,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:05:27" (1/3) ... [2025-01-09 00:05:29,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e23f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:05:29, skipping insertion in model container [2025-01-09 00:05:29,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:27" (2/3) ... [2025-01-09 00:05:29,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e23f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:05:29, skipping insertion in model container [2025-01-09 00:05:29,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:05:29" (3/3) ... [2025-01-09 00:05:29,652 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label05.c [2025-01-09 00:05:29,663 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:05:29,665 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label05.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:05:29,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:05:29,731 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;@15168a34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:05:29,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:05:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 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-09 00:05:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 00:05:29,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:29,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:29,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:29,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2004448828, now seen corresponding path program 1 times [2025-01-09 00:05:29,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:29,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798397849] [2025-01-09 00:05:29,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:29,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 00:05:29,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 00:05:29,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:29,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:29,957 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-09 00:05:29,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798397849] [2025-01-09 00:05:29,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798397849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:29,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:29,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:05:29,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137510414] [2025-01-09 00:05:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:29,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:29,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:29,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:29,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:29,982 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-09 00:05:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:31,417 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-01-09 00:05:31,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:31,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-01-09 00:05:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:31,427 INFO L225 Difference]: With dead ends: 1122 [2025-01-09 00:05:31,427 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 00:05:31,430 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-09 00:05:31,433 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 368 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:31,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:05:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 00:05:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-01-09 00:05:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 0 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-09 00:05:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2025-01-09 00:05:31,485 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 19 [2025-01-09 00:05:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:31,486 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2025-01-09 00:05:31,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-09 00:05:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2025-01-09 00:05:31,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 00:05:31,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:31,489 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:05:31,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:05:31,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:31,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:31,490 INFO L85 PathProgramCache]: Analyzing trace with hash -433402623, now seen corresponding path program 1 times [2025-01-09 00:05:31,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:31,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611134199] [2025-01-09 00:05:31,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:31,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:31,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 00:05:31,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 00:05:31,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:31,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:31,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:31,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611134199] [2025-01-09 00:05:31,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611134199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:31,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:31,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:31,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509864717] [2025-01-09 00:05:31,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:31,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:05:31,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:31,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:05:31,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:05:31,827 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-09 00:05:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:33,344 INFO L93 Difference]: Finished difference Result 2309 states and 3414 transitions. [2025-01-09 00:05:33,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:05:33,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-01-09 00:05:33,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:33,350 INFO L225 Difference]: With dead ends: 2309 [2025-01-09 00:05:33,350 INFO L226 Difference]: Without dead ends: 1649 [2025-01-09 00:05:33,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:05:33,352 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1008 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:33,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:05:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-01-09 00:05:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-01-09 00:05:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4016990291262137) internal successors, (2310), 1648 states have internal predecessors, (2310), 0 states have call successors, (0), 0 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-09 00:05:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2310 transitions. [2025-01-09 00:05:33,403 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2310 transitions. Word has length 87 [2025-01-09 00:05:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:33,403 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2310 transitions. [2025-01-09 00:05:33,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-09 00:05:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2310 transitions. [2025-01-09 00:05:33,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 00:05:33,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:33,406 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:33,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:05:33,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:33,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1878201889, now seen corresponding path program 1 times [2025-01-09 00:05:33,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:33,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12630882] [2025-01-09 00:05:33,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:33,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 00:05:33,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 00:05:33,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:33,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:33,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:33,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12630882] [2025-01-09 00:05:33,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12630882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:33,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:33,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:05:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035968283] [2025-01-09 00:05:33,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:33,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:33,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:33,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:33,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:33,565 INFO L87 Difference]: Start difference. First operand 1649 states and 2310 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-09 00:05:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:34,568 INFO L93 Difference]: Finished difference Result 3625 states and 5242 transitions. [2025-01-09 00:05:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:34,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-01-09 00:05:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:34,576 INFO L225 Difference]: With dead ends: 3625 [2025-01-09 00:05:34,576 INFO L226 Difference]: Without dead ends: 2307 [2025-01-09 00:05:34,577 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-09 00:05:34,577 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:34,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:05:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-01-09 00:05:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-01-09 00:05:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.349956634865568) internal successors, (3113), 2306 states have internal predecessors, (3113), 0 states have call successors, (0), 0 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-09 00:05:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3113 transitions. [2025-01-09 00:05:34,606 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3113 transitions. Word has length 150 [2025-01-09 00:05:34,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:34,606 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3113 transitions. [2025-01-09 00:05:34,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-09 00:05:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3113 transitions. [2025-01-09 00:05:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 00:05:34,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:34,608 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:34,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:05:34,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:34,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash -867383736, now seen corresponding path program 1 times [2025-01-09 00:05:34,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:34,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550429353] [2025-01-09 00:05:34,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:34,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:34,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 00:05:34,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 00:05:34,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:34,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 00:05:34,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:34,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550429353] [2025-01-09 00:05:34,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550429353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:34,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:34,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:05:34,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895519344] [2025-01-09 00:05:34,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:34,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:34,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:34,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:34,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:34,794 INFO L87 Difference]: Start difference. First operand 2307 states and 3113 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-09 00:05:35,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:35,724 INFO L93 Difference]: Finished difference Result 5599 states and 7699 transitions. [2025-01-09 00:05:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:35,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 185 [2025-01-09 00:05:35,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:35,735 INFO L225 Difference]: With dead ends: 5599 [2025-01-09 00:05:35,736 INFO L226 Difference]: Without dead ends: 3623 [2025-01-09 00:05:35,739 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-09 00:05:35,740 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:35,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:05:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-01-09 00:05:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2965. [2025-01-09 00:05:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.2442645074224021) internal successors, (3688), 2964 states have internal predecessors, (3688), 0 states have call successors, (0), 0 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-09 00:05:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3688 transitions. [2025-01-09 00:05:35,783 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3688 transitions. Word has length 185 [2025-01-09 00:05:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:35,783 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 3688 transitions. [2025-01-09 00:05:35,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-09 00:05:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3688 transitions. [2025-01-09 00:05:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 00:05:35,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:35,787 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:35,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:05:35,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:35,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:35,788 INFO L85 PathProgramCache]: Analyzing trace with hash 701567870, now seen corresponding path program 1 times [2025-01-09 00:05:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:35,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454454773] [2025-01-09 00:05:35,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:35,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 00:05:35,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 00:05:35,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:35,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:35,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:35,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454454773] [2025-01-09 00:05:35,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454454773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:35,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:35,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:35,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019510390] [2025-01-09 00:05:35,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:35,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:35,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:35,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:35,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:35,934 INFO L87 Difference]: Start difference. First operand 2965 states and 3688 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:36,875 INFO L93 Difference]: Finished difference Result 6915 states and 8657 transitions. [2025-01-09 00:05:36,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:36,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2025-01-09 00:05:36,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:36,884 INFO L225 Difference]: With dead ends: 6915 [2025-01-09 00:05:36,884 INFO L226 Difference]: Without dead ends: 3952 [2025-01-09 00:05:36,887 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-09 00:05:36,889 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 287 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:36,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 539 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:05:36,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-01-09 00:05:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-01-09 00:05:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.0736522399392558) internal successors, (4242), 3951 states have internal predecessors, (4242), 0 states have call successors, (0), 0 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-09 00:05:36,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4242 transitions. [2025-01-09 00:05:36,947 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4242 transitions. Word has length 202 [2025-01-09 00:05:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:36,947 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4242 transitions. [2025-01-09 00:05:36,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4242 transitions. [2025-01-09 00:05:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 00:05:36,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:36,950 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:05:36,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:05:36,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:36,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:36,951 INFO L85 PathProgramCache]: Analyzing trace with hash -144001499, now seen corresponding path program 1 times [2025-01-09 00:05:36,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:36,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544936914] [2025-01-09 00:05:36,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:36,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:36,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 00:05:36,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 00:05:36,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:36,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:37,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:37,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544936914] [2025-01-09 00:05:37,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544936914] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:05:37,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511427108] [2025-01-09 00:05:37,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:37,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:37,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:05:37,270 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-09 00:05:37,271 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-09 00:05:37,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 00:05:37,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 00:05:37,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:37,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:37,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:05:37,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:05:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:37,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:05:37,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511427108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:37,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:05:37,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-09 00:05:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303703641] [2025-01-09 00:05:37,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:37,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:37,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:37,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:37,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:05:37,421 INFO L87 Difference]: Start difference. First operand 3952 states and 4242 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-09 00:05:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:38,151 INFO L93 Difference]: Finished difference Result 10863 states and 11710 transitions. [2025-01-09 00:05:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:38,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2025-01-09 00:05:38,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:38,166 INFO L225 Difference]: With dead ends: 10863 [2025-01-09 00:05:38,166 INFO L226 Difference]: Without dead ends: 6913 [2025-01-09 00:05:38,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:05:38,171 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 317 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:38,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 49 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:05:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-01-09 00:05:38,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6584. [2025-01-09 00:05:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.07321889715935) internal successors, (7065), 6583 states have internal predecessors, (7065), 0 states have call successors, (0), 0 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-09 00:05:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 7065 transitions. [2025-01-09 00:05:38,251 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 7065 transitions. Word has length 254 [2025-01-09 00:05:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:38,251 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 7065 transitions. [2025-01-09 00:05:38,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-09 00:05:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 7065 transitions. [2025-01-09 00:05:38,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-01-09 00:05:38,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:38,256 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:38,263 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-09 00:05:38,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:38,456 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:38,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:38,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1495621666, now seen corresponding path program 1 times [2025-01-09 00:05:38,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:38,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440142663] [2025-01-09 00:05:38,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:38,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:38,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-01-09 00:05:38,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-01-09 00:05:38,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:38,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440142663] [2025-01-09 00:05:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440142663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:38,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:38,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456987720] [2025-01-09 00:05:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:38,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:38,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:38,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:38,707 INFO L87 Difference]: Start difference. First operand 6584 states and 7065 transitions. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 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-09 00:05:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:39,428 INFO L93 Difference]: Finished difference Result 15469 states and 16634 transitions. [2025-01-09 00:05:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:39,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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 413 [2025-01-09 00:05:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:39,449 INFO L225 Difference]: With dead ends: 15469 [2025-01-09 00:05:39,450 INFO L226 Difference]: Without dead ends: 9216 [2025-01-09 00:05:39,458 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-09 00:05:39,458 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 182 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:39,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 67 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:05:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-01-09 00:05:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8887. [2025-01-09 00:05:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0635831645284717) internal successors, (9451), 8886 states have internal predecessors, (9451), 0 states have call successors, (0), 0 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-09 00:05:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9451 transitions. [2025-01-09 00:05:39,602 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9451 transitions. Word has length 413 [2025-01-09 00:05:39,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:39,602 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9451 transitions. [2025-01-09 00:05:39,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 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-09 00:05:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9451 transitions. [2025-01-09 00:05:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-01-09 00:05:39,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:39,607 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:39,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:05:39,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:39,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:39,607 INFO L85 PathProgramCache]: Analyzing trace with hash 4525627, now seen corresponding path program 1 times [2025-01-09 00:05:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:39,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535019828] [2025-01-09 00:05:39,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:39,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:39,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-01-09 00:05:39,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-01-09 00:05:39,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:39,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-01-09 00:05:39,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:39,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535019828] [2025-01-09 00:05:39,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535019828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:39,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:39,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:39,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436864440] [2025-01-09 00:05:39,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:39,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:39,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:39,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:39,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:39,858 INFO L87 Difference]: Start difference. First operand 8887 states and 9451 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:40,558 INFO L93 Difference]: Finished difference Result 17772 states and 18899 transitions. [2025-01-09 00:05:40,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:40,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 415 [2025-01-09 00:05:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:40,581 INFO L225 Difference]: With dead ends: 17772 [2025-01-09 00:05:40,581 INFO L226 Difference]: Without dead ends: 8887 [2025-01-09 00:05:40,591 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-09 00:05:40,592 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 317 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:40,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 403 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:05:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-01-09 00:05:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887. [2025-01-09 00:05:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0525545802385776) internal successors, (9353), 8886 states have internal predecessors, (9353), 0 states have call successors, (0), 0 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-09 00:05:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9353 transitions. [2025-01-09 00:05:40,722 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9353 transitions. Word has length 415 [2025-01-09 00:05:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:40,723 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9353 transitions. [2025-01-09 00:05:40,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9353 transitions. [2025-01-09 00:05:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-01-09 00:05:40,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:40,734 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:40,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:05:40,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:40,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:40,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1657964897, now seen corresponding path program 1 times [2025-01-09 00:05:40,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:40,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212596096] [2025-01-09 00:05:40,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:40,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:40,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 00:05:40,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 00:05:40,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:40,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-09 00:05:41,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:41,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212596096] [2025-01-09 00:05:41,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212596096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:41,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:41,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:41,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550446164] [2025-01-09 00:05:41,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:41,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:41,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:41,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:41,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:41,053 INFO L87 Difference]: Start difference. First operand 8887 states and 9353 transitions. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 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-09 00:05:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:41,758 INFO L93 Difference]: Finished difference Result 20075 states and 21141 transitions. [2025-01-09 00:05:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:41,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 517 [2025-01-09 00:05:41,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:41,780 INFO L225 Difference]: With dead ends: 20075 [2025-01-09 00:05:41,780 INFO L226 Difference]: Without dead ends: 11519 [2025-01-09 00:05:41,790 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-09 00:05:41,793 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 189 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:41,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 36 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:05:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11519 states. [2025-01-09 00:05:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 11519. [2025-01-09 00:05:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11519 states, 11518 states have (on average 1.0471436013196735) internal successors, (12061), 11518 states have internal predecessors, (12061), 0 states have call successors, (0), 0 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-09 00:05:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 12061 transitions. [2025-01-09 00:05:41,935 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 12061 transitions. Word has length 517 [2025-01-09 00:05:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:41,936 INFO L471 AbstractCegarLoop]: Abstraction has 11519 states and 12061 transitions. [2025-01-09 00:05:41,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 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-09 00:05:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 12061 transitions. [2025-01-09 00:05:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-09 00:05:41,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:41,947 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:05:41,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:05:41,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:41,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:41,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1747908776, now seen corresponding path program 1 times [2025-01-09 00:05:41,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:41,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145506619] [2025-01-09 00:05:41,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:41,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:41,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 00:05:42,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 00:05:42,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:42,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 00:05:42,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:42,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145506619] [2025-01-09 00:05:42,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145506619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:42,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:42,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:42,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648509622] [2025-01-09 00:05:42,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:42,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:05:42,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:42,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:05:42,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:05:42,585 INFO L87 Difference]: Start difference. First operand 11519 states and 12061 transitions. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-09 00:05:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:43,802 INFO L93 Difference]: Finished difference Result 26326 states and 27574 transitions. [2025-01-09 00:05:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:05:43,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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 571 [2025-01-09 00:05:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:43,830 INFO L225 Difference]: With dead ends: 26326 [2025-01-09 00:05:43,830 INFO L226 Difference]: Without dead ends: 15138 [2025-01-09 00:05:43,841 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-09 00:05:43,842 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 271 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:43,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 84 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:05:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2025-01-09 00:05:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 15138. [2025-01-09 00:05:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 1.0461121754640945) internal successors, (15835), 15137 states have internal predecessors, (15835), 0 states have call successors, (0), 0 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-09 00:05:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15835 transitions. [2025-01-09 00:05:44,033 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15835 transitions. Word has length 571 [2025-01-09 00:05:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:44,034 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 15835 transitions. [2025-01-09 00:05:44,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-09 00:05:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15835 transitions. [2025-01-09 00:05:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-01-09 00:05:44,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:44,040 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:44,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:05:44,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:44,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash -540258897, now seen corresponding path program 1 times [2025-01-09 00:05:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789307592] [2025-01-09 00:05:44,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:44,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-01-09 00:05:44,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-01-09 00:05:44,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:44,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2025-01-09 00:05:44,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:44,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789307592] [2025-01-09 00:05:44,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789307592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:44,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:44,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:44,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989119564] [2025-01-09 00:05:44,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:44,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:44,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:44,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:44,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:44,356 INFO L87 Difference]: Start difference. First operand 15138 states and 15835 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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-09 00:05:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:44,942 INFO L93 Difference]: Finished difference Result 29945 states and 31337 transitions. [2025-01-09 00:05:44,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:44,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 632 [2025-01-09 00:05:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:44,960 INFO L225 Difference]: With dead ends: 29945 [2025-01-09 00:05:44,960 INFO L226 Difference]: Without dead ends: 15138 [2025-01-09 00:05:44,973 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-09 00:05:44,974 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 328 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:44,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 421 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:05:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2025-01-09 00:05:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 13493. [2025-01-09 00:05:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.045730803439075) internal successors, (14109), 13492 states have internal predecessors, (14109), 0 states have call successors, (0), 0 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-09 00:05:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 14109 transitions. [2025-01-09 00:05:45,097 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 14109 transitions. Word has length 632 [2025-01-09 00:05:45,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:45,098 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 14109 transitions. [2025-01-09 00:05:45,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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-09 00:05:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 14109 transitions. [2025-01-09 00:05:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2025-01-09 00:05:45,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:45,132 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:45,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:05:45,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:45,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1966993949, now seen corresponding path program 1 times [2025-01-09 00:05:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341431854] [2025-01-09 00:05:45,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:45,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 822 statements into 1 equivalence classes. [2025-01-09 00:05:45,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 822 of 822 statements. [2025-01-09 00:05:45,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:45,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 875 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-09 00:05:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341431854] [2025-01-09 00:05:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341431854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:45,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:45,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:45,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154224707] [2025-01-09 00:05:45,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:45,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:05:45,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:45,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:05:45,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:05:45,808 INFO L87 Difference]: Start difference. First operand 13493 states and 14109 transitions. Second operand has 4 states, 4 states have (on average 185.5) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 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-09 00:05:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:46,784 INFO L93 Difference]: Finished difference Result 28958 states and 30288 transitions. [2025-01-09 00:05:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:05:46,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 185.5) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 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 822 [2025-01-09 00:05:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:46,803 INFO L225 Difference]: With dead ends: 28958 [2025-01-09 00:05:46,803 INFO L226 Difference]: Without dead ends: 15796 [2025-01-09 00:05:46,813 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-09 00:05:46,814 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 273 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:46,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 71 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:05:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2025-01-09 00:05:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 15796. [2025-01-09 00:05:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15796 states, 15795 states have (on average 1.0411522633744856) internal successors, (16445), 15795 states have internal predecessors, (16445), 0 states have call successors, (0), 0 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-09 00:05:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16445 transitions. [2025-01-09 00:05:47,009 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16445 transitions. Word has length 822 [2025-01-09 00:05:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:47,010 INFO L471 AbstractCegarLoop]: Abstraction has 15796 states and 16445 transitions. [2025-01-09 00:05:47,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 185.5) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 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-09 00:05:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16445 transitions. [2025-01-09 00:05:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2025-01-09 00:05:47,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:47,024 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:05:47,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:05:47,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:47,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:47,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1939883298, now seen corresponding path program 1 times [2025-01-09 00:05:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:47,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931949163] [2025-01-09 00:05:47,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:47,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-01-09 00:05:47,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-01-09 00:05:47,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:47,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 1304 trivial. 0 not checked. [2025-01-09 00:05:47,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931949163] [2025-01-09 00:05:47,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931949163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:47,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:47,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:47,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410784023] [2025-01-09 00:05:47,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:47,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:47,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:47,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:47,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:47,916 INFO L87 Difference]: Start difference. First operand 15796 states and 16445 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:48,482 INFO L93 Difference]: Finished difference Result 30932 states and 32224 transitions. [2025-01-09 00:05:48,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:48,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 921 [2025-01-09 00:05:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:48,495 INFO L225 Difference]: With dead ends: 30932 [2025-01-09 00:05:48,495 INFO L226 Difference]: Without dead ends: 15796 [2025-01-09 00:05:48,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-09 00:05:48,533 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 348 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:48,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 377 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:05:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2025-01-09 00:05:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 15796. [2025-01-09 00:05:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15796 states, 15795 states have (on average 1.0350743906299462) internal successors, (16349), 15795 states have internal predecessors, (16349), 0 states have call successors, (0), 0 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-09 00:05:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16349 transitions. [2025-01-09 00:05:48,630 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16349 transitions. Word has length 921 [2025-01-09 00:05:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:48,631 INFO L471 AbstractCegarLoop]: Abstraction has 15796 states and 16349 transitions. [2025-01-09 00:05:48,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16349 transitions. [2025-01-09 00:05:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1323 [2025-01-09 00:05:48,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:48,647 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-09 00:05:48,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:05:48,647 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:48,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1747911679, now seen corresponding path program 1 times [2025-01-09 00:05:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292919925] [2025-01-09 00:05:48,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:48,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-01-09 00:05:48,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-01-09 00:05:48,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:48,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3352 backedges. 2293 proven. 0 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-01-09 00:05:49,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:49,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292919925] [2025-01-09 00:05:49,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292919925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:49,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:49,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:49,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726618595] [2025-01-09 00:05:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:49,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:49,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:49,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:49,327 INFO L87 Difference]: Start difference. First operand 15796 states and 16349 transitions. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 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-09 00:05:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:49,977 INFO L93 Difference]: Finished difference Result 33564 states and 34768 transitions. [2025-01-09 00:05:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:49,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 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 1322 [2025-01-09 00:05:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:49,999 INFO L225 Difference]: With dead ends: 33564 [2025-01-09 00:05:49,999 INFO L226 Difference]: Without dead ends: 18428 [2025-01-09 00:05:50,013 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-09 00:05:50,014 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:50,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 432 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:05:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2025-01-09 00:05:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18099. [2025-01-09 00:05:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0312189192175931) internal successors, (18663), 18098 states have internal predecessors, (18663), 0 states have call successors, (0), 0 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-09 00:05:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18663 transitions. [2025-01-09 00:05:50,232 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18663 transitions. Word has length 1322 [2025-01-09 00:05:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:50,233 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 18663 transitions. [2025-01-09 00:05:50,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 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-09 00:05:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18663 transitions. [2025-01-09 00:05:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1324 [2025-01-09 00:05:50,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:50,249 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-09 00:05:50,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:05:50,250 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:50,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash -284417499, now seen corresponding path program 1 times [2025-01-09 00:05:50,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:50,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438059115] [2025-01-09 00:05:50,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:50,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:50,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1323 statements into 1 equivalence classes. [2025-01-09 00:05:50,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1323 of 1323 statements. [2025-01-09 00:05:50,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:50,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 559 proven. 1424 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2025-01-09 00:05:51,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:51,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438059115] [2025-01-09 00:05:51,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438059115] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:05:51,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981342757] [2025-01-09 00:05:51,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:51,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:51,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:05:51,666 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-09 00:05:51,667 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-09 00:05:51,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1323 statements into 1 equivalence classes. [2025-01-09 00:05:51,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1323 of 1323 statements. [2025-01-09 00:05:51,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:51,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:51,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 1554 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:05:51,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:05:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 2751 trivial. 0 not checked. [2025-01-09 00:05:52,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:05:52,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981342757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:52,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:05:52,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:05:52,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734268454] [2025-01-09 00:05:52,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:52,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:52,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:52,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:52,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:05:52,111 INFO L87 Difference]: Start difference. First operand 18099 states and 18663 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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-09 00:05:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:52,810 INFO L93 Difference]: Finished difference Result 35867 states and 36993 transitions. [2025-01-09 00:05:52,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:52,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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 1323 [2025-01-09 00:05:52,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:52,827 INFO L225 Difference]: With dead ends: 35867 [2025-01-09 00:05:52,827 INFO L226 Difference]: Without dead ends: 18099 [2025-01-09 00:05:52,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1328 GetRequests, 1324 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:05:52,834 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 272 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:52,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 366 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:05:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18099 states. [2025-01-09 00:05:53,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18099 to 18099. [2025-01-09 00:05:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.026688031826721) internal successors, (18581), 18098 states have internal predecessors, (18581), 0 states have call successors, (0), 0 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-09 00:05:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18581 transitions. [2025-01-09 00:05:53,028 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18581 transitions. Word has length 1323 [2025-01-09 00:05:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:53,030 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 18581 transitions. [2025-01-09 00:05:53,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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-09 00:05:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18581 transitions. [2025-01-09 00:05:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1422 [2025-01-09 00:05:53,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:53,047 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-09 00:05:53,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:05:53,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 00:05:53,248 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:53,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:53,249 INFO L85 PathProgramCache]: Analyzing trace with hash 169815418, now seen corresponding path program 1 times [2025-01-09 00:05:53,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:53,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979059974] [2025-01-09 00:05:53,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:53,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:53,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1421 statements into 1 equivalence classes. [2025-01-09 00:05:53,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1421 of 1421 statements. [2025-01-09 00:05:53,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:53,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3851 backedges. 1083 proven. 0 refuted. 0 times theorem prover too weak. 2768 trivial. 0 not checked. [2025-01-09 00:05:54,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979059974] [2025-01-09 00:05:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979059974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:54,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:54,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:54,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167835548] [2025-01-09 00:05:54,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:54,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:54,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:54,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:54,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:54,073 INFO L87 Difference]: Start difference. First operand 18099 states and 18581 transitions. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 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-09 00:05:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:54,772 INFO L93 Difference]: Finished difference Result 36196 states and 37163 transitions. [2025-01-09 00:05:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:54,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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 1421 [2025-01-09 00:05:54,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:54,793 INFO L225 Difference]: With dead ends: 36196 [2025-01-09 00:05:54,793 INFO L226 Difference]: Without dead ends: 17112 [2025-01-09 00:05:54,806 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-09 00:05:54,807 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 168 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:54,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 421 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:05:54,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2025-01-09 00:05:54,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 16783. [2025-01-09 00:05:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0222857823858897) internal successors, (17156), 16782 states have internal predecessors, (17156), 0 states have call successors, (0), 0 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-09 00:05:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17156 transitions. [2025-01-09 00:05:55,013 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17156 transitions. Word has length 1421 [2025-01-09 00:05:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:55,014 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17156 transitions. [2025-01-09 00:05:55,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 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-09 00:05:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17156 transitions. [2025-01-09 00:05:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1839 [2025-01-09 00:05:55,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:55,048 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2025-01-09 00:05:55,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:05:55,048 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:55,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:55,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1439610562, now seen corresponding path program 1 times [2025-01-09 00:05:55,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:55,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694928163] [2025-01-09 00:05:55,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:55,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:55,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1838 statements into 1 equivalence classes. [2025-01-09 00:05:55,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1838 of 1838 statements. [2025-01-09 00:05:55,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:55,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5614 backedges. 3824 proven. 0 refuted. 0 times theorem prover too weak. 1790 trivial. 0 not checked. [2025-01-09 00:05:56,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:56,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694928163] [2025-01-09 00:05:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694928163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:56,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:56,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 00:05:56,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510495757] [2025-01-09 00:05:56,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:56,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 00:05:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:56,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 00:05:56,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:05:56,607 INFO L87 Difference]: Start difference. First operand 16783 states and 17156 transitions. Second operand has 6 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 0 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-09 00:05:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:57,550 INFO L93 Difference]: Finished difference Result 32907 states and 33649 transitions. [2025-01-09 00:05:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 00:05:57,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 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 1838 [2025-01-09 00:05:57,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:57,564 INFO L225 Difference]: With dead ends: 32907 [2025-01-09 00:05:57,564 INFO L226 Difference]: Without dead ends: 16784 [2025-01-09 00:05:57,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:05:57,573 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 269 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:57,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 560 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:05:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16784 states. [2025-01-09 00:05:57,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16784 to 16783. [2025-01-09 00:05:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0220474317721369) internal successors, (17152), 16782 states have internal predecessors, (17152), 0 states have call successors, (0), 0 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-09 00:05:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17152 transitions. [2025-01-09 00:05:57,690 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17152 transitions. Word has length 1838 [2025-01-09 00:05:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:57,690 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17152 transitions. [2025-01-09 00:05:57,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 0 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-09 00:05:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17152 transitions. [2025-01-09 00:05:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1843 [2025-01-09 00:05:57,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:57,712 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:57,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:05:57,712 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:57,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:57,713 INFO L85 PathProgramCache]: Analyzing trace with hash -671321756, now seen corresponding path program 1 times [2025-01-09 00:05:57,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:57,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344973859] [2025-01-09 00:05:57,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:57,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:57,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1842 statements into 1 equivalence classes. [2025-01-09 00:05:57,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1842 of 1842 statements. [2025-01-09 00:05:57,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:57,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6231 backedges. 3967 proven. 0 refuted. 0 times theorem prover too weak. 2264 trivial. 0 not checked. [2025-01-09 00:05:58,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:58,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344973859] [2025-01-09 00:05:58,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344973859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:58,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:58,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:58,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579037014] [2025-01-09 00:05:58,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:58,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:58,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:58,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:58,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:58,560 INFO L87 Difference]: Start difference. First operand 16783 states and 17152 transitions. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 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-09 00:05:59,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:59,130 INFO L93 Difference]: Finished difference Result 36854 states and 37664 transitions. [2025-01-09 00:05:59,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:59,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 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 1842 [2025-01-09 00:05:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:59,148 INFO L225 Difference]: With dead ends: 36854 [2025-01-09 00:05:59,148 INFO L226 Difference]: Without dead ends: 20402 [2025-01-09 00:05:59,157 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-09 00:05:59,157 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:59,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 425 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:05:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20402 states. [2025-01-09 00:05:59,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20402 to 19744. [2025-01-09 00:05:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0206149014840704) internal successors, (20150), 19743 states have internal predecessors, (20150), 0 states have call successors, (0), 0 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-09 00:05:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20150 transitions. [2025-01-09 00:05:59,293 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20150 transitions. Word has length 1842 [2025-01-09 00:05:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:59,293 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20150 transitions. [2025-01-09 00:05:59,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 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-09 00:05:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20150 transitions. [2025-01-09 00:05:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1853 [2025-01-09 00:05:59,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:59,316 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2025-01-09 00:05:59,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:05:59,316 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:59,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:59,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1260043370, now seen corresponding path program 1 times [2025-01-09 00:05:59,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:59,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106775706] [2025-01-09 00:05:59,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:59,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1852 statements into 1 equivalence classes. [2025-01-09 00:05:59,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1852 of 1852 statements. [2025-01-09 00:05:59,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:59,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5564 backedges. 4019 proven. 555 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2025-01-09 00:06:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:02,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106775706] [2025-01-09 00:06:02,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106775706] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:06:02,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196083835] [2025-01-09 00:06:02,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:02,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:02,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:02,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:06:02,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:06:02,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1852 statements into 1 equivalence classes. [2025-01-09 00:06:02,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1852 of 1852 statements. [2025-01-09 00:06:02,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:02,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:02,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 2093 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:06:02,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:06:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5564 backedges. 3863 proven. 0 refuted. 0 times theorem prover too weak. 1701 trivial. 0 not checked. [2025-01-09 00:06:03,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:06:03,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196083835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:03,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:06:03,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:06:03,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106141686] [2025-01-09 00:06:03,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:03,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:03,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:03,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:06:03,272 INFO L87 Difference]: Start difference. First operand 19744 states and 20150 transitions. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-09 00:06:03,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:03,855 INFO L93 Difference]: Finished difference Result 38828 states and 39636 transitions. [2025-01-09 00:06:03,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:03,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 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 1852 [2025-01-09 00:06:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:03,877 INFO L225 Difference]: With dead ends: 38828 [2025-01-09 00:06:03,878 INFO L226 Difference]: Without dead ends: 19744 [2025-01-09 00:06:03,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1859 GetRequests, 1853 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:06:03,890 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 62 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:03,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 428 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:06:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19744 states. [2025-01-09 00:06:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19744 to 19415. [2025-01-09 00:06:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19415 states, 19414 states have (on average 1.020500669619862) internal successors, (19812), 19414 states have internal predecessors, (19812), 0 states have call successors, (0), 0 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-09 00:06:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 19812 transitions. [2025-01-09 00:06:04,051 INFO L78 Accepts]: Start accepts. Automaton has 19415 states and 19812 transitions. Word has length 1852 [2025-01-09 00:06:04,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:04,052 INFO L471 AbstractCegarLoop]: Abstraction has 19415 states and 19812 transitions. [2025-01-09 00:06:04,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-09 00:06:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 19415 states and 19812 transitions. [2025-01-09 00:06:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1953 [2025-01-09 00:06:04,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:04,077 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:06:04,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:06:04,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:04,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:04,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:04,279 INFO L85 PathProgramCache]: Analyzing trace with hash -545985434, now seen corresponding path program 1 times [2025-01-09 00:06:04,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:04,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227878471] [2025-01-09 00:06:04,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:04,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1952 statements into 1 equivalence classes. [2025-01-09 00:06:04,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1952 of 1952 statements. [2025-01-09 00:06:04,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:04,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6879 backedges. 3552 proven. 0 refuted. 0 times theorem prover too weak. 3327 trivial. 0 not checked. [2025-01-09 00:06:06,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:06,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227878471] [2025-01-09 00:06:06,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227878471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:06,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:06,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:06,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514074327] [2025-01-09 00:06:06,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:06,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:06:06,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:06,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:06:06,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:06:06,354 INFO L87 Difference]: Start difference. First operand 19415 states and 19812 transitions. Second operand has 4 states, 4 states have (on average 174.75) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 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-09 00:06:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:07,397 INFO L93 Difference]: Finished difference Result 42447 states and 43330 transitions. [2025-01-09 00:06:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:06:07,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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 1952 [2025-01-09 00:06:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:07,422 INFO L225 Difference]: With dead ends: 42447 [2025-01-09 00:06:07,422 INFO L226 Difference]: Without dead ends: 23692 [2025-01-09 00:06:07,435 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-09 00:06:07,436 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 303 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:07,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 80 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:06:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23692 states. [2025-01-09 00:06:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23692 to 22047. [2025-01-09 00:06:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22047 states, 22046 states have (on average 1.0199129093713146) internal successors, (22485), 22046 states have internal predecessors, (22485), 0 states have call successors, (0), 0 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-09 00:06:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22047 states to 22047 states and 22485 transitions. [2025-01-09 00:06:07,623 INFO L78 Accepts]: Start accepts. Automaton has 22047 states and 22485 transitions. Word has length 1952 [2025-01-09 00:06:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:07,623 INFO L471 AbstractCegarLoop]: Abstraction has 22047 states and 22485 transitions. [2025-01-09 00:06:07,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 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-09 00:06:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 22047 states and 22485 transitions. [2025-01-09 00:06:07,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1955 [2025-01-09 00:06:07,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:07,649 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:06:07,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:06:07,649 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:07,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:07,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1370423871, now seen corresponding path program 1 times [2025-01-09 00:06:07,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:07,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495375440] [2025-01-09 00:06:07,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:07,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:07,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1954 statements into 1 equivalence classes. [2025-01-09 00:06:07,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1954 of 1954 statements. [2025-01-09 00:06:07,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:07,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6885 backedges. 3556 proven. 0 refuted. 0 times theorem prover too weak. 3329 trivial. 0 not checked. [2025-01-09 00:06:09,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:09,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495375440] [2025-01-09 00:06:09,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495375440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:09,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:09,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:09,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334118468] [2025-01-09 00:06:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:09,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:09,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:09,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:09,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:09,513 INFO L87 Difference]: Start difference. First operand 22047 states and 22485 transitions. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 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-09 00:06:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:10,225 INFO L93 Difference]: Finished difference Result 45408 states and 46319 transitions. [2025-01-09 00:06:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:10,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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 1954 [2025-01-09 00:06:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:10,249 INFO L225 Difference]: With dead ends: 45408 [2025-01-09 00:06:10,249 INFO L226 Difference]: Without dead ends: 24350 [2025-01-09 00:06:10,263 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-09 00:06:10,263 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 209 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:10,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 44 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:06:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24350 states. [2025-01-09 00:06:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24350 to 21060. [2025-01-09 00:06:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21060 states, 21059 states have (on average 1.0195640818652358) internal successors, (21471), 21059 states have internal predecessors, (21471), 0 states have call successors, (0), 0 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-09 00:06:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21060 states to 21060 states and 21471 transitions. [2025-01-09 00:06:10,467 INFO L78 Accepts]: Start accepts. Automaton has 21060 states and 21471 transitions. Word has length 1954 [2025-01-09 00:06:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:10,467 INFO L471 AbstractCegarLoop]: Abstraction has 21060 states and 21471 transitions. [2025-01-09 00:06:10,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 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-09 00:06:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 21060 states and 21471 transitions. [2025-01-09 00:06:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1958 [2025-01-09 00:06:10,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:10,492 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 00:06:10,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:06:10,492 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:10,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:10,493 INFO L85 PathProgramCache]: Analyzing trace with hash -428901246, now seen corresponding path program 1 times [2025-01-09 00:06:10,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:10,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363030478] [2025-01-09 00:06:10,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:10,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1957 statements into 1 equivalence classes. [2025-01-09 00:06:10,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1957 of 1957 statements. [2025-01-09 00:06:10,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:10,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6758 backedges. 3554 proven. 0 refuted. 0 times theorem prover too weak. 3204 trivial. 0 not checked. [2025-01-09 00:06:11,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363030478] [2025-01-09 00:06:11,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363030478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:11,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:11,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:11,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736579576] [2025-01-09 00:06:11,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:11,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:11,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:11,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:11,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:11,771 INFO L87 Difference]: Start difference. First operand 21060 states and 21471 transitions. Second operand has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 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-09 00:06:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:12,358 INFO L93 Difference]: Finished difference Result 40473 states and 41284 transitions. [2025-01-09 00:06:12,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:12,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 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 1957 [2025-01-09 00:06:12,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:12,381 INFO L225 Difference]: With dead ends: 40473 [2025-01-09 00:06:12,381 INFO L226 Difference]: Without dead ends: 20402 [2025-01-09 00:06:12,395 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-09 00:06:12,396 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 85 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:12,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 418 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:06:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20402 states. [2025-01-09 00:06:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20402 to 20402. [2025-01-09 00:06:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20402 states, 20401 states have (on average 1.018675555119847) internal successors, (20782), 20401 states have internal predecessors, (20782), 0 states have call successors, (0), 0 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-09 00:06:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20402 states to 20402 states and 20782 transitions. [2025-01-09 00:06:12,554 INFO L78 Accepts]: Start accepts. Automaton has 20402 states and 20782 transitions. Word has length 1957 [2025-01-09 00:06:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:12,555 INFO L471 AbstractCegarLoop]: Abstraction has 20402 states and 20782 transitions. [2025-01-09 00:06:12,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 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-09 00:06:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 20402 states and 20782 transitions. [2025-01-09 00:06:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1983 [2025-01-09 00:06:12,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:12,579 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 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, 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] [2025-01-09 00:06:12,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:06:12,579 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:12,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:12,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1967936704, now seen corresponding path program 1 times [2025-01-09 00:06:12,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:12,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099405882] [2025-01-09 00:06:12,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:12,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:12,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1982 statements into 1 equivalence classes. [2025-01-09 00:06:12,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1982 of 1982 statements. [2025-01-09 00:06:12,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:12,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6648 backedges. 4396 proven. 0 refuted. 0 times theorem prover too weak. 2252 trivial. 0 not checked. [2025-01-09 00:06:14,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:14,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099405882] [2025-01-09 00:06:14,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099405882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:14,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:14,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:06:14,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884819986] [2025-01-09 00:06:14,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:14,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:06:14,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:14,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:06:14,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:06:14,062 INFO L87 Difference]: Start difference. First operand 20402 states and 20782 transitions. Second operand has 4 states, 4 states have (on average 212.5) internal successors, (850), 4 states have internal predecessors, (850), 0 states have call successors, (0), 0 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-09 00:06:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:14,824 INFO L93 Difference]: Finished difference Result 39815 states and 40570 transitions. [2025-01-09 00:06:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:06:14,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 212.5) internal successors, (850), 4 states have internal predecessors, (850), 0 states have call successors, (0), 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 1982 [2025-01-09 00:06:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:14,845 INFO L225 Difference]: With dead ends: 39815 [2025-01-09 00:06:14,845 INFO L226 Difference]: Without dead ends: 20402 [2025-01-09 00:06:14,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:06:14,857 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 120 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:14,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 556 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:06:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20402 states. [2025-01-09 00:06:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20402 to 20402. [2025-01-09 00:06:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20402 states, 20401 states have (on average 1.0185775207097691) internal successors, (20780), 20401 states have internal predecessors, (20780), 0 states have call successors, (0), 0 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-09 00:06:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20402 states to 20402 states and 20780 transitions. [2025-01-09 00:06:15,008 INFO L78 Accepts]: Start accepts. Automaton has 20402 states and 20780 transitions. Word has length 1982 [2025-01-09 00:06:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:15,009 INFO L471 AbstractCegarLoop]: Abstraction has 20402 states and 20780 transitions. [2025-01-09 00:06:15,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 212.5) internal successors, (850), 4 states have internal predecessors, (850), 0 states have call successors, (0), 0 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-09 00:06:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 20402 states and 20780 transitions. [2025-01-09 00:06:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1996 [2025-01-09 00:06:15,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:15,034 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 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, 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] [2025-01-09 00:06:15,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:06:15,034 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:15,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:15,035 INFO L85 PathProgramCache]: Analyzing trace with hash 959853328, now seen corresponding path program 1 times [2025-01-09 00:06:15,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:15,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850668717] [2025-01-09 00:06:15,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:15,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1995 statements into 1 equivalence classes. [2025-01-09 00:06:15,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1995 of 1995 statements. [2025-01-09 00:06:15,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:15,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 7559 backedges. 5049 proven. 79 refuted. 0 times theorem prover too weak. 2431 trivial. 0 not checked. [2025-01-09 00:06:17,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:17,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850668717] [2025-01-09 00:06:17,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850668717] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:06:17,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607079257] [2025-01-09 00:06:17,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:17,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:17,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:17,388 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:06:17,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:06:17,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1995 statements into 1 equivalence classes. [2025-01-09 00:06:17,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1995 of 1995 statements. [2025-01-09 00:06:17,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:17,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:17,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 2303 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:06:17,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:06:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7559 backedges. 4085 proven. 0 refuted. 0 times theorem prover too weak. 3474 trivial. 0 not checked. [2025-01-09 00:06:18,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:06:18,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607079257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:18,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:06:18,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 00:06:18,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655759393] [2025-01-09 00:06:18,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:18,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:18,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:18,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:06:18,519 INFO L87 Difference]: Start difference. First operand 20402 states and 20780 transitions. Second operand has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 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-09 00:06:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:19,088 INFO L93 Difference]: Finished difference Result 39815 states and 40564 transitions. [2025-01-09 00:06:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:19,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 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 1995 [2025-01-09 00:06:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:19,106 INFO L225 Difference]: With dead ends: 39815 [2025-01-09 00:06:19,106 INFO L226 Difference]: Without dead ends: 19744 [2025-01-09 00:06:19,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1998 GetRequests, 1995 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:06:19,117 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:19,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 426 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:06:19,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19744 states. [2025-01-09 00:06:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19744 to 19744. [2025-01-09 00:06:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0174745479410423) internal successors, (20088), 19743 states have internal predecessors, (20088), 0 states have call successors, (0), 0 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-09 00:06:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20088 transitions. [2025-01-09 00:06:19,245 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20088 transitions. Word has length 1995 [2025-01-09 00:06:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:19,246 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20088 transitions. [2025-01-09 00:06:19,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 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-09 00:06:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20088 transitions. [2025-01-09 00:06:19,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2159 [2025-01-09 00:06:19,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:19,307 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 00:06:19,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 00:06:19,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 00:06:19,509 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:19,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:19,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2082520964, now seen corresponding path program 1 times [2025-01-09 00:06:19,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:19,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476115995] [2025-01-09 00:06:19,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:19,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:19,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2158 statements into 1 equivalence classes. [2025-01-09 00:06:19,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2158 of 2158 statements. [2025-01-09 00:06:19,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:19,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8347 backedges. 6196 proven. 521 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2025-01-09 00:06:24,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:24,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476115995] [2025-01-09 00:06:24,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476115995] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:06:24,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243727284] [2025-01-09 00:06:24,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:24,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:24,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:24,203 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:06:24,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:06:24,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2158 statements into 1 equivalence classes. [2025-01-09 00:06:24,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2158 of 2158 statements. [2025-01-09 00:06:24,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:24,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:24,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 2464 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:06:24,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:06:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8347 backedges. 4502 proven. 0 refuted. 0 times theorem prover too weak. 3845 trivial. 0 not checked. [2025-01-09 00:06:24,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:06:24,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243727284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:24,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:06:24,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 00:06:24,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508322687] [2025-01-09 00:06:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:24,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:24,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:24,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:24,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:06:24,810 INFO L87 Difference]: Start difference. First operand 19744 states and 20088 transitions. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 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-09 00:06:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:25,446 INFO L93 Difference]: Finished difference Result 37512 states and 38185 transitions. [2025-01-09 00:06:25,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:25,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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 2158 [2025-01-09 00:06:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:25,471 INFO L225 Difference]: With dead ends: 37512 [2025-01-09 00:06:25,471 INFO L226 Difference]: Without dead ends: 19744 [2025-01-09 00:06:25,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2170 GetRequests, 2163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:06:25,483 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 124 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:25,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 407 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:06:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19744 states. [2025-01-09 00:06:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19744 to 19415. [2025-01-09 00:06:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19415 states, 19414 states have (on average 1.0160193674667766) internal successors, (19725), 19414 states have internal predecessors, (19725), 0 states have call successors, (0), 0 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-09 00:06:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 19725 transitions. [2025-01-09 00:06:25,686 INFO L78 Accepts]: Start accepts. Automaton has 19415 states and 19725 transitions. Word has length 2158 [2025-01-09 00:06:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:25,687 INFO L471 AbstractCegarLoop]: Abstraction has 19415 states and 19725 transitions. [2025-01-09 00:06:25,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 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-09 00:06:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 19415 states and 19725 transitions. [2025-01-09 00:06:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2298 [2025-01-09 00:06:25,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:25,714 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:25,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 00:06:25,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 00:06:25,915 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:25,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:25,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1020258089, now seen corresponding path program 1 times [2025-01-09 00:06:25,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:25,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061324361] [2025-01-09 00:06:25,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:25,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:26,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2297 statements into 1 equivalence classes. [2025-01-09 00:06:26,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2297 of 2297 statements. [2025-01-09 00:06:26,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:26,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10176 backedges. 2211 proven. 0 refuted. 0 times theorem prover too weak. 7965 trivial. 0 not checked. [2025-01-09 00:06:26,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:26,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061324361] [2025-01-09 00:06:26,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061324361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:26,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:26,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:26,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201619953] [2025-01-09 00:06:26,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:26,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:26,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:26,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:26,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:26,801 INFO L87 Difference]: Start difference. First operand 19415 states and 19725 transitions. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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-09 00:06:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:27,452 INFO L93 Difference]: Finished difference Result 38499 states and 39144 transitions. [2025-01-09 00:06:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:27,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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 2297 [2025-01-09 00:06:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:27,470 INFO L225 Difference]: With dead ends: 38499 [2025-01-09 00:06:27,470 INFO L226 Difference]: Without dead ends: 21060 [2025-01-09 00:06:27,479 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-09 00:06:27,480 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 77 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:27,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 421 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:06:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-01-09 00:06:27,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 19744. [2025-01-09 00:06:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0163602289419034) internal successors, (20066), 19743 states have internal predecessors, (20066), 0 states have call successors, (0), 0 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-09 00:06:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20066 transitions. [2025-01-09 00:06:27,686 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20066 transitions. Word has length 2297 [2025-01-09 00:06:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:27,687 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20066 transitions. [2025-01-09 00:06:27,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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-09 00:06:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20066 transitions. [2025-01-09 00:06:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2392 [2025-01-09 00:06:27,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:27,726 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:27,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 00:06:27,726 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:27,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1257141799, now seen corresponding path program 1 times [2025-01-09 00:06:27,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:27,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203568547] [2025-01-09 00:06:27,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:27,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:27,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2391 statements into 1 equivalence classes. [2025-01-09 00:06:27,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2391 of 2391 statements. [2025-01-09 00:06:27,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:27,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10881 backedges. 7708 proven. 153 refuted. 0 times theorem prover too weak. 3020 trivial. 0 not checked. [2025-01-09 00:06:30,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:30,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203568547] [2025-01-09 00:06:30,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203568547] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:06:30,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816504040] [2025-01-09 00:06:30,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:30,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:30,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:30,571 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:06:30,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 00:06:30,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2391 statements into 1 equivalence classes. [2025-01-09 00:06:31,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2391 of 2391 statements. [2025-01-09 00:06:31,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:31,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:31,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 2710 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:06:31,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:06:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10881 backedges. 3987 proven. 0 refuted. 0 times theorem prover too weak. 6894 trivial. 0 not checked. [2025-01-09 00:06:31,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:06:31,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816504040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:31,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:06:31,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:06:31,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481070807] [2025-01-09 00:06:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:31,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:31,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:31,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:31,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:06:31,506 INFO L87 Difference]: Start difference. First operand 19744 states and 20066 transitions. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 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-09 00:06:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:32,330 INFO L93 Difference]: Finished difference Result 39157 states and 39806 transitions. [2025-01-09 00:06:32,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:32,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 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 2391 [2025-01-09 00:06:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:32,352 INFO L225 Difference]: With dead ends: 39157 [2025-01-09 00:06:32,352 INFO L226 Difference]: Without dead ends: 21060 [2025-01-09 00:06:32,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2396 GetRequests, 2391 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:06:32,364 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:32,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 26 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:06:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-01-09 00:06:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 19415. [2025-01-09 00:06:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19415 states, 19414 states have (on average 1.0153497476048212) internal successors, (19712), 19414 states have internal predecessors, (19712), 0 states have call successors, (0), 0 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-09 00:06:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 19712 transitions. [2025-01-09 00:06:32,625 INFO L78 Accepts]: Start accepts. Automaton has 19415 states and 19712 transitions. Word has length 2391 [2025-01-09 00:06:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:32,627 INFO L471 AbstractCegarLoop]: Abstraction has 19415 states and 19712 transitions. [2025-01-09 00:06:32,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 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-09 00:06:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 19415 states and 19712 transitions. [2025-01-09 00:06:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2458 [2025-01-09 00:06:32,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:32,672 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:32,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 00:06:32,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 00:06:32,873 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:32,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:32,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1280267892, now seen corresponding path program 1 times [2025-01-09 00:06:32,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:32,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908256524] [2025-01-09 00:06:32,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:32,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:33,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2457 statements into 1 equivalence classes. [2025-01-09 00:06:33,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2457 of 2457 statements. [2025-01-09 00:06:33,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:33,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11347 backedges. 8002 proven. 153 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2025-01-09 00:06:35,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:35,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908256524] [2025-01-09 00:06:35,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908256524] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:06:35,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481789623] [2025-01-09 00:06:35,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:35,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:35,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:35,793 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:06:35,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 00:06:35,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2457 statements into 1 equivalence classes. [2025-01-09 00:06:36,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2457 of 2457 statements. [2025-01-09 00:06:36,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:36,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:36,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 2776 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:06:36,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:06:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11347 backedges. 7451 proven. 67 refuted. 0 times theorem prover too weak. 3829 trivial. 0 not checked. [2025-01-09 00:06:42,878 INFO L312 TraceCheckSpWp]: Computing backward predicates...