./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label32.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/Problem14_label32.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 60c0fa34c18dde6742c3bd779d2643fe781c7455d58a961a280a354d3d1e679c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:58:25,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:58:25,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:58:25,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:58:25,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:58:25,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:58:25,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:58:25,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:58:25,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:58:25,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:58:25,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:58:25,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:58:25,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:58:25,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:58:25,828 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:58:25,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:58:25,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:58:25,829 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:58:25,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:58:25,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:58:25,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:58:25,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:58:25,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:58:25,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:58:25,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:58:25,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:58:25,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:58:25,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:58:25,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:58:25,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:58:25,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:58:25,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:58:25,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:58:25,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:58:25,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:58:25,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:58:25,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:58:25,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:58:25,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:58:25,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:58:25,831 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:58:25,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:58:25,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:58:25,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:58:25,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:58:25,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:58:25,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:58:25,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:58:25,831 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 -> 60c0fa34c18dde6742c3bd779d2643fe781c7455d58a961a280a354d3d1e679c [2025-01-08 23:58:26,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:58:26,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:58:26,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:58:26,013 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:58:26,013 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:58:26,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label32.c [2025-01-08 23:58:27,241 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38c5ec58a/a8ee5566fbce40c293c4109ce058d071/FLAG0207e565f [2025-01-08 23:58:27,559 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:58:27,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label32.c [2025-01-08 23:58:27,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38c5ec58a/a8ee5566fbce40c293c4109ce058d071/FLAG0207e565f [2025-01-08 23:58:27,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38c5ec58a/a8ee5566fbce40c293c4109ce058d071 [2025-01-08 23:58:27,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:58:27,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:58:27,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:58:27,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:58:27,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:58:27,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:58:27" (1/1) ... [2025-01-08 23:58:27,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626e5a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:27, skipping insertion in model container [2025-01-08 23:58:27,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:58:27" (1/1) ... [2025-01-08 23:58:27,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:58:28,000 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/Problem14_label32.c[5661,5674] [2025-01-08 23:58:28,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:58:28,135 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:58:28,148 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/Problem14_label32.c[5661,5674] [2025-01-08 23:58:28,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:58:28,249 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:58:28,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28 WrapperNode [2025-01-08 23:58:28,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:58:28,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:58:28,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:58:28,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:58:28,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,327 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-01-08 23:58:28,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:58:28,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:58:28,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:58:28,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:58:28,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,379 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:58:28,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:58:28,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:58:28,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:58:28,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:58:28,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (1/1) ... [2025-01-08 23:58:28,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:58:28,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:28,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:58:28,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:58:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:58:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:58:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:58:28,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:58:28,553 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:58:28,554 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:58:29,683 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-01-08 23:58:29,684 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:58:29,698 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:58:29,700 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:58:29,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:58:29 BoogieIcfgContainer [2025-01-08 23:58:29,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:58:29,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:58:29,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:58:29,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:58:29,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:58:27" (1/3) ... [2025-01-08 23:58:29,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f3a9f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:58:29, skipping insertion in model container [2025-01-08 23:58:29,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:28" (2/3) ... [2025-01-08 23:58:29,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f3a9f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:58:29, skipping insertion in model container [2025-01-08 23:58:29,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:58:29" (3/3) ... [2025-01-08 23:58:29,709 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label32.c [2025-01-08 23:58:29,720 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:58:29,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label32.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:58:29,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:58:29,785 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;@5d1d102e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:58:29,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:58:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-08 23:58:29,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:29,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:29,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:29,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash -257801140, now seen corresponding path program 1 times [2025-01-08 23:58:29,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:29,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503895253] [2025-01-08 23:58:29,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:29,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:29,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-08 23:58:29,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-08 23:58:29,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:29,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:30,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:30,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503895253] [2025-01-08 23:58:30,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503895253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:30,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:30,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:58:30,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427264652] [2025-01-08 23:58:30,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:30,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:30,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:30,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:30,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:30,144 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:30,850 INFO L93 Difference]: Finished difference Result 669 states and 1197 transitions. [2025-01-08 23:58:30,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:30,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-08 23:58:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:30,858 INFO L225 Difference]: With dead ends: 669 [2025-01-08 23:58:30,858 INFO L226 Difference]: Without dead ends: 360 [2025-01-08 23:58:30,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:30,862 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:30,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 94 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:58:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-08 23:58:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-01-08 23:58:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.5208913649025069) internal successors, (546), 359 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2025-01-08 23:58:30,900 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 55 [2025-01-08 23:58:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:30,900 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2025-01-08 23:58:30,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2025-01-08 23:58:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-08 23:58:30,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:30,903 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, 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-08 23:58:30,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:58:30,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:30,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash 638094677, now seen corresponding path program 1 times [2025-01-08 23:58:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:30,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223583766] [2025-01-08 23:58:30,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:30,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:30,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-08 23:58:30,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-08 23:58:30,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:30,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:31,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:31,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223583766] [2025-01-08 23:58:31,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223583766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:31,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:31,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:58:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376155157] [2025-01-08 23:58:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:31,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:31,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:31,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:31,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:31,092 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:31,716 INFO L93 Difference]: Finished difference Result 1074 states and 1633 transitions. [2025-01-08 23:58:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:31,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-01-08 23:58:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:31,720 INFO L225 Difference]: With dead ends: 1074 [2025-01-08 23:58:31,720 INFO L226 Difference]: Without dead ends: 716 [2025-01-08 23:58:31,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:31,721 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:31,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 95 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:58:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-08 23:58:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-01-08 23:58:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.353846153846154) internal successors, (968), 715 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2025-01-08 23:58:31,746 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 130 [2025-01-08 23:58:31,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:31,747 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2025-01-08 23:58:31,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2025-01-08 23:58:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-08 23:58:31,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:31,750 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, 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] [2025-01-08 23:58:31,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:58:31,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:31,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1317382689, now seen corresponding path program 1 times [2025-01-08 23:58:31,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:31,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26766967] [2025-01-08 23:58:31,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:31,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:31,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-08 23:58:31,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-08 23:58:31,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:31,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26766967] [2025-01-08 23:58:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26766967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:32,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:32,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:32,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534523340] [2025-01-08 23:58:32,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:32,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:32,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:32,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:32,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:32,060 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:32,839 INFO L93 Difference]: Finished difference Result 1964 states and 2564 transitions. [2025-01-08 23:58:32,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:32,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-01-08 23:58:32,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:32,843 INFO L225 Difference]: With dead ends: 1964 [2025-01-08 23:58:32,843 INFO L226 Difference]: Without dead ends: 1250 [2025-01-08 23:58:32,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:58:32,845 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 434 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:32,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 116 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:58:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-01-08 23:58:32,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2025-01-08 23:58:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.255404323458767) internal successors, (1568), 1249 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1568 transitions. [2025-01-08 23:58:32,881 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1568 transitions. Word has length 134 [2025-01-08 23:58:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:32,881 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1568 transitions. [2025-01-08 23:58:32,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1568 transitions. [2025-01-08 23:58:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-08 23:58:32,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:32,884 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:32,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:58:32,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:32,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:32,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1137229873, now seen corresponding path program 1 times [2025-01-08 23:58:32,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:32,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690338117] [2025-01-08 23:58:32,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:32,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:32,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-08 23:58:32,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-08 23:58:32,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:32,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-08 23:58:33,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:33,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690338117] [2025-01-08 23:58:33,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690338117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:33,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:33,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:58:33,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287060523] [2025-01-08 23:58:33,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:33,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:33,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:33,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:33,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:33,011 INFO L87 Difference]: Start difference. First operand 1250 states and 1568 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:33,503 INFO L93 Difference]: Finished difference Result 2676 states and 3487 transitions. [2025-01-08 23:58:33,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:33,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 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 200 [2025-01-08 23:58:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:33,508 INFO L225 Difference]: With dead ends: 2676 [2025-01-08 23:58:33,508 INFO L226 Difference]: Without dead ends: 1606 [2025-01-08 23:58:33,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:33,510 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:33,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:58:33,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-01-08 23:58:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-01-08 23:58:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.2330218068535825) internal successors, (1979), 1605 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1979 transitions. [2025-01-08 23:58:33,531 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1979 transitions. Word has length 200 [2025-01-08 23:58:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:33,532 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1979 transitions. [2025-01-08 23:58:33,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1979 transitions. [2025-01-08 23:58:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-08 23:58:33,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:33,534 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:33,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:58:33,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:33,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:33,535 INFO L85 PathProgramCache]: Analyzing trace with hash 391937324, now seen corresponding path program 1 times [2025-01-08 23:58:33,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:33,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455342764] [2025-01-08 23:58:33,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:33,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:33,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-08 23:58:33,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-08 23:58:33,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:33,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 23:58:33,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:33,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455342764] [2025-01-08 23:58:33,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455342764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:33,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:33,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:33,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335353921] [2025-01-08 23:58:33,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:33,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:33,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:33,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:33,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:33,725 INFO L87 Difference]: Start difference. First operand 1606 states and 1979 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:34,246 INFO L93 Difference]: Finished difference Result 3239 states and 4003 transitions. [2025-01-08 23:58:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:34,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 214 [2025-01-08 23:58:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:34,251 INFO L225 Difference]: With dead ends: 3239 [2025-01-08 23:58:34,251 INFO L226 Difference]: Without dead ends: 1784 [2025-01-08 23:58:34,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:34,253 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 110 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:34,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 113 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:58:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-01-08 23:58:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1606. [2025-01-08 23:58:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.145171339563863) internal successors, (1838), 1605 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1838 transitions. [2025-01-08 23:58:34,274 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1838 transitions. Word has length 214 [2025-01-08 23:58:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:34,274 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1838 transitions. [2025-01-08 23:58:34,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1838 transitions. [2025-01-08 23:58:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-01-08 23:58:34,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:34,276 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:34,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:58:34,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:34,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:34,277 INFO L85 PathProgramCache]: Analyzing trace with hash -238332120, now seen corresponding path program 1 times [2025-01-08 23:58:34,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:34,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156284106] [2025-01-08 23:58:34,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:34,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:34,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-08 23:58:34,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-08 23:58:34,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:34,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 187 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:34,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:34,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156284106] [2025-01-08 23:58:34,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156284106] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:34,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625196535] [2025-01-08 23:58:34,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:34,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:34,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:34,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:34,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:58:34,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-08 23:58:34,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-08 23:58:34,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:34,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:34,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:34,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-08 23:58:34,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:34,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625196535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:34,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:34,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755985886] [2025-01-08 23:58:34,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:34,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:34,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:34,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:34,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:34,774 INFO L87 Difference]: Start difference. First operand 1606 states and 1838 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:35,206 INFO L93 Difference]: Finished difference Result 3566 states and 4146 transitions. [2025-01-08 23:58:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:35,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 290 [2025-01-08 23:58:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:35,212 INFO L225 Difference]: With dead ends: 3566 [2025-01-08 23:58:35,212 INFO L226 Difference]: Without dead ends: 2140 [2025-01-08 23:58:35,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:35,214 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 126 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:35,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 257 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-01-08 23:58:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2025-01-08 23:58:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1327723235156615) internal successors, (2423), 2139 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2423 transitions. [2025-01-08 23:58:35,243 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2423 transitions. Word has length 290 [2025-01-08 23:58:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:35,243 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2423 transitions. [2025-01-08 23:58:35,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2423 transitions. [2025-01-08 23:58:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-01-08 23:58:35,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:35,247 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:35,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:58:35,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:35,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:35,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2051445957, now seen corresponding path program 1 times [2025-01-08 23:58:35,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:35,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88749822] [2025-01-08 23:58:35,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:35,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:35,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-08 23:58:35,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-08 23:58:35,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:35,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 237 proven. 130 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-08 23:58:36,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:36,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88749822] [2025-01-08 23:58:36,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88749822] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654112460] [2025-01-08 23:58:36,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:36,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:36,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:36,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:36,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:58:36,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-08 23:58:36,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-08 23:58:36,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:36,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:36,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:36,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-01-08 23:58:36,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654112460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:36,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:58:36,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229549873] [2025-01-08 23:58:36,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:36,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:36,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:36,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:36,241 INFO L87 Difference]: Start difference. First operand 2140 states and 2423 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:36,635 INFO L93 Difference]: Finished difference Result 4100 states and 4665 transitions. [2025-01-08 23:58:36,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:36,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 374 [2025-01-08 23:58:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:36,640 INFO L225 Difference]: With dead ends: 4100 [2025-01-08 23:58:36,640 INFO L226 Difference]: Without dead ends: 2140 [2025-01-08 23:58:36,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:36,642 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 137 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:36,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 227 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-01-08 23:58:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2025-01-08 23:58:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1112669471715755) internal successors, (2377), 2139 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2377 transitions. [2025-01-08 23:58:36,669 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2377 transitions. Word has length 374 [2025-01-08 23:58:36,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:36,670 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2377 transitions. [2025-01-08 23:58:36,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2377 transitions. [2025-01-08 23:58:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-01-08 23:58:36,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:36,673 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:36,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:58:36,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:36,876 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:36,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:36,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1279243052, now seen corresponding path program 1 times [2025-01-08 23:58:36,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:36,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009208303] [2025-01-08 23:58:36,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:36,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:36,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-01-08 23:58:36,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-01-08 23:58:36,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:36,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-01-08 23:58:37,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:37,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009208303] [2025-01-08 23:58:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009208303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:37,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903862053] [2025-01-08 23:58:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:37,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:37,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:37,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:37,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:37,073 INFO L87 Difference]: Start difference. First operand 2140 states and 2377 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:37,583 INFO L93 Difference]: Finished difference Result 4990 states and 5620 transitions. [2025-01-08 23:58:37,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:37,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 379 [2025-01-08 23:58:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:37,590 INFO L225 Difference]: With dead ends: 4990 [2025-01-08 23:58:37,590 INFO L226 Difference]: Without dead ends: 3030 [2025-01-08 23:58:37,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:37,593 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:37,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 63 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:58:37,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2025-01-08 23:58:37,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3030. [2025-01-08 23:58:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 3029 states have (on average 1.115549686365137) internal successors, (3379), 3029 states have internal predecessors, (3379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3379 transitions. [2025-01-08 23:58:37,635 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3379 transitions. Word has length 379 [2025-01-08 23:58:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:37,635 INFO L471 AbstractCegarLoop]: Abstraction has 3030 states and 3379 transitions. [2025-01-08 23:58:37,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3379 transitions. [2025-01-08 23:58:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-01-08 23:58:37,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:37,640 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:37,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:58:37,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:37,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:37,641 INFO L85 PathProgramCache]: Analyzing trace with hash 546804970, now seen corresponding path program 1 times [2025-01-08 23:58:37,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:37,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082150632] [2025-01-08 23:58:37,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:37,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:37,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-01-08 23:58:37,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-01-08 23:58:37,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:37,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:58:37,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:37,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082150632] [2025-01-08 23:58:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082150632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:37,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:37,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:37,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690602431] [2025-01-08 23:58:37,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:37,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:37,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:37,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:37,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:37,948 INFO L87 Difference]: Start difference. First operand 3030 states and 3379 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:38,340 INFO L93 Difference]: Finished difference Result 6414 states and 7191 transitions. [2025-01-08 23:58:38,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:38,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2025-01-08 23:58:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:38,349 INFO L225 Difference]: With dead ends: 6414 [2025-01-08 23:58:38,349 INFO L226 Difference]: Without dead ends: 3564 [2025-01-08 23:58:38,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:38,352 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:38,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 80 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2025-01-08 23:58:38,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2025-01-08 23:58:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.1083356721863598) internal successors, (3949), 3563 states have internal predecessors, (3949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3949 transitions. [2025-01-08 23:58:38,399 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3949 transitions. Word has length 439 [2025-01-08 23:58:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:38,400 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3949 transitions. [2025-01-08 23:58:38,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3949 transitions. [2025-01-08 23:58:38,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-01-08 23:58:38,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:38,405 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, 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, 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] [2025-01-08 23:58:38,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:58:38,405 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:38,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash -701802706, now seen corresponding path program 1 times [2025-01-08 23:58:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:38,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432728440] [2025-01-08 23:58:38,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:38,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-08 23:58:38,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-08 23:58:38,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:38,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 421 proven. 23 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-08 23:58:38,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:38,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432728440] [2025-01-08 23:58:38,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432728440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:38,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504126992] [2025-01-08 23:58:38,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:38,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:38,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:38,804 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-08 23:58:38,805 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-08 23:58:38,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-08 23:58:38,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-08 23:58:38,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:38,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:38,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:38,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-01-08 23:58:39,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:39,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504126992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:39,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:39,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:39,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545845077] [2025-01-08 23:58:39,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:39,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:39,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:39,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:39,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:39,107 INFO L87 Difference]: Start difference. First operand 3564 states and 3949 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:39,483 INFO L93 Difference]: Finished difference Result 4456 states and 4969 transitions. [2025-01-08 23:58:39,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:39,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 463 [2025-01-08 23:58:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:39,494 INFO L225 Difference]: With dead ends: 4456 [2025-01-08 23:58:39,494 INFO L226 Difference]: Without dead ends: 4454 [2025-01-08 23:58:39,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:39,496 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:39,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 12 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-01-08 23:58:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 3742. [2025-01-08 23:58:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.1130713712910987) internal successors, (4164), 3741 states have internal predecessors, (4164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4164 transitions. [2025-01-08 23:58:39,549 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4164 transitions. Word has length 463 [2025-01-08 23:58:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:39,551 INFO L471 AbstractCegarLoop]: Abstraction has 3742 states and 4164 transitions. [2025-01-08 23:58:39,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4164 transitions. [2025-01-08 23:58:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-01-08 23:58:39,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:39,579 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, 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, 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] [2025-01-08 23:58:39,585 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-08 23:58:39,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:39,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:39,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1025927309, now seen corresponding path program 1 times [2025-01-08 23:58:39,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:39,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085976408] [2025-01-08 23:58:39,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:39,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:39,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-01-08 23:58:39,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-01-08 23:58:39,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:39,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 579 proven. 23 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-01-08 23:58:40,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:40,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085976408] [2025-01-08 23:58:40,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085976408] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:40,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515032256] [2025-01-08 23:58:40,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:40,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:40,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:40,093 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-08 23:58:40,100 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-08 23:58:40,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-01-08 23:58:40,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-01-08 23:58:40,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:40,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:40,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:40,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2025-01-08 23:58:40,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:40,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515032256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:40,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:40,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163767114] [2025-01-08 23:58:40,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:40,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:40,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:40,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:40,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:40,294 INFO L87 Difference]: Start difference. First operand 3742 states and 4164 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:40,713 INFO L93 Difference]: Finished difference Result 7838 states and 8806 transitions. [2025-01-08 23:58:40,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:40,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 488 [2025-01-08 23:58:40,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:40,723 INFO L225 Difference]: With dead ends: 7838 [2025-01-08 23:58:40,723 INFO L226 Difference]: Without dead ends: 4276 [2025-01-08 23:58:40,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 487 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-08 23:58:40,727 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:40,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 79 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2025-01-08 23:58:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2025-01-08 23:58:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.1193556260678545) internal successors, (4586), 4097 states have internal predecessors, (4586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4586 transitions. [2025-01-08 23:58:40,778 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4586 transitions. Word has length 488 [2025-01-08 23:58:40,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:40,779 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4586 transitions. [2025-01-08 23:58:40,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4586 transitions. [2025-01-08 23:58:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-01-08 23:58:40,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:40,785 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, 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, 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] [2025-01-08 23:58:40,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 23:58:40,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-08 23:58:40,990 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:40,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash -127466288, now seen corresponding path program 1 times [2025-01-08 23:58:40,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:40,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75714294] [2025-01-08 23:58:40,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:40,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:41,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-01-08 23:58:41,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-01-08 23:58:41,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:41,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 612 proven. 23 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2025-01-08 23:58:41,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:41,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75714294] [2025-01-08 23:58:41,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75714294] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:41,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892073207] [2025-01-08 23:58:41,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:41,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:41,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:41,314 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-08 23:58:41,318 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-08 23:58:41,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-01-08 23:58:41,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-01-08 23:58:41,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:41,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:41,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:41,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-01-08 23:58:41,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:41,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892073207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:41,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:41,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:41,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125128675] [2025-01-08 23:58:41,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:41,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:41,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:41,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:41,513 INFO L87 Difference]: Start difference. First operand 4098 states and 4586 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:41,885 INFO L93 Difference]: Finished difference Result 5524 states and 6204 transitions. [2025-01-08 23:58:41,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:41,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 505 [2025-01-08 23:58:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:41,905 INFO L225 Difference]: With dead ends: 5524 [2025-01-08 23:58:41,905 INFO L226 Difference]: Without dead ends: 5522 [2025-01-08 23:58:41,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:41,907 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 146 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:41,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 12 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:41,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2025-01-08 23:58:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4098. [2025-01-08 23:58:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.1193556260678545) internal successors, (4586), 4097 states have internal predecessors, (4586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4586 transitions. [2025-01-08 23:58:41,963 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4586 transitions. Word has length 505 [2025-01-08 23:58:41,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:41,963 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4586 transitions. [2025-01-08 23:58:41,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4586 transitions. [2025-01-08 23:58:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-08 23:58:41,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:41,968 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, 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, 3, 3, 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] [2025-01-08 23:58:41,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 23:58:42,168 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,SelfDestructingSolverStorable11 [2025-01-08 23:58:42,169 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:42,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1190486021, now seen corresponding path program 1 times [2025-01-08 23:58:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135464322] [2025-01-08 23:58:42,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:42,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:42,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-08 23:58:42,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-08 23:58:42,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:42,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 634 proven. 23 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-01-08 23:58:42,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:42,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135464322] [2025-01-08 23:58:42,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135464322] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:42,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687672592] [2025-01-08 23:58:42,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:42,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:42,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:42,562 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-08 23:58:42,563 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-08 23:58:42,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-08 23:58:42,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-08 23:58:42,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:42,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:42,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:58:42,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-01-08 23:58:43,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:43,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687672592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:43,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:43,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:43,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77608347] [2025-01-08 23:58:43,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:43,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:43,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:43,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:43,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:43,243 INFO L87 Difference]: Start difference. First operand 4098 states and 4586 transitions. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:44,055 INFO L93 Difference]: Finished difference Result 8550 states and 9592 transitions. [2025-01-08 23:58:44,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:44,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 536 [2025-01-08 23:58:44,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:44,063 INFO L225 Difference]: With dead ends: 8550 [2025-01-08 23:58:44,063 INFO L226 Difference]: Without dead ends: 4632 [2025-01-08 23:58:44,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:44,067 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:44,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 51 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:58:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-01-08 23:58:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4098. [2025-01-08 23:58:44,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.1198437881376617) internal successors, (4588), 4097 states have internal predecessors, (4588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4588 transitions. [2025-01-08 23:58:44,104 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4588 transitions. Word has length 536 [2025-01-08 23:58:44,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:44,104 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4588 transitions. [2025-01-08 23:58:44,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:44,105 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4588 transitions. [2025-01-08 23:58:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-01-08 23:58:44,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:44,110 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, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:44,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-08 23:58:44,310 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,SelfDestructingSolverStorable12 [2025-01-08 23:58:44,311 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:44,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1746816548, now seen corresponding path program 1 times [2025-01-08 23:58:44,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:44,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007441103] [2025-01-08 23:58:44,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:44,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:44,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-01-08 23:58:44,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-01-08 23:58:44,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:44,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 796 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2025-01-08 23:58:44,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:44,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007441103] [2025-01-08 23:58:44,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007441103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:44,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:44,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:44,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333053950] [2025-01-08 23:58:44,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:44,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:44,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:44,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:44,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:44,542 INFO L87 Difference]: Start difference. First operand 4098 states and 4588 transitions. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:44,977 INFO L93 Difference]: Finished difference Result 8223 states and 9203 transitions. [2025-01-08 23:58:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:44,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 592 [2025-01-08 23:58:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:44,987 INFO L225 Difference]: With dead ends: 8223 [2025-01-08 23:58:44,987 INFO L226 Difference]: Without dead ends: 4098 [2025-01-08 23:58:44,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:44,990 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:44,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2025-01-08 23:58:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2025-01-08 23:58:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.083475713937027) internal successors, (4439), 4097 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4439 transitions. [2025-01-08 23:58:45,024 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4439 transitions. Word has length 592 [2025-01-08 23:58:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:45,024 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4439 transitions. [2025-01-08 23:58:45,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4439 transitions. [2025-01-08 23:58:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2025-01-08 23:58:45,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:45,030 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2025-01-08 23:58:45,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:58:45,030 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:45,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1695025987, now seen corresponding path program 1 times [2025-01-08 23:58:45,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:45,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989245139] [2025-01-08 23:58:45,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:45,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-01-08 23:58:45,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-01-08 23:58:45,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:45,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 940 proven. 11 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-01-08 23:58:45,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:45,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989245139] [2025-01-08 23:58:45,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989245139] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:45,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592352382] [2025-01-08 23:58:45,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:45,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:45,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:45,378 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:45,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 23:58:45,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-01-08 23:58:45,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-01-08 23:58:45,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:45,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:45,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:58:45,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2025-01-08 23:58:45,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:45,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592352382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:45,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:45,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:58:45,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537681145] [2025-01-08 23:58:45,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:45,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:45,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:45,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:45,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:45,852 INFO L87 Difference]: Start difference. First operand 4098 states and 4439 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:46,192 INFO L93 Difference]: Finished difference Result 9440 states and 10224 transitions. [2025-01-08 23:58:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:46,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 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 618 [2025-01-08 23:58:46,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:46,199 INFO L225 Difference]: With dead ends: 9440 [2025-01-08 23:58:46,200 INFO L226 Difference]: Without dead ends: 5344 [2025-01-08 23:58:46,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:46,203 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:46,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 50 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2025-01-08 23:58:46,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4988. [2025-01-08 23:58:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0802085422097454) internal successors, (5387), 4987 states have internal predecessors, (5387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5387 transitions. [2025-01-08 23:58:46,242 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5387 transitions. Word has length 618 [2025-01-08 23:58:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:46,242 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5387 transitions. [2025-01-08 23:58:46,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5387 transitions. [2025-01-08 23:58:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-01-08 23:58:46,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:46,249 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:46,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-08 23:58:46,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:46,450 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:46,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:46,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1622261925, now seen corresponding path program 1 times [2025-01-08 23:58:46,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:46,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570398947] [2025-01-08 23:58:46,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:46,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:46,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-01-08 23:58:46,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-01-08 23:58:46,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:46,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1724 backedges. 1196 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-01-08 23:58:46,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570398947] [2025-01-08 23:58:46,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570398947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:46,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:46,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:46,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110693650] [2025-01-08 23:58:46,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:46,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:46,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:46,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:46,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:46,845 INFO L87 Difference]: Start difference. First operand 4988 states and 5387 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:47,198 INFO L93 Difference]: Finished difference Result 9974 states and 10772 transitions. [2025-01-08 23:58:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:47,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 694 [2025-01-08 23:58:47,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:47,205 INFO L225 Difference]: With dead ends: 9974 [2025-01-08 23:58:47,205 INFO L226 Difference]: Without dead ends: 4988 [2025-01-08 23:58:47,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:47,209 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:47,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 242 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-01-08 23:58:47,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4276. [2025-01-08 23:58:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.08) internal successors, (4617), 4275 states have internal predecessors, (4617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4617 transitions. [2025-01-08 23:58:47,244 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4617 transitions. Word has length 694 [2025-01-08 23:58:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:47,245 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4617 transitions. [2025-01-08 23:58:47,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4617 transitions. [2025-01-08 23:58:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2025-01-08 23:58:47,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:47,251 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:58:47,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:58:47,252 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:47,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash -428826326, now seen corresponding path program 1 times [2025-01-08 23:58:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:47,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038182562] [2025-01-08 23:58:47,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:47,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:47,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 847 statements into 1 equivalence classes. [2025-01-08 23:58:47,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 847 of 847 statements. [2025-01-08 23:58:47,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:47,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2031 backedges. 1509 proven. 155 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-01-08 23:58:47,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038182562] [2025-01-08 23:58:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038182562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818785626] [2025-01-08 23:58:47,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:47,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:47,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:47,579 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:47,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 23:58:47,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 847 statements into 1 equivalence classes. [2025-01-08 23:58:47,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 847 of 847 statements. [2025-01-08 23:58:47,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:47,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:47,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:58:47,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2031 backedges. 1509 proven. 155 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-01-08 23:58:48,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:58:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2031 backedges. 1509 proven. 155 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-01-08 23:58:48,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818785626] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:58:48,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:58:48,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-08 23:58:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144678344] [2025-01-08 23:58:48,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:58:48,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 23:58:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:48,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 23:58:48,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:48,312 INFO L87 Difference]: Start difference. First operand 4276 states and 4617 transitions. Second operand has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:49,044 INFO L93 Difference]: Finished difference Result 10864 states and 11771 transitions. [2025-01-08 23:58:49,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:58:49,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 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 847 [2025-01-08 23:58:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:49,053 INFO L225 Difference]: With dead ends: 10864 [2025-01-08 23:58:49,054 INFO L226 Difference]: Without dead ends: 6590 [2025-01-08 23:58:49,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1696 GetRequests, 1692 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:49,058 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 53 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:49,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 60 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:58:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6590 states. [2025-01-08 23:58:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6590 to 5522. [2025-01-08 23:58:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5522 states, 5521 states have (on average 1.082412606411882) internal successors, (5976), 5521 states have internal predecessors, (5976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5976 transitions. [2025-01-08 23:58:49,102 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5976 transitions. Word has length 847 [2025-01-08 23:58:49,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:49,103 INFO L471 AbstractCegarLoop]: Abstraction has 5522 states and 5976 transitions. [2025-01-08 23:58:49,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5976 transitions. [2025-01-08 23:58:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2025-01-08 23:58:49,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:49,109 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 23:58:49,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-08 23:58:49,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-08 23:58:49,310 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:49,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash -724048646, now seen corresponding path program 1 times [2025-01-08 23:58:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:49,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824880113] [2025-01-08 23:58:49,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:49,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:49,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 849 statements into 1 equivalence classes. [2025-01-08 23:58:49,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 849 of 849 statements. [2025-01-08 23:58:49,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:49,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 1564 proven. 0 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2025-01-08 23:58:49,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:49,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824880113] [2025-01-08 23:58:49,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824880113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:49,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:49,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:49,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598388660] [2025-01-08 23:58:49,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:49,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:49,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:49,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:49,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:49,700 INFO L87 Difference]: Start difference. First operand 5522 states and 5976 transitions. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:50,064 INFO L93 Difference]: Finished difference Result 11042 states and 11950 transitions. [2025-01-08 23:58:50,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:50,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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 849 [2025-01-08 23:58:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:50,077 INFO L225 Difference]: With dead ends: 11042 [2025-01-08 23:58:50,077 INFO L226 Difference]: Without dead ends: 5522 [2025-01-08 23:58:50,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:50,084 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:50,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 241 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:50,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2025-01-08 23:58:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5166. [2025-01-08 23:58:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.0695062923523717) internal successors, (5524), 5165 states have internal predecessors, (5524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5524 transitions. [2025-01-08 23:58:50,120 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5524 transitions. Word has length 849 [2025-01-08 23:58:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:50,121 INFO L471 AbstractCegarLoop]: Abstraction has 5166 states and 5524 transitions. [2025-01-08 23:58:50,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5524 transitions. [2025-01-08 23:58:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2025-01-08 23:58:50,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:50,127 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:50,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:58:50,127 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:50,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1578298989, now seen corresponding path program 1 times [2025-01-08 23:58:50,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:50,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070384905] [2025-01-08 23:58:50,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:50,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:50,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 867 statements into 1 equivalence classes. [2025-01-08 23:58:50,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 867 of 867 statements. [2025-01-08 23:58:50,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:50,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 1696 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2025-01-08 23:58:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070384905] [2025-01-08 23:58:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070384905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:50,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:50,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:50,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62083187] [2025-01-08 23:58:50,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:50,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:50,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:50,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:50,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:50,611 INFO L87 Difference]: Start difference. First operand 5166 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:50,971 INFO L93 Difference]: Finished difference Result 10686 states and 11416 transitions. [2025-01-08 23:58:50,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:50,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 867 [2025-01-08 23:58:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:50,977 INFO L225 Difference]: With dead ends: 10686 [2025-01-08 23:58:50,978 INFO L226 Difference]: Without dead ends: 5522 [2025-01-08 23:58:50,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:50,982 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:50,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 65 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2025-01-08 23:58:51,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5344. [2025-01-08 23:58:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5344 states, 5343 states have (on average 1.0692494853078796) internal successors, (5713), 5343 states have internal predecessors, (5713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5713 transitions. [2025-01-08 23:58:51,025 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5713 transitions. Word has length 867 [2025-01-08 23:58:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:51,025 INFO L471 AbstractCegarLoop]: Abstraction has 5344 states and 5713 transitions. [2025-01-08 23:58:51,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5713 transitions. [2025-01-08 23:58:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 945 [2025-01-08 23:58:51,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:51,033 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:51,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 23:58:51,033 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:51,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 485013419, now seen corresponding path program 1 times [2025-01-08 23:58:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:51,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840879506] [2025-01-08 23:58:51,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:51,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:51,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 944 statements into 1 equivalence classes. [2025-01-08 23:58:51,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 944 of 944 statements. [2025-01-08 23:58:51,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:51,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2998 backedges. 1840 proven. 0 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2025-01-08 23:58:51,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:51,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840879506] [2025-01-08 23:58:51,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840879506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:51,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:51,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996667710] [2025-01-08 23:58:51,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:51,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:51,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:51,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:51,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:51,478 INFO L87 Difference]: Start difference. First operand 5344 states and 5713 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:51,851 INFO L93 Difference]: Finished difference Result 10864 states and 11603 transitions. [2025-01-08 23:58:51,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:51,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 944 [2025-01-08 23:58:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:51,857 INFO L225 Difference]: With dead ends: 10864 [2025-01-08 23:58:51,857 INFO L226 Difference]: Without dead ends: 5522 [2025-01-08 23:58:51,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:51,862 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 115 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:51,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 224 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2025-01-08 23:58:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5166. [2025-01-08 23:58:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.0528557599225556) internal successors, (5438), 5165 states have internal predecessors, (5438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5438 transitions. [2025-01-08 23:58:51,907 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5438 transitions. Word has length 944 [2025-01-08 23:58:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:51,907 INFO L471 AbstractCegarLoop]: Abstraction has 5166 states and 5438 transitions. [2025-01-08 23:58:51,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5438 transitions. [2025-01-08 23:58:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1019 [2025-01-08 23:58:51,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:51,916 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:51,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 23:58:51,916 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:51,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:51,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1057528440, now seen corresponding path program 1 times [2025-01-08 23:58:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:51,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342429497] [2025-01-08 23:58:51,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:51,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:51,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1018 statements into 1 equivalence classes. [2025-01-08 23:58:51,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1018 of 1018 statements. [2025-01-08 23:58:51,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:51,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3261 backedges. 1688 proven. 0 refuted. 0 times theorem prover too weak. 1573 trivial. 0 not checked. [2025-01-08 23:58:52,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:52,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342429497] [2025-01-08 23:58:52,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342429497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:52,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:58:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843471605] [2025-01-08 23:58:52,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:52,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:58:52,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:52,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:58:52,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:52,546 INFO L87 Difference]: Start difference. First operand 5166 states and 5438 transitions. Second operand has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:53,059 INFO L93 Difference]: Finished difference Result 10302 states and 10833 transitions. [2025-01-08 23:58:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:58:53,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 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 1018 [2025-01-08 23:58:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:53,064 INFO L225 Difference]: With dead ends: 10302 [2025-01-08 23:58:53,064 INFO L226 Difference]: Without dead ends: 4988 [2025-01-08 23:58:53,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:53,068 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 57 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:53,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 25 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:58:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-01-08 23:58:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4632. [2025-01-08 23:58:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0423234722522134) internal successors, (4827), 4631 states have internal predecessors, (4827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4827 transitions. [2025-01-08 23:58:53,104 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4827 transitions. Word has length 1018 [2025-01-08 23:58:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:53,105 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4827 transitions. [2025-01-08 23:58:53,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:53,105 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4827 transitions. [2025-01-08 23:58:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1090 [2025-01-08 23:58:53,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:53,113 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:53,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 23:58:53,113 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:53,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:53,114 INFO L85 PathProgramCache]: Analyzing trace with hash 158267181, now seen corresponding path program 1 times [2025-01-08 23:58:53,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:53,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617471141] [2025-01-08 23:58:53,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:53,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:53,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1089 statements into 1 equivalence classes. [2025-01-08 23:58:53,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1089 of 1089 statements. [2025-01-08 23:58:53,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:53,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3768 backedges. 1798 proven. 22 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2025-01-08 23:58:53,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:53,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617471141] [2025-01-08 23:58:53,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617471141] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:53,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783073466] [2025-01-08 23:58:53,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:53,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:53,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:53,675 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:53,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 23:58:53,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1089 statements into 1 equivalence classes. [2025-01-08 23:58:53,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1089 of 1089 statements. [2025-01-08 23:58:53,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:53,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:53,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:58:53,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3768 backedges. 1299 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2025-01-08 23:58:54,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783073466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:54,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:54,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:58:54,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054781997] [2025-01-08 23:58:54,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:54,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:54,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:54,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:54,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:54,303 INFO L87 Difference]: Start difference. First operand 4632 states and 4827 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:54,677 INFO L93 Difference]: Finished difference Result 9440 states and 9840 transitions. [2025-01-08 23:58:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:54,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 1089 [2025-01-08 23:58:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:54,681 INFO L225 Difference]: With dead ends: 9440 [2025-01-08 23:58:54,681 INFO L226 Difference]: Without dead ends: 4632 [2025-01-08 23:58:54,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1093 GetRequests, 1088 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:54,688 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 43 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:54,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 233 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-01-08 23:58:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4276. [2025-01-08 23:58:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0346198830409357) internal successors, (4423), 4275 states have internal predecessors, (4423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4423 transitions. [2025-01-08 23:58:54,716 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4423 transitions. Word has length 1089 [2025-01-08 23:58:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:54,717 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4423 transitions. [2025-01-08 23:58:54,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4423 transitions. [2025-01-08 23:58:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1099 [2025-01-08 23:58:54,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:54,724 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:54,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-08 23:58:54,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:54,925 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:54,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash 657594636, now seen corresponding path program 1 times [2025-01-08 23:58:54,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:54,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992006714] [2025-01-08 23:58:54,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:54,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:54,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1098 statements into 1 equivalence classes. [2025-01-08 23:58:54,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1098 of 1098 statements. [2025-01-08 23:58:54,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:54,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3786 backedges. 453 proven. 1412 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2025-01-08 23:58:55,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992006714] [2025-01-08 23:58:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992006714] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561308571] [2025-01-08 23:58:55,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:55,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:55,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:55,735 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:55,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 23:58:55,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1098 statements into 1 equivalence classes. [2025-01-08 23:58:55,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1098 of 1098 statements. [2025-01-08 23:58:55,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:55,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:55,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:55,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3786 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 3310 trivial. 0 not checked. [2025-01-08 23:58:56,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:56,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561308571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:56,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:56,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-08 23:58:56,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561866135] [2025-01-08 23:58:56,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:56,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:56,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:56,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:56,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:56,017 INFO L87 Difference]: Start difference. First operand 4276 states and 4423 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:56,372 INFO L93 Difference]: Finished difference Result 9616 states and 9934 transitions. [2025-01-08 23:58:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:56,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 1098 [2025-01-08 23:58:56,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:56,373 INFO L225 Difference]: With dead ends: 9616 [2025-01-08 23:58:56,373 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:58:56,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1098 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:56,375 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:56,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 234 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:58:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:58:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:58:56,376 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1098 [2025-01-08 23:58:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:56,376 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:58:56,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:58:56,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:58:56,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:58:56,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-08 23:58:56,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-08 23:58:56,582 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-08 23:58:56,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:58:56,976 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:58:56,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:58:56 BoogieIcfgContainer [2025-01-08 23:58:56,994 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:58:56,994 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:58:56,994 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:58:56,994 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:58:56,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:58:29" (3/4) ... [2025-01-08 23:58:56,997 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:58:57,010 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:58:57,011 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:58:57,011 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:58:57,012 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:58:57,113 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:58:57,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:58:57,114 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:58:57,114 INFO L158 Benchmark]: Toolchain (without parser) took 29296.20ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 121.4MB in the beginning and 784.1MB in the end (delta: -662.6MB). Peak memory consumption was 257.4MB. Max. memory is 16.1GB. [2025-01-08 23:58:57,114 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:58:57,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.90ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 90.3MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-08 23:58:57,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.48ms. Allocated memory is still 167.8MB. Free memory was 90.3MB in the beginning and 80.6MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:58:57,115 INFO L158 Benchmark]: Boogie Preprocessor took 117.59ms. Allocated memory is still 167.8MB. Free memory was 80.6MB in the beginning and 68.4MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:58:57,115 INFO L158 Benchmark]: RCFGBuilder took 1253.85ms. Allocated memory is still 167.8MB. Free memory was 68.4MB in the beginning and 114.3MB in the end (delta: -45.9MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2025-01-08 23:58:57,115 INFO L158 Benchmark]: TraceAbstraction took 27291.55ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 114.3MB in the beginning and 796.5MB in the end (delta: -682.2MB). Peak memory consumption was 241.0MB. Max. memory is 16.1GB. [2025-01-08 23:58:57,115 INFO L158 Benchmark]: Witness Printer took 119.51ms. Allocated memory is still 1.1GB. Free memory was 796.5MB in the beginning and 784.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:58:57,120 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.90ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 90.3MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.48ms. Allocated memory is still 167.8MB. Free memory was 90.3MB in the beginning and 80.6MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.59ms. Allocated memory is still 167.8MB. Free memory was 80.6MB in the beginning and 68.4MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1253.85ms. Allocated memory is still 167.8MB. Free memory was 68.4MB in the beginning and 114.3MB in the end (delta: -45.9MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * TraceAbstraction took 27291.55ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 114.3MB in the beginning and 796.5MB in the end (delta: -682.2MB). Peak memory consumption was 241.0MB. Max. memory is 16.1GB. * Witness Printer took 119.51ms. Allocated memory is still 1.1GB. Free memory was 796.5MB in the beginning and 784.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. 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: 179]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.8s, OverallIterations: 23, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2607 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2607 mSDsluCounter, 2647 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 1373 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12507 IncrementalHoareTripleChecker+Invalid, 13880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1373 mSolverCounterUnsat, 2507 mSDtfsCounter, 12507 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7229 GetRequests, 7163 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5522occurred in iteration=17, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 6764 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 19131 NumberOfCodeBlocks, 19131 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 19944 ConstructedInterpolants, 0 QuantifiedInterpolants, 58483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7857 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 34 InterpolantComputations, 22 PerfectInterpolantSequences, 44503/46658 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: 890]: Loop Invariant Derived loop invariant: (((((((((((((long long) a12 + 43) <= 0) && (a21 <= 7)) && (a15 <= 5)) || ((a21 == 8) && (a24 == 1))) || (((a12 <= 11) && (a24 == 1)) && (10 <= a21))) || ((a24 == 1) && (81 <= a12))) || (((7 <= a15) && (a24 == 1)) && (a15 <= 8))) || ((a24 == 1) && (a15 <= 5))) || (((a24 == 1) && (a15 <= 8)) && (10 <= a21))) || (((a12 <= 11) && (a24 == 1)) && (a15 <= 8))) || ((a24 == 1) && (a21 <= 7))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:58:57,139 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