./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label35.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 954f50d37143b139a2ebc4626a6099455decd471f8c1055eb5e8a313dea8492b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:03:09,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:03:09,674 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:03:09,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:03:09,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:03:09,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:03:09,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:03:09,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:03:09,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:03:09,710 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:03:09,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:03:09,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:03:09,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:03:09,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:03:09,711 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:03:09,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:03:09,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:03:09,711 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:03:09,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:03:09,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:03:09,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:03:09,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:03:09,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:03:09,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:03:09,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:03:09,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:03:09,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:03:09,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:03:09,713 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:03:09,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:03:09,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:03:09,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:03:09,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:03:09,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:03:09,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:03:09,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:03:09,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:03:09,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:03:09,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:03:09,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:03:09,715 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:03:09,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:03:09,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:03:09,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:03:09,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:03:09,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:03:09,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:03:09,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:03:09,716 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 -> 954f50d37143b139a2ebc4626a6099455decd471f8c1055eb5e8a313dea8492b [2025-01-09 00:03:10,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:03:10,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:03:10,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:03:10,027 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:03:10,028 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:03:10,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2025-01-09 00:03:11,421 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8188104e2/e23fbe461bce4057b48a8c3f50aa5fbb/FLAG3d0c1b34a [2025-01-09 00:03:11,845 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:03:11,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2025-01-09 00:03:11,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8188104e2/e23fbe461bce4057b48a8c3f50aa5fbb/FLAG3d0c1b34a [2025-01-09 00:03:11,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8188104e2/e23fbe461bce4057b48a8c3f50aa5fbb [2025-01-09 00:03:11,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:03:11,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:03:11,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:03:11,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:03:11,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:03:11,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:03:11" (1/1) ... [2025-01-09 00:03:11,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a098044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:11, skipping insertion in model container [2025-01-09 00:03:11,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:03:11" (1/1) ... [2025-01-09 00:03:11,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:03:12,155 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/Problem15_label35.c[4490,4503] [2025-01-09 00:03:12,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:03:12,601 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:03:12,619 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/Problem15_label35.c[4490,4503] [2025-01-09 00:03:12,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:03:12,837 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:03:12,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12 WrapperNode [2025-01-09 00:03:12,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:03:12,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:03:12,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:03:12,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:03:12,848 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:03:12" (1/1) ... [2025-01-09 00:03:12,887 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:03:12" (1/1) ... [2025-01-09 00:03:13,080 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-01-09 00:03:13,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:03:13,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:03:13,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:03:13,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:03:13,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12" (1/1) ... [2025-01-09 00:03:13,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12" (1/1) ... [2025-01-09 00:03:13,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12" (1/1) ... [2025-01-09 00:03:13,240 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:03:13,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12" (1/1) ... [2025-01-09 00:03:13,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12" (1/1) ... [2025-01-09 00:03:13,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12" (1/1) ... [2025-01-09 00:03:13,316 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12" (1/1) ... [2025-01-09 00:03:13,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12" (1/1) ... [2025-01-09 00:03:13,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12" (1/1) ... [2025-01-09 00:03:13,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12" (1/1) ... [2025-01-09 00:03:13,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:03:13,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:03:13,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:03:13,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:03:13,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12" (1/1) ... [2025-01-09 00:03:13,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:03:13,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:13,438 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:03:13,442 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:03:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:03:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:03:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:03:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:03:13,521 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:03:13,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:03:16,113 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-01-09 00:03:16,113 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:03:16,140 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:03:16,144 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:03:16,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:03:16 BoogieIcfgContainer [2025-01-09 00:03:16,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:03:16,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:03:16,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:03:16,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:03:16,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:03:11" (1/3) ... [2025-01-09 00:03:16,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5a6c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:03:16, skipping insertion in model container [2025-01-09 00:03:16,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:12" (2/3) ... [2025-01-09 00:03:16,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5a6c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:03:16, skipping insertion in model container [2025-01-09 00:03:16,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:03:16" (3/3) ... [2025-01-09 00:03:16,158 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label35.c [2025-01-09 00:03:16,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:03:16,175 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label35.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:03:16,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:03:16,257 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;@63baf894, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:03:16,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:03:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states 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:03:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 00:03:16,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:16,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:16,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:16,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:16,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1973461954, now seen corresponding path program 1 times [2025-01-09 00:03:16,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:16,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743933672] [2025-01-09 00:03:16,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:16,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:16,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 00:03:16,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 00:03:16,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:16,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:16,621 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:03:16,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:16,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743933672] [2025-01-09 00:03:16,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743933672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:16,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:16,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:03:16,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145825657] [2025-01-09 00:03:16,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:16,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:16,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:16,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:16,649 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 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 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:03:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:18,562 INFO L93 Difference]: Finished difference Result 1155 states and 2103 transitions. [2025-01-09 00:03:18,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:18,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-01-09 00:03:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:18,582 INFO L225 Difference]: With dead ends: 1155 [2025-01-09 00:03:18,582 INFO L226 Difference]: Without dead ends: 667 [2025-01-09 00:03:18,590 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:03:18,595 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 308 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:18,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 371 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:03:18,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-01-09 00:03:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2025-01-09 00:03:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 0 states 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:03:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2025-01-09 00:03:18,663 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 36 [2025-01-09 00:03:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:18,664 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2025-01-09 00:03:18,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:03:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2025-01-09 00:03:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 00:03:18,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:18,670 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:18,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:03:18,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:18,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1794876168, now seen corresponding path program 1 times [2025-01-09 00:03:18,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:18,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079591079] [2025-01-09 00:03:18,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:18,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:18,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 00:03:18,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 00:03:18,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:18,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:03:18,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:18,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079591079] [2025-01-09 00:03:18,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079591079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:18,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:18,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:03:18,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382743651] [2025-01-09 00:03:18,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:18,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:18,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:18,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:18,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:18,977 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:03:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:20,554 INFO L93 Difference]: Finished difference Result 1931 states and 2857 transitions. [2025-01-09 00:03:20,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:20,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-01-09 00:03:20,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:20,561 INFO L225 Difference]: With dead ends: 1931 [2025-01-09 00:03:20,561 INFO L226 Difference]: Without dead ends: 1268 [2025-01-09 00:03:20,563 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:03:20,564 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 240 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:20,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 366 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:03:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-01-09 00:03:20,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1266. [2025-01-09 00:03:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states 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:03:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2025-01-09 00:03:20,609 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 111 [2025-01-09 00:03:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:20,609 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2025-01-09 00:03:20,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:03:20,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2025-01-09 00:03:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 00:03:20,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:20,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:03:20,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:03:20,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:20,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1820347793, now seen corresponding path program 1 times [2025-01-09 00:03:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:20,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996747827] [2025-01-09 00:03:20,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:20,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 00:03:20,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 00:03:20,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:20,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:03:21,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:21,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996747827] [2025-01-09 00:03:21,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996747827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:21,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:21,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545290683] [2025-01-09 00:03:21,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:21,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:03:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:21,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:03:21,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:03:21,013 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 50.5) 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:03:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:23,659 INFO L93 Difference]: Finished difference Result 4670 states and 6170 transitions. [2025-01-09 00:03:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:03:23,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) 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:03:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:23,677 INFO L225 Difference]: With dead ends: 4670 [2025-01-09 00:03:23,677 INFO L226 Difference]: Without dead ends: 3406 [2025-01-09 00:03:23,680 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:03:23,682 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 487 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:23,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 373 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:03:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2025-01-09 00:03:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381. [2025-01-09 00:03:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.23698224852071) internal successors, (4181), 3380 states have internal predecessors, (4181), 0 states have call successors, (0), 0 states 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:03:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4181 transitions. [2025-01-09 00:03:23,768 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4181 transitions. Word has length 202 [2025-01-09 00:03:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:23,770 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4181 transitions. [2025-01-09 00:03:23,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) 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:03:23,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4181 transitions. [2025-01-09 00:03:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 00:03:23,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:23,778 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:23,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:03:23,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:23,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:23,779 INFO L85 PathProgramCache]: Analyzing trace with hash -892892665, now seen corresponding path program 1 times [2025-01-09 00:03:23,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:23,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558585049] [2025-01-09 00:03:23,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:23,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 00:03:23,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 00:03:23,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:23,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 00:03:24,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:24,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558585049] [2025-01-09 00:03:24,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558585049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:24,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:24,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:03:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541898552] [2025-01-09 00:03:24,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:24,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:24,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:24,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:24,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:24,102 INFO L87 Difference]: Start difference. First operand 3381 states and 4181 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:03:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:25,480 INFO L93 Difference]: Finished difference Result 8563 states and 10756 transitions. [2025-01-09 00:03:25,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:25,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-01-09 00:03:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:25,503 INFO L225 Difference]: With dead ends: 8563 [2025-01-09 00:03:25,504 INFO L226 Difference]: Without dead ends: 5483 [2025-01-09 00:03:25,510 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:03:25,512 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:25,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:03:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-01-09 00:03:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-01-09 00:03:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.168888077414643) internal successors, (6402), 5477 states have internal predecessors, (6402), 0 states have call successors, (0), 0 states 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:03:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6402 transitions. [2025-01-09 00:03:25,631 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6402 transitions. Word has length 206 [2025-01-09 00:03:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:25,632 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6402 transitions. [2025-01-09 00:03:25,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:03:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6402 transitions. [2025-01-09 00:03:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 00:03:25,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:25,664 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:25,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:03:25,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:25,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:25,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1032476883, now seen corresponding path program 1 times [2025-01-09 00:03:25,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:25,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785457506] [2025-01-09 00:03:25,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:25,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:25,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 00:03:25,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 00:03:25,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:25,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 00:03:26,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:26,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785457506] [2025-01-09 00:03:26,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785457506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:26,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:26,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:03:26,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155624075] [2025-01-09 00:03:26,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:26,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:26,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:26,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:26,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:26,356 INFO L87 Difference]: Start difference. First operand 5478 states and 6402 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:03:27,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:27,535 INFO L93 Difference]: Finished difference Result 10655 states and 12491 transitions. [2025-01-09 00:03:27,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:27,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 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 308 [2025-01-09 00:03:27,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:27,554 INFO L225 Difference]: With dead ends: 10655 [2025-01-09 00:03:27,554 INFO L226 Difference]: Without dead ends: 5478 [2025-01-09 00:03:27,561 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:03:27,563 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:27,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:03:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-01-09 00:03:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-01-09 00:03:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1677925871827644) internal successors, (6396), 5477 states have internal predecessors, (6396), 0 states have call successors, (0), 0 states 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:03:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6396 transitions. [2025-01-09 00:03:27,670 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6396 transitions. Word has length 308 [2025-01-09 00:03:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:27,670 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6396 transitions. [2025-01-09 00:03:27,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:03:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6396 transitions. [2025-01-09 00:03:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-09 00:03:27,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:27,676 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:27,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:03:27,676 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:27,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:27,677 INFO L85 PathProgramCache]: Analyzing trace with hash 717549209, now seen corresponding path program 1 times [2025-01-09 00:03:27,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:27,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587935880] [2025-01-09 00:03:27,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:27,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:27,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 00:03:27,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 00:03:27,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:27,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:03:28,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:28,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587935880] [2025-01-09 00:03:28,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587935880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:28,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:28,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:28,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781834681] [2025-01-09 00:03:28,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:28,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:28,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:28,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:28,093 INFO L87 Difference]: Start difference. First operand 5478 states and 6396 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:29,664 INFO L93 Difference]: Finished difference Result 12758 states and 15198 transitions. [2025-01-09 00:03:29,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:29,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2025-01-09 00:03:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:29,687 INFO L225 Difference]: With dead ends: 12758 [2025-01-09 00:03:29,687 INFO L226 Difference]: Without dead ends: 7581 [2025-01-09 00:03:29,694 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:03:29,695 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 280 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:29,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 670 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:03:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2025-01-09 00:03:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7579. [2025-01-09 00:03:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7579 states, 7578 states have (on average 1.142253892847717) internal successors, (8656), 7578 states have internal predecessors, (8656), 0 states have call successors, (0), 0 states 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:03:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7579 states to 7579 states and 8656 transitions. [2025-01-09 00:03:29,823 INFO L78 Accepts]: Start accepts. Automaton has 7579 states and 8656 transitions. Word has length 323 [2025-01-09 00:03:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:29,823 INFO L471 AbstractCegarLoop]: Abstraction has 7579 states and 8656 transitions. [2025-01-09 00:03:29,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 7579 states and 8656 transitions. [2025-01-09 00:03:29,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-09 00:03:29,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:29,829 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:29,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:03:29,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:29,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:29,830 INFO L85 PathProgramCache]: Analyzing trace with hash 899776607, now seen corresponding path program 1 times [2025-01-09 00:03:29,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:29,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451092185] [2025-01-09 00:03:29,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:29,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:29,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-09 00:03:29,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-09 00:03:29,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:29,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-09 00:03:30,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:30,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451092185] [2025-01-09 00:03:30,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451092185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:30,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:30,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:30,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483401942] [2025-01-09 00:03:30,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:30,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:30,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:30,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:30,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:30,206 INFO L87 Difference]: Start difference. First operand 7579 states and 8656 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:31,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:31,635 INFO L93 Difference]: Finished difference Result 16956 states and 19720 transitions. [2025-01-09 00:03:31,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:31,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 382 [2025-01-09 00:03:31,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:31,661 INFO L225 Difference]: With dead ends: 16956 [2025-01-09 00:03:31,662 INFO L226 Difference]: Without dead ends: 9678 [2025-01-09 00:03:31,669 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:03:31,669 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 291 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:31,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 633 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:03:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9678 states. [2025-01-09 00:03:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9678 to 8781. [2025-01-09 00:03:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8781 states, 8780 states have (on average 1.1330296127562642) internal successors, (9948), 8780 states have internal predecessors, (9948), 0 states have call successors, (0), 0 states 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:03:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8781 states to 8781 states and 9948 transitions. [2025-01-09 00:03:31,812 INFO L78 Accepts]: Start accepts. Automaton has 8781 states and 9948 transitions. Word has length 382 [2025-01-09 00:03:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:31,813 INFO L471 AbstractCegarLoop]: Abstraction has 8781 states and 9948 transitions. [2025-01-09 00:03:31,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8781 states and 9948 transitions. [2025-01-09 00:03:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-01-09 00:03:31,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:31,821 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:31,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:03:31,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:31,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:31,822 INFO L85 PathProgramCache]: Analyzing trace with hash -249750267, now seen corresponding path program 1 times [2025-01-09 00:03:31,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:31,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606536807] [2025-01-09 00:03:31,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:31,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:31,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-01-09 00:03:31,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-01-09 00:03:31,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:31,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:03:32,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:32,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606536807] [2025-01-09 00:03:32,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606536807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:32,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:32,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:32,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002200146] [2025-01-09 00:03:32,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:32,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:32,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:32,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:32,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:32,183 INFO L87 Difference]: Start difference. First operand 8781 states and 9948 transitions. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states 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:03:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:33,741 INFO L93 Difference]: Finished difference Result 19063 states and 21978 transitions. [2025-01-09 00:03:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:33,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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 399 [2025-01-09 00:03:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:33,766 INFO L225 Difference]: With dead ends: 19063 [2025-01-09 00:03:33,767 INFO L226 Difference]: Without dead ends: 10583 [2025-01-09 00:03:33,773 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:03:33,774 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 246 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:33,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:03:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10583 states. [2025-01-09 00:03:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10583 to 10277. [2025-01-09 00:03:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10277 states, 10276 states have (on average 1.1220319190346437) internal successors, (11530), 10276 states have internal predecessors, (11530), 0 states have call successors, (0), 0 states 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:03:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10277 states to 10277 states and 11530 transitions. [2025-01-09 00:03:33,891 INFO L78 Accepts]: Start accepts. Automaton has 10277 states and 11530 transitions. Word has length 399 [2025-01-09 00:03:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:33,892 INFO L471 AbstractCegarLoop]: Abstraction has 10277 states and 11530 transitions. [2025-01-09 00:03:33,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states 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:03:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 10277 states and 11530 transitions. [2025-01-09 00:03:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-01-09 00:03:33,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:33,908 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:33,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:03:33,909 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:33,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1879818496, now seen corresponding path program 1 times [2025-01-09 00:03:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:33,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271650966] [2025-01-09 00:03:33,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:33,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-01-09 00:03:34,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-01-09 00:03:34,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:34,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 00:03:34,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271650966] [2025-01-09 00:03:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271650966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:34,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:34,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896047803] [2025-01-09 00:03:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:34,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:34,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:34,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:34,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:34,332 INFO L87 Difference]: Start difference. First operand 10277 states and 11530 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:03:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:35,757 INFO L93 Difference]: Finished difference Result 23542 states and 26614 transitions. [2025-01-09 00:03:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:35,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 487 [2025-01-09 00:03:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:35,792 INFO L225 Difference]: With dead ends: 23542 [2025-01-09 00:03:35,792 INFO L226 Difference]: Without dead ends: 13566 [2025-01-09 00:03:35,805 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:03:35,807 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:35,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:03:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13566 states. [2025-01-09 00:03:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13566 to 9075. [2025-01-09 00:03:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9075 states, 9074 states have (on average 1.1320255675556534) internal successors, (10272), 9074 states have internal predecessors, (10272), 0 states have call successors, (0), 0 states 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:03:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 10272 transitions. [2025-01-09 00:03:35,996 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 10272 transitions. Word has length 487 [2025-01-09 00:03:35,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:35,997 INFO L471 AbstractCegarLoop]: Abstraction has 9075 states and 10272 transitions. [2025-01-09 00:03:35,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:03:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 10272 transitions. [2025-01-09 00:03:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 00:03:36,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:36,004 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:36,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:03:36,005 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:36,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:36,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2070174581, now seen corresponding path program 1 times [2025-01-09 00:03:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:36,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161604829] [2025-01-09 00:03:36,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:36,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 00:03:36,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 00:03:36,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:36,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 477 proven. 39 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-01-09 00:03:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:36,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161604829] [2025-01-09 00:03:36,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161604829] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:36,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759956868] [2025-01-09 00:03:36,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:36,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:36,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:36,631 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:03:36,632 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:03:36,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 00:03:36,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 00:03:36,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:36,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:36,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:03:36,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-09 00:03:37,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:03:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759956868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:37,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:03:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:03:37,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888783379] [2025-01-09 00:03:37,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:37,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:37,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:37,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:37,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:03:37,042 INFO L87 Difference]: Start difference. First operand 9075 states and 10272 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:38,771 INFO L93 Difference]: Finished difference Result 22630 states and 25686 transitions. [2025-01-09 00:03:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:38,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 520 [2025-01-09 00:03:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:38,800 INFO L225 Difference]: With dead ends: 22630 [2025-01-09 00:03:38,801 INFO L226 Difference]: Without dead ends: 13856 [2025-01-09 00:03:38,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:03:38,812 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 304 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:38,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 265 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:03:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13856 states. [2025-01-09 00:03:38,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13856 to 10865. [2025-01-09 00:03:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10865 states, 10864 states have (on average 1.133100147275405) internal successors, (12310), 10864 states have internal predecessors, (12310), 0 states have call successors, (0), 0 states 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:03:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10865 states to 10865 states and 12310 transitions. [2025-01-09 00:03:38,956 INFO L78 Accepts]: Start accepts. Automaton has 10865 states and 12310 transitions. Word has length 520 [2025-01-09 00:03:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:38,957 INFO L471 AbstractCegarLoop]: Abstraction has 10865 states and 12310 transitions. [2025-01-09 00:03:38,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 10865 states and 12310 transitions. [2025-01-09 00:03:38,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-01-09 00:03:38,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:38,964 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:38,974 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:03:39,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 00:03:39,168 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:39,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash 655021057, now seen corresponding path program 1 times [2025-01-09 00:03:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:39,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136917208] [2025-01-09 00:03:39,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:39,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:39,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-01-09 00:03:39,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-01-09 00:03:39,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:39,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-01-09 00:03:39,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:39,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136917208] [2025-01-09 00:03:39,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136917208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:39,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:39,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:39,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425060113] [2025-01-09 00:03:39,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:39,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:39,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:39,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:39,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:39,665 INFO L87 Difference]: Start difference. First operand 10865 states and 12310 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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:03:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:41,055 INFO L93 Difference]: Finished difference Result 25629 states and 29241 transitions. [2025-01-09 00:03:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:41,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 524 [2025-01-09 00:03:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:41,085 INFO L225 Difference]: With dead ends: 25629 [2025-01-09 00:03:41,085 INFO L226 Difference]: Without dead ends: 15065 [2025-01-09 00:03:41,097 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:03:41,098 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:41,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 619 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:03:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15065 states. [2025-01-09 00:03:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15065 to 14456. [2025-01-09 00:03:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14456 states, 14455 states have (on average 1.1253545485991006) internal successors, (16267), 14455 states have internal predecessors, (16267), 0 states have call successors, (0), 0 states 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:03:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14456 states to 14456 states and 16267 transitions. [2025-01-09 00:03:41,343 INFO L78 Accepts]: Start accepts. Automaton has 14456 states and 16267 transitions. Word has length 524 [2025-01-09 00:03:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:41,344 INFO L471 AbstractCegarLoop]: Abstraction has 14456 states and 16267 transitions. [2025-01-09 00:03:41,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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:03:41,344 INFO L276 IsEmpty]: Start isEmpty. Operand 14456 states and 16267 transitions. [2025-01-09 00:03:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-01-09 00:03:41,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:41,356 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:41,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:03:41,357 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:41,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1441494816, now seen corresponding path program 1 times [2025-01-09 00:03:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:41,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335555097] [2025-01-09 00:03:41,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:41,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-01-09 00:03:41,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-01-09 00:03:41,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:41,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-01-09 00:03:41,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:41,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335555097] [2025-01-09 00:03:41,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335555097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:41,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:41,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:41,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280509511] [2025-01-09 00:03:41,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:41,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:41,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:41,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:41,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:41,672 INFO L87 Difference]: Start difference. First operand 14456 states and 16267 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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:03:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:42,907 INFO L93 Difference]: Finished difference Result 28908 states and 32566 transitions. [2025-01-09 00:03:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:42,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 537 [2025-01-09 00:03:42,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:42,925 INFO L225 Difference]: With dead ends: 28908 [2025-01-09 00:03:42,925 INFO L226 Difference]: Without dead ends: 14753 [2025-01-09 00:03:42,938 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:03:42,939 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:42,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 70 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:03:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14753 states. [2025-01-09 00:03:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14753 to 14454. [2025-01-09 00:03:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14454 states, 14453 states have (on average 1.1252335155331072) internal successors, (16263), 14453 states have internal predecessors, (16263), 0 states have call successors, (0), 0 states 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:03:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14454 states to 14454 states and 16263 transitions. [2025-01-09 00:03:43,109 INFO L78 Accepts]: Start accepts. Automaton has 14454 states and 16263 transitions. Word has length 537 [2025-01-09 00:03:43,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:43,110 INFO L471 AbstractCegarLoop]: Abstraction has 14454 states and 16263 transitions. [2025-01-09 00:03:43,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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:03:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 14454 states and 16263 transitions. [2025-01-09 00:03:43,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-01-09 00:03:43,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:43,119 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:43,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:03:43,120 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:43,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2006415634, now seen corresponding path program 1 times [2025-01-09 00:03:43,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:43,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914736121] [2025-01-09 00:03:43,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:43,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:43,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-01-09 00:03:43,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-01-09 00:03:43,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:43,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 00:03:43,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:43,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914736121] [2025-01-09 00:03:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914736121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:43,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:43,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:43,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915721004] [2025-01-09 00:03:43,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:43,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:43,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:43,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:43,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:43,369 INFO L87 Difference]: Start difference. First operand 14454 states and 16263 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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:03:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:44,578 INFO L93 Difference]: Finished difference Result 30399 states and 34239 transitions. [2025-01-09 00:03:44,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:44,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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 557 [2025-01-09 00:03:44,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:44,595 INFO L225 Difference]: With dead ends: 30399 [2025-01-09 00:03:44,595 INFO L226 Difference]: Without dead ends: 16246 [2025-01-09 00:03:44,605 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:03:44,606 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 267 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:44,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 327 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:03:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2025-01-09 00:03:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 12057. [2025-01-09 00:03:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12057 states, 12056 states have (on average 1.1346217650962176) internal successors, (13679), 12056 states have internal predecessors, (13679), 0 states have call successors, (0), 0 states 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:03:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12057 states to 12057 states and 13679 transitions. [2025-01-09 00:03:44,770 INFO L78 Accepts]: Start accepts. Automaton has 12057 states and 13679 transitions. Word has length 557 [2025-01-09 00:03:44,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:44,771 INFO L471 AbstractCegarLoop]: Abstraction has 12057 states and 13679 transitions. [2025-01-09 00:03:44,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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:03:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 12057 states and 13679 transitions. [2025-01-09 00:03:44,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-01-09 00:03:44,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:44,780 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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:03:44,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:03:44,780 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:44,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:44,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1108838917, now seen corresponding path program 1 times [2025-01-09 00:03:44,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:44,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833798526] [2025-01-09 00:03:44,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:44,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:44,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-01-09 00:03:44,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-01-09 00:03:44,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:44,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 634 proven. 39 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-01-09 00:03:45,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:45,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833798526] [2025-01-09 00:03:45,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833798526] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:45,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177719727] [2025-01-09 00:03:45,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:45,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:45,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:45,381 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:03:45,383 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:03:45,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-01-09 00:03:45,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-01-09 00:03:45,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:45,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:45,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:03:45,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-09 00:03:45,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:03:45,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177719727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:45,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:03:45,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:03:45,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663337320] [2025-01-09 00:03:45,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:45,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:45,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:45,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:45,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:03:45,738 INFO L87 Difference]: Start difference. First operand 12057 states and 13679 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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:03:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:46,974 INFO L93 Difference]: Finished difference Result 23809 states and 27046 transitions. [2025-01-09 00:03:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:46,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 599 [2025-01-09 00:03:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:46,992 INFO L225 Difference]: With dead ends: 23809 [2025-01-09 00:03:46,993 INFO L226 Difference]: Without dead ends: 12053 [2025-01-09 00:03:47,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:03:47,005 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 251 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:47,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 599 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:03:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12053 states. [2025-01-09 00:03:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12053 to 12052. [2025-01-09 00:03:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12052 states, 12051 states have (on average 1.0851381628080656) internal successors, (13077), 12051 states have internal predecessors, (13077), 0 states have call successors, (0), 0 states 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:03:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12052 states to 12052 states and 13077 transitions. [2025-01-09 00:03:47,174 INFO L78 Accepts]: Start accepts. Automaton has 12052 states and 13077 transitions. Word has length 599 [2025-01-09 00:03:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:47,174 INFO L471 AbstractCegarLoop]: Abstraction has 12052 states and 13077 transitions. [2025-01-09 00:03:47,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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:03:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 12052 states and 13077 transitions. [2025-01-09 00:03:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2025-01-09 00:03:47,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:47,184 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:47,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:03:47,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:47,385 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:47,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1668796524, now seen corresponding path program 1 times [2025-01-09 00:03:47,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:47,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17511168] [2025-01-09 00:03:47,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:47,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 600 statements into 1 equivalence classes. [2025-01-09 00:03:47,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 600 of 600 statements. [2025-01-09 00:03:47,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:47,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-09 00:03:47,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17511168] [2025-01-09 00:03:47,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17511168] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862318471] [2025-01-09 00:03:47,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:47,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:47,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:47,962 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:03:47,965 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:03:48,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 600 statements into 1 equivalence classes. [2025-01-09 00:03:48,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 600 of 600 statements. [2025-01-09 00:03:48,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:48,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:48,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:03:48,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-09 00:03:48,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:03:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-09 00:03:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862318471] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:03:49,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:03:49,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-09 00:03:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080078980] [2025-01-09 00:03:49,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:03:49,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:03:49,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:49,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:03:49,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:03:49,628 INFO L87 Difference]: Start difference. First operand 12052 states and 13077 transitions. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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:03:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:54,344 INFO L93 Difference]: Finished difference Result 31734 states and 34291 transitions. [2025-01-09 00:03:54,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 00:03:54,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 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 600 [2025-01-09 00:03:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:54,356 INFO L225 Difference]: With dead ends: 31734 [2025-01-09 00:03:54,356 INFO L226 Difference]: Without dead ends: 13249 [2025-01-09 00:03:54,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1209 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:03:54,362 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 2888 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 6622 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2888 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 7130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 6622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:54,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2888 Valid, 307 Invalid, 7130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 6622 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 00:03:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13249 states. [2025-01-09 00:03:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13249 to 12349. [2025-01-09 00:03:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12349 states, 12348 states have (on average 1.035552316164561) internal successors, (12787), 12348 states have internal predecessors, (12787), 0 states have call successors, (0), 0 states 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:03:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12349 states to 12349 states and 12787 transitions. [2025-01-09 00:03:54,471 INFO L78 Accepts]: Start accepts. Automaton has 12349 states and 12787 transitions. Word has length 600 [2025-01-09 00:03:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:54,471 INFO L471 AbstractCegarLoop]: Abstraction has 12349 states and 12787 transitions. [2025-01-09 00:03:54,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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:03:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 12349 states and 12787 transitions. [2025-01-09 00:03:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2025-01-09 00:03:54,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:54,478 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:03:54,487 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:03:54,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:54,680 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:54,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash 352632027, now seen corresponding path program 1 times [2025-01-09 00:03:54,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:54,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158138469] [2025-01-09 00:03:54,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:54,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-01-09 00:03:54,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-01-09 00:03:54,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:54,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-01-09 00:03:54,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:54,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158138469] [2025-01-09 00:03:54,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158138469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:54,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:54,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:54,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655873148] [2025-01-09 00:03:54,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:54,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:54,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:54,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:54,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:54,931 INFO L87 Difference]: Start difference. First operand 12349 states and 12787 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:55,661 INFO L93 Difference]: Finished difference Result 27681 states and 28704 transitions. [2025-01-09 00:03:55,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:55,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 637 [2025-01-09 00:03:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:55,673 INFO L225 Difference]: With dead ends: 27681 [2025-01-09 00:03:55,673 INFO L226 Difference]: Without dead ends: 15334 [2025-01-09 00:03:55,680 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:03:55,681 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 278 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:55,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 521 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:03:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15334 states. [2025-01-09 00:03:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15334 to 14736. [2025-01-09 00:03:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14736 states, 14735 states have (on average 1.0304716661011197) internal successors, (15184), 14735 states have internal predecessors, (15184), 0 states have call successors, (0), 0 states 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:03:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14736 states to 14736 states and 15184 transitions. [2025-01-09 00:03:55,835 INFO L78 Accepts]: Start accepts. Automaton has 14736 states and 15184 transitions. Word has length 637 [2025-01-09 00:03:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:55,835 INFO L471 AbstractCegarLoop]: Abstraction has 14736 states and 15184 transitions. [2025-01-09 00:03:55,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 14736 states and 15184 transitions. [2025-01-09 00:03:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-01-09 00:03:55,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:55,840 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:55,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:03:55,841 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:55,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:55,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1668921925, now seen corresponding path program 1 times [2025-01-09 00:03:55,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:55,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968139704] [2025-01-09 00:03:55,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:55,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:55,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 00:03:55,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 00:03:55,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:55,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 00:03:56,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:56,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968139704] [2025-01-09 00:03:56,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968139704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:56,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:56,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:56,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901418764] [2025-01-09 00:03:56,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:56,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:56,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:56,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:56,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:56,296 INFO L87 Difference]: Start difference. First operand 14736 states and 15184 transitions. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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:03:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:57,076 INFO L93 Difference]: Finished difference Result 32169 states and 33201 transitions. [2025-01-09 00:03:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:57,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 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 661 [2025-01-09 00:03:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:57,094 INFO L225 Difference]: With dead ends: 32169 [2025-01-09 00:03:57,094 INFO L226 Difference]: Without dead ends: 17734 [2025-01-09 00:03:57,104 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:03:57,105 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 85 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:57,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 483 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:03:57,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17734 states. [2025-01-09 00:03:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17734 to 17432. [2025-01-09 00:03:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17432 states, 17431 states have (on average 1.0305203373300442) internal successors, (17963), 17431 states have internal predecessors, (17963), 0 states have call successors, (0), 0 states 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:03:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17432 states to 17432 states and 17963 transitions. [2025-01-09 00:03:57,207 INFO L78 Accepts]: Start accepts. Automaton has 17432 states and 17963 transitions. Word has length 661 [2025-01-09 00:03:57,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:57,207 INFO L471 AbstractCegarLoop]: Abstraction has 17432 states and 17963 transitions. [2025-01-09 00:03:57,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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:03:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 17432 states and 17963 transitions. [2025-01-09 00:03:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-01-09 00:03:57,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:57,213 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:03:57,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:03:57,213 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:57,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1010987259, now seen corresponding path program 1 times [2025-01-09 00:03:57,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:57,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998434198] [2025-01-09 00:03:57,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:57,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-01-09 00:03:57,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-01-09 00:03:57,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:57,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2025-01-09 00:03:57,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:57,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998434198] [2025-01-09 00:03:57,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998434198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:57,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:57,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:57,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219160681] [2025-01-09 00:03:57,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:57,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:57,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:57,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:57,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:57,570 INFO L87 Difference]: Start difference. First operand 17432 states and 17963 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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:03:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:58,394 INFO L93 Difference]: Finished difference Result 37249 states and 38454 transitions. [2025-01-09 00:03:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:58,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 666 [2025-01-09 00:03:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:58,415 INFO L225 Difference]: With dead ends: 37249 [2025-01-09 00:03:58,415 INFO L226 Difference]: Without dead ends: 20118 [2025-01-09 00:03:58,426 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:03:58,426 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 313 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:58,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 494 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:03:58,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20118 states. [2025-01-09 00:03:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20118 to 17126. [2025-01-09 00:03:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17126 states, 17125 states have (on average 1.0286715328467153) internal successors, (17616), 17125 states have internal predecessors, (17616), 0 states have call successors, (0), 0 states 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:03:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17126 states to 17126 states and 17616 transitions. [2025-01-09 00:03:58,577 INFO L78 Accepts]: Start accepts. Automaton has 17126 states and 17616 transitions. Word has length 666 [2025-01-09 00:03:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:58,578 INFO L471 AbstractCegarLoop]: Abstraction has 17126 states and 17616 transitions. [2025-01-09 00:03:58,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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:03:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 17126 states and 17616 transitions. [2025-01-09 00:03:58,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-01-09 00:03:58,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:58,582 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:58,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:03:58,582 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:58,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:58,583 INFO L85 PathProgramCache]: Analyzing trace with hash 367038875, now seen corresponding path program 1 times [2025-01-09 00:03:58,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:58,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323244156] [2025-01-09 00:03:58,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:58,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:58,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-01-09 00:03:58,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-01-09 00:03:58,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:58,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2025-01-09 00:03:58,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:58,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323244156] [2025-01-09 00:03:58,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323244156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:58,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:58,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178143129] [2025-01-09 00:03:58,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:58,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:58,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:58,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:58,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:58,788 INFO L87 Difference]: Start difference. First operand 17126 states and 17616 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:03:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:59,519 INFO L93 Difference]: Finished difference Result 35146 states and 36156 transitions. [2025-01-09 00:03:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:59,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 687 [2025-01-09 00:03:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:59,533 INFO L225 Difference]: With dead ends: 35146 [2025-01-09 00:03:59,533 INFO L226 Difference]: Without dead ends: 18321 [2025-01-09 00:03:59,542 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:03:59,542 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 357 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:59,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 416 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:03:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18321 states. [2025-01-09 00:03:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18321 to 16826. [2025-01-09 00:03:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16826 states, 16825 states have (on average 1.0273997028231798) internal successors, (17286), 16825 states have internal predecessors, (17286), 0 states have call successors, (0), 0 states 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:03:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16826 states to 16826 states and 17286 transitions. [2025-01-09 00:03:59,657 INFO L78 Accepts]: Start accepts. Automaton has 16826 states and 17286 transitions. Word has length 687 [2025-01-09 00:03:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:59,658 INFO L471 AbstractCegarLoop]: Abstraction has 16826 states and 17286 transitions. [2025-01-09 00:03:59,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:03:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 16826 states and 17286 transitions. [2025-01-09 00:03:59,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2025-01-09 00:03:59,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:59,666 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:59,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:03:59,666 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:59,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:59,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1269354763, now seen corresponding path program 1 times [2025-01-09 00:03:59,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:59,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509573300] [2025-01-09 00:03:59,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:59,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 842 statements into 1 equivalence classes. [2025-01-09 00:03:59,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 842 of 842 statements. [2025-01-09 00:03:59,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:59,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 587 proven. 269 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-09 00:04:00,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:00,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509573300] [2025-01-09 00:04:00,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509573300] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:04:00,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228375183] [2025-01-09 00:04:00,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:00,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:04:00,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:04:00,888 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:04:00,889 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:04:00,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 842 statements into 1 equivalence classes. [2025-01-09 00:04:01,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 842 of 842 statements. [2025-01-09 00:04:01,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:01,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:01,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:04:01,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:04:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2025-01-09 00:04:01,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:04:01,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228375183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:01,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:04:01,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:04:01,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057914650] [2025-01-09 00:04:01,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:01,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:01,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:01,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:04:01,185 INFO L87 Difference]: Start difference. First operand 16826 states and 17286 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:04:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:02,042 INFO L93 Difference]: Finished difference Result 36951 states and 37943 transitions. [2025-01-09 00:04:02,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:02,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 842 [2025-01-09 00:04:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:02,062 INFO L225 Difference]: With dead ends: 36951 [2025-01-09 00:04:02,062 INFO L226 Difference]: Without dead ends: 20426 [2025-01-09 00:04:02,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 841 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:04:02,075 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 291 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:02,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 493 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:04:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20426 states. [2025-01-09 00:04:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20426 to 18325. [2025-01-09 00:04:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18325 states, 18324 states have (on average 1.0267408862693734) internal successors, (18814), 18324 states have internal predecessors, (18814), 0 states have call successors, (0), 0 states 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:04:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18325 states to 18325 states and 18814 transitions. [2025-01-09 00:04:02,245 INFO L78 Accepts]: Start accepts. Automaton has 18325 states and 18814 transitions. Word has length 842 [2025-01-09 00:04:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:02,245 INFO L471 AbstractCegarLoop]: Abstraction has 18325 states and 18814 transitions. [2025-01-09 00:04:02,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:04:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 18325 states and 18814 transitions. [2025-01-09 00:04:02,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2025-01-09 00:04:02,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:02,256 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:04:02,263 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:04:02,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:04:02,457 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:02,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1561414586, now seen corresponding path program 1 times [2025-01-09 00:04:02,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:02,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905261526] [2025-01-09 00:04:02,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:02,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 875 statements into 1 equivalence classes. [2025-01-09 00:04:02,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 875 of 875 statements. [2025-01-09 00:04:02,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:02,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2025-01-09 00:04:03,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:03,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905261526] [2025-01-09 00:04:03,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905261526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:03,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:03,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:04:03,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764968732] [2025-01-09 00:04:03,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:03,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:03,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:03,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:03,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:03,561 INFO L87 Difference]: Start difference. First operand 18325 states and 18814 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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:04:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:04,394 INFO L93 Difference]: Finished difference Result 40249 states and 41294 transitions. [2025-01-09 00:04:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:04,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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 875 [2025-01-09 00:04:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:04,423 INFO L225 Difference]: With dead ends: 40249 [2025-01-09 00:04:04,424 INFO L226 Difference]: Without dead ends: 21926 [2025-01-09 00:04:04,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:04,438 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 140 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:04,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 489 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:04:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21926 states. [2025-01-09 00:04:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21926 to 18023. [2025-01-09 00:04:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18023 states, 18022 states have (on average 1.0262456997003662) internal successors, (18495), 18022 states have internal predecessors, (18495), 0 states have call successors, (0), 0 states 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:04:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18023 states to 18023 states and 18495 transitions. [2025-01-09 00:04:04,623 INFO L78 Accepts]: Start accepts. Automaton has 18023 states and 18495 transitions. Word has length 875 [2025-01-09 00:04:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:04,623 INFO L471 AbstractCegarLoop]: Abstraction has 18023 states and 18495 transitions. [2025-01-09 00:04:04,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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:04:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 18023 states and 18495 transitions. [2025-01-09 00:04:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2025-01-09 00:04:04,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:04,633 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:04:04,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:04:04,634 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:04,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:04,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1445478501, now seen corresponding path program 1 times [2025-01-09 00:04:04,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:04,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560057597] [2025-01-09 00:04:04,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:04,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:04,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 879 statements into 1 equivalence classes. [2025-01-09 00:04:04,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 879 of 879 statements. [2025-01-09 00:04:04,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:04,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 661 proven. 269 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-09 00:04:05,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:05,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560057597] [2025-01-09 00:04:05,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560057597] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:04:05,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377544340] [2025-01-09 00:04:05,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:05,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:04:05,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:04:05,957 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:04:05,958 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:04:06,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 879 statements into 1 equivalence classes. [2025-01-09 00:04:06,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 879 of 879 statements. [2025-01-09 00:04:06,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:06,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:06,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:04:06,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:04:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-01-09 00:04:07,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:04:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377544340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:07,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:04:07,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:04:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611134591] [2025-01-09 00:04:07,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:07,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:07,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:07,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:07,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:04:07,026 INFO L87 Difference]: Start difference. First operand 18023 states and 18495 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:04:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:08,195 INFO L93 Difference]: Finished difference Result 39951 states and 41008 transitions. [2025-01-09 00:04:08,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:08,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 879 [2025-01-09 00:04:08,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:08,226 INFO L225 Difference]: With dead ends: 39951 [2025-01-09 00:04:08,226 INFO L226 Difference]: Without dead ends: 22229 [2025-01-09 00:04:08,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:04:08,238 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 313 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:08,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 420 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:04:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22229 states. [2025-01-09 00:04:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22229 to 18624. [2025-01-09 00:04:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18624 states, 18623 states have (on average 1.0274928851420286) internal successors, (19135), 18623 states have internal predecessors, (19135), 0 states have call successors, (0), 0 states 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:04:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18624 states to 18624 states and 19135 transitions. [2025-01-09 00:04:08,427 INFO L78 Accepts]: Start accepts. Automaton has 18624 states and 19135 transitions. Word has length 879 [2025-01-09 00:04:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:08,427 INFO L471 AbstractCegarLoop]: Abstraction has 18624 states and 19135 transitions. [2025-01-09 00:04:08,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:04:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 18624 states and 19135 transitions. [2025-01-09 00:04:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1001 [2025-01-09 00:04:08,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:08,439 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:04:08,448 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:04:08,639 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,SelfDestructingSolverStorable21 [2025-01-09 00:04:08,640 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:08,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:08,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1251850082, now seen corresponding path program 1 times [2025-01-09 00:04:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:08,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581785409] [2025-01-09 00:04:08,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:08,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:08,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1000 statements into 1 equivalence classes. [2025-01-09 00:04:08,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1000 of 1000 statements. [2025-01-09 00:04:08,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:08,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 1206 proven. 90 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2025-01-09 00:04:10,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:10,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581785409] [2025-01-09 00:04:10,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581785409] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:04:10,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433622000] [2025-01-09 00:04:10,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:10,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:04:10,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:04:10,270 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:04:10,273 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:04:10,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1000 statements into 1 equivalence classes. [2025-01-09 00:04:10,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1000 of 1000 statements. [2025-01-09 00:04:10,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:10,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:10,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 00:04:10,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:04:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 1088 proven. 374 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 00:04:11,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:04:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 808 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2025-01-09 00:04:11,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433622000] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:04:11,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:04:11,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 6] total 10 [2025-01-09 00:04:11,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550057156] [2025-01-09 00:04:11,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:11,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:04:11,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:11,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:04:11,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:04:11,493 INFO L87 Difference]: Start difference. First operand 18624 states and 19135 transitions. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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:04:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:12,614 INFO L93 Difference]: Finished difference Result 37850 states and 38887 transitions. [2025-01-09 00:04:12,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:04:12,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 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 1000 [2025-01-09 00:04:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:12,615 INFO L225 Difference]: With dead ends: 37850 [2025-01-09 00:04:12,615 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:04:12,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2005 GetRequests, 1997 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:04:12,629 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 621 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:12,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 52 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:04:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:04:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:04:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:04:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:04:12,630 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1000 [2025-01-09 00:04:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:12,630 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:04:12,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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:04:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:04:12,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:04:12,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:04:12,642 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:04:12,835 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,SelfDestructingSolverStorable22 [2025-01-09 00:04:12,839 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:04:12,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:04:15,915 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:04:15,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:04:15 BoogieIcfgContainer [2025-01-09 00:04:15,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:04:15,957 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:04:15,957 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:04:15,958 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:04:15,959 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:03:16" (3/4) ... [2025-01-09 00:04:15,961 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:04:15,998 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:04:16,000 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:04:16,002 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:04:16,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:04:16,208 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:04:16,209 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:04:16,209 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:04:16,210 INFO L158 Benchmark]: Toolchain (without parser) took 64323.27ms. Allocated memory was 167.8MB in the beginning and 671.1MB in the end (delta: 503.3MB). Free memory was 124.0MB in the beginning and 274.9MB in the end (delta: -151.0MB). Peak memory consumption was 356.4MB. Max. memory is 16.1GB. [2025-01-09 00:04:16,210 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:04:16,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 952.32ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 49.3MB in the end (delta: 74.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-01-09 00:04:16,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 241.41ms. Allocated memory is still 167.8MB. Free memory was 49.3MB in the beginning and 90.7MB in the end (delta: -41.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2025-01-09 00:04:16,210 INFO L158 Benchmark]: Boogie Preprocessor took 317.71ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 95.3MB in the end (delta: -4.6MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2025-01-09 00:04:16,211 INFO L158 Benchmark]: RCFGBuilder took 2742.31ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 94.4MB in the beginning and 177.7MB in the end (delta: -83.3MB). Peak memory consumption was 139.8MB. Max. memory is 16.1GB. [2025-01-09 00:04:16,211 INFO L158 Benchmark]: TraceAbstraction took 59810.13ms. Allocated memory was 268.4MB in the beginning and 671.1MB in the end (delta: 402.7MB). Free memory was 177.7MB in the beginning and 300.0MB in the end (delta: -122.3MB). Peak memory consumption was 420.3MB. Max. memory is 16.1GB. [2025-01-09 00:04:16,211 INFO L158 Benchmark]: Witness Printer took 251.54ms. Allocated memory is still 671.1MB. Free memory was 300.0MB in the beginning and 274.9MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:04:16,212 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 952.32ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 49.3MB in the end (delta: 74.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 241.41ms. Allocated memory is still 167.8MB. Free memory was 49.3MB in the beginning and 90.7MB in the end (delta: -41.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 317.71ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 95.3MB in the end (delta: -4.6MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * RCFGBuilder took 2742.31ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 94.4MB in the beginning and 177.7MB in the end (delta: -83.3MB). Peak memory consumption was 139.8MB. Max. memory is 16.1GB. * TraceAbstraction took 59810.13ms. Allocated memory was 268.4MB in the beginning and 671.1MB in the end (delta: 402.7MB). Free memory was 177.7MB in the beginning and 300.0MB in the end (delta: -122.3MB). Peak memory consumption was 420.3MB. Max. memory is 16.1GB. * Witness Printer took 251.54ms. Allocated memory is still 671.1MB. Free memory was 300.0MB in the beginning and 274.9MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 125]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.6s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 34.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9180 SdHoareTripleChecker+Valid, 31.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9180 mSDsluCounter, 9604 SdHoareTripleChecker+Invalid, 26.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1026 mSDsCounter, 4333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26630 IncrementalHoareTripleChecker+Invalid, 30963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4333 mSolverCounterUnsat, 8578 mSDtfsCounter, 26630 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6113 GetRequests, 6057 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18624occurred in iteration=22, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 29715 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 16478 NumberOfCodeBlocks, 16478 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 18047 ConstructedInterpolants, 0 QuantifiedInterpolants, 58172 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5292 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 20451/21648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0)) || (((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || (((((long long) 42 + a4) <= 0) && (a2 == 4)) && (0 <= ((long long) a29 + 143)))) || ((((0 <= ((long long) a29 + 600271)) && (((long long) 42 + a4) <= 0)) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || ((((0 <= ((long long) a29 + 600271)) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || ((((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (5 <= a2)) && (((long long) a0 + 61) <= 0))) || ((((0 <= ((long long) a29 + 600271)) && (((long long) 89 + a4) <= 0)) && (3 == a2)) && (((long long) a29 + 127) <= 0))) || (((0 <= ((long long) 41 + a29)) && (((long long) a4 + 86) <= 0)) && (3 == a2))) || (((((0 <= ((long long) a29 + 600271)) && (2 == a2)) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 127) <= 0))) || (((0 <= ((long long) 41 + a29)) && (5 <= a2)) && (((long long) a4 + 86) <= 0))) || (((((0 <= ((long long) a29 + 600271)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (a2 == 4))) || (((2 == a2) && (44 <= a29)) && (((long long) a0 + 61) <= 0))) || (((((0 <= ((long long) a29 + 600271)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || (((((long long) 42 + a4) <= 0) && (44 <= a29)) && (5 <= a2))) || ((((((long long) 42 + a4) <= 0) && (5 <= a2)) && (0 <= ((long long) a29 + 143))) && (((long long) a0 + 61) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((((long long) 42 + a4) <= 0) && (a2 == 1)) && (0 <= ((long long) a29 + 143))) && (a29 <= 401234))) || (((((long long) a4 + 86) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || (((((0 <= ((long long) a29 + 600271)) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a29 + 127) <= 0))) || ((((2 == a2) && (((long long) 89 + a4) <= 0)) || (((2 == a2) && (44 <= a29)) && (((long long) a4 + 86) <= 0))) && (0 <= ((long long) a29 + 143)))) || (((0 <= ((long long) a29 + 600271)) && (((long long) 89 + a4) <= 0)) && (a2 == 4))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 143))) && (((long long) a0 + 61) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:04:16,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE