./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/bitvector/soft_float_4-2a.c.cil.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:38:38,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:38:38,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:38:38,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:38:38,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:38:38,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:38:38,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:38:38,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:38:38,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:38:38,536 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:38:38,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:38:38,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:38:38,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:38:38,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:38:38,536 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:38:38,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:38:38,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:38:38,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:38:38,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:38:38,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:38:38,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:38:38,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:38:38,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:38:38,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:38:38,539 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:38:38,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:38:38,539 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:38:38,539 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:38:38,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:38:38,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:38:38,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:38:38,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:38:38,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:38,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:38:38,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:38:38,540 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:38:38,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:38:38,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:38:38,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:38:38,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:38:38,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:38:38,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:38:38,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:38:38,541 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2025-02-05 10:38:38,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:38:38,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:38:38,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:38:38,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:38:38,814 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:38:38,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-02-05 10:38:40,012 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fecedd7e/69b75366d32044b18008e44b8fdf6fae/FLAG165a0efe9 [2025-02-05 10:38:40,220 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:38:40,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-02-05 10:38:40,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fecedd7e/69b75366d32044b18008e44b8fdf6fae/FLAG165a0efe9 [2025-02-05 10:38:40,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fecedd7e/69b75366d32044b18008e44b8fdf6fae [2025-02-05 10:38:40,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:38:40,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:38:40,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:40,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:38:40,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:38:40,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f100305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40, skipping insertion in model container [2025-02-05 10:38:40,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:38:40,706 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/bitvector/soft_float_4-2a.c.cil.c[755,768] [2025-02-05 10:38:40,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:40,760 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:38:40,768 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/bitvector/soft_float_4-2a.c.cil.c[755,768] [2025-02-05 10:38:40,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:40,808 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:38:40,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40 WrapperNode [2025-02-05 10:38:40,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:40,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:40,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:38:40,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:38:40,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,834 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2025-02-05 10:38:40,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:40,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:38:40,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:38:40,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:38:40,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,859 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-02-05 10:38:40,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,865 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:38:40,871 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:38:40,871 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:38:40,871 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:38:40,872 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:40,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:40,897 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-02-05 10:38:40,899 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-02-05 10:38:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:38:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:38:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-05 10:38:40,914 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-05 10:38:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:38:40,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:38:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-02-05 10:38:40,914 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-02-05 10:38:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 10:38:40,914 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 10:38:40,966 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:38:40,968 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:38:41,210 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-02-05 10:38:41,210 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:38:41,233 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:38:41,234 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 10:38:41,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:41 BoogieIcfgContainer [2025-02-05 10:38:41,234 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:38:41,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:38:41,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:38:41,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:38:41,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:38:40" (1/3) ... [2025-02-05 10:38:41,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c31f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:41, skipping insertion in model container [2025-02-05 10:38:41,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (2/3) ... [2025-02-05 10:38:41,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c31f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:41, skipping insertion in model container [2025-02-05 10:38:41,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:41" (3/3) ... [2025-02-05 10:38:41,241 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2025-02-05 10:38:41,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:38:41,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-2a.c.cil.c that has 4 procedures, 79 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 10:38:41,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:38:41,295 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;@39c53ef6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:38:41,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:38:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 65 states have (on average 1.476923076923077) internal successors, (96), 67 states have internal predecessors, (96), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 10:38:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 10:38:41,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:41,308 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:41,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:41,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:41,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1157209505, now seen corresponding path program 1 times [2025-02-05 10:38:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:41,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623084865] [2025-02-05 10:38:41,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:41,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:41,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 10:38:41,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 10:38:41,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:41,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623084865] [2025-02-05 10:38:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623084865] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:41,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775960419] [2025-02-05 10:38:41,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:41,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:41,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:41,810 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-02-05 10:38:41,812 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-02-05 10:38:41,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 10:38:41,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 10:38:41,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:41,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:41,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 10:38:41,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:41,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:41,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775960419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:41,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:41,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 12 [2025-02-05 10:38:41,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526058314] [2025-02-05 10:38:41,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:41,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:38:41,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:41,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:38:41,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:38:41,960 INFO L87 Difference]: Start difference. First operand has 79 states, 65 states have (on average 1.476923076923077) internal successors, (96), 67 states have internal predecessors, (96), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:42,092 INFO L93 Difference]: Finished difference Result 175 states and 259 transitions. [2025-02-05 10:38:42,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:38:42,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-02-05 10:38:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:42,101 INFO L225 Difference]: With dead ends: 175 [2025-02-05 10:38:42,101 INFO L226 Difference]: Without dead ends: 92 [2025-02-05 10:38:42,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:38:42,106 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 14 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:42,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 640 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-05 10:38:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2025-02-05 10:38:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 72 states have internal predecessors, (94), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-02-05 10:38:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2025-02-05 10:38:42,140 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 35 [2025-02-05 10:38:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:42,140 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2025-02-05 10:38:42,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2025-02-05 10:38:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 10:38:42,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:42,143 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:38:42,150 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-02-05 10:38:42,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 10:38:42,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:42,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash 176819961, now seen corresponding path program 1 times [2025-02-05 10:38:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:42,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758210321] [2025-02-05 10:38:42,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:42,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 10:38:42,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 10:38:42,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:42,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:42,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:42,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758210321] [2025-02-05 10:38:42,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758210321] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:42,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249969362] [2025-02-05 10:38:42,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:42,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:42,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:42,544 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-02-05 10:38:42,546 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-02-05 10:38:42,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 10:38:42,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 10:38:42,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:42,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:42,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 10:38:42,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:42,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:42,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249969362] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:42,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:42,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-02-05 10:38:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076585305] [2025-02-05 10:38:42,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:42,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 10:38:42,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:42,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 10:38:42,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:38:42,746 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 10:38:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:42,912 INFO L93 Difference]: Finished difference Result 156 states and 209 transitions. [2025-02-05 10:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:38:42,913 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2025-02-05 10:38:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:42,914 INFO L225 Difference]: With dead ends: 156 [2025-02-05 10:38:42,914 INFO L226 Difference]: Without dead ends: 111 [2025-02-05 10:38:42,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:38:42,915 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 16 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:42,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1038 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-05 10:38:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2025-02-05 10:38:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 79 states have internal predecessors, (102), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-02-05 10:38:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2025-02-05 10:38:42,924 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 39 [2025-02-05 10:38:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:42,924 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2025-02-05 10:38:42,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 10:38:42,924 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2025-02-05 10:38:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 10:38:42,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:42,927 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:38:42,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:43,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:43,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:43,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash -448553990, now seen corresponding path program 1 times [2025-02-05 10:38:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:43,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322039021] [2025-02-05 10:38:43,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:43,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:43,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:43,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:43,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:43,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:43,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322039021] [2025-02-05 10:38:43,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322039021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:43,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:43,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 10:38:43,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012812269] [2025-02-05 10:38:43,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:43,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:38:43,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:43,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:38:43,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:38:43,269 INFO L87 Difference]: Start difference. First operand 95 states and 127 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:38:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:43,393 INFO L93 Difference]: Finished difference Result 178 states and 240 transitions. [2025-02-05 10:38:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:38:43,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2025-02-05 10:38:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:43,395 INFO L225 Difference]: With dead ends: 178 [2025-02-05 10:38:43,395 INFO L226 Difference]: Without dead ends: 138 [2025-02-05 10:38:43,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:38:43,396 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 85 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:43,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 717 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-05 10:38:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2025-02-05 10:38:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3425925925925926) internal successors, (145), 110 states have internal predecessors, (145), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-05 10:38:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2025-02-05 10:38:43,407 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 43 [2025-02-05 10:38:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:43,407 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2025-02-05 10:38:43,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:38:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2025-02-05 10:38:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 10:38:43,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:43,409 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:38:43,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:38:43,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:43,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash -645067495, now seen corresponding path program 1 times [2025-02-05 10:38:43,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:43,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119064038] [2025-02-05 10:38:43,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:43,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:43,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:43,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:43,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:43,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:43,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:43,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119064038] [2025-02-05 10:38:43,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119064038] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935505253] [2025-02-05 10:38:43,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:43,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:43,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:43,540 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-02-05 10:38:43,542 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-02-05 10:38:43,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:43,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:43,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:43,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:43,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 10:38:43,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:43,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:43,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935505253] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:43,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:43,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-02-05 10:38:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582618781] [2025-02-05 10:38:43,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:43,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:38:43,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:43,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:38:43,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:38:43,753 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 10:38:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:43,851 INFO L93 Difference]: Finished difference Result 224 states and 303 transitions. [2025-02-05 10:38:43,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:38:43,852 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2025-02-05 10:38:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:43,853 INFO L225 Difference]: With dead ends: 224 [2025-02-05 10:38:43,854 INFO L226 Difference]: Without dead ends: 153 [2025-02-05 10:38:43,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:38:43,855 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 17 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:43,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 815 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-05 10:38:43,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2025-02-05 10:38:43,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 117 states have internal predecessors, (152), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2025-02-05 10:38:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 187 transitions. [2025-02-05 10:38:43,872 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 187 transitions. Word has length 43 [2025-02-05 10:38:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:43,872 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 187 transitions. [2025-02-05 10:38:43,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 10:38:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 187 transitions. [2025-02-05 10:38:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:38:43,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:43,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:43,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:44,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:44,077 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:44,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:44,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2099863304, now seen corresponding path program 1 times [2025-02-05 10:38:44,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:44,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741519331] [2025-02-05 10:38:44,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:44,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:44,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:38:44,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:38:44,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:44,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:44,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:44,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741519331] [2025-02-05 10:38:44,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741519331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:44,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:44,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 10:38:44,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271321872] [2025-02-05 10:38:44,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:44,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:38:44,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:44,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:38:44,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:38:44,374 INFO L87 Difference]: Start difference. First operand 140 states and 187 transitions. Second operand has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 10:38:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:44,646 INFO L93 Difference]: Finished difference Result 203 states and 269 transitions. [2025-02-05 10:38:44,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 10:38:44,647 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2025-02-05 10:38:44,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:44,650 INFO L225 Difference]: With dead ends: 203 [2025-02-05 10:38:44,651 INFO L226 Difference]: Without dead ends: 195 [2025-02-05 10:38:44,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:38:44,653 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 52 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:44,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1238 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:38:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-05 10:38:44,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2025-02-05 10:38:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 120 states have internal predecessors, (156), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (20), 17 states have call predecessors, (20), 16 states have call successors, (20) [2025-02-05 10:38:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 193 transitions. [2025-02-05 10:38:44,672 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 193 transitions. Word has length 44 [2025-02-05 10:38:44,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:44,672 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 193 transitions. [2025-02-05 10:38:44,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 10:38:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 193 transitions. [2025-02-05 10:38:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 10:38:44,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:44,673 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:44,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:38:44,674 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:44,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash 724018591, now seen corresponding path program 2 times [2025-02-05 10:38:44,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:44,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419327246] [2025-02-05 10:38:44,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:44,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:44,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-05 10:38:44,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 43 statements. [2025-02-05 10:38:44,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 10:38:44,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:45,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419327246] [2025-02-05 10:38:45,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419327246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:45,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 10:38:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86321855] [2025-02-05 10:38:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 10:38:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:45,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 10:38:45,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:38:45,030 INFO L87 Difference]: Start difference. First operand 145 states and 193 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:45,325 INFO L93 Difference]: Finished difference Result 290 states and 389 transitions. [2025-02-05 10:38:45,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:38:45,325 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-02-05 10:38:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:45,328 INFO L225 Difference]: With dead ends: 290 [2025-02-05 10:38:45,328 INFO L226 Difference]: Without dead ends: 233 [2025-02-05 10:38:45,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:38:45,331 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 134 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:45,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1244 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:38:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-05 10:38:45,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 204. [2025-02-05 10:38:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 169 states have (on average 1.301775147928994) internal successors, (220), 172 states have internal predecessors, (220), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (29), 21 states have call predecessors, (29), 21 states have call successors, (29) [2025-02-05 10:38:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 271 transitions. [2025-02-05 10:38:45,342 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 271 transitions. Word has length 43 [2025-02-05 10:38:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:45,343 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 271 transitions. [2025-02-05 10:38:45,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 271 transitions. [2025-02-05 10:38:45,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 10:38:45,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:45,344 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:45,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:38:45,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:45,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:45,345 INFO L85 PathProgramCache]: Analyzing trace with hash 527505086, now seen corresponding path program 1 times [2025-02-05 10:38:45,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:45,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057767753] [2025-02-05 10:38:45,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:45,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:45,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:45,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:45,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:45,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:45,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:45,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057767753] [2025-02-05 10:38:45,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057767753] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:45,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696437247] [2025-02-05 10:38:45,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:45,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:45,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:45,482 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-02-05 10:38:45,484 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-02-05 10:38:45,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:45,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:45,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:45,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:45,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 10:38:45,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:45,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:45,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696437247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:45,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:45,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 17 [2025-02-05 10:38:45,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428772396] [2025-02-05 10:38:45,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:45,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:38:45,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:45,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:38:45,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:38:45,687 INFO L87 Difference]: Start difference. First operand 204 states and 271 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:45,892 INFO L93 Difference]: Finished difference Result 375 states and 508 transitions. [2025-02-05 10:38:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 10:38:45,892 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-02-05 10:38:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:45,894 INFO L225 Difference]: With dead ends: 375 [2025-02-05 10:38:45,894 INFO L226 Difference]: Without dead ends: 296 [2025-02-05 10:38:45,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:38:45,895 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 69 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:45,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1275 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:45,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-05 10:38:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 278. [2025-02-05 10:38:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 233 states have (on average 1.3047210300429184) internal successors, (304), 236 states have internal predecessors, (304), 29 states have call successors, (29), 13 states have call predecessors, (29), 15 states have return successors, (38), 28 states have call predecessors, (38), 28 states have call successors, (38) [2025-02-05 10:38:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 371 transitions. [2025-02-05 10:38:45,908 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 371 transitions. Word has length 43 [2025-02-05 10:38:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:45,909 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 371 transitions. [2025-02-05 10:38:45,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 371 transitions. [2025-02-05 10:38:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 10:38:45,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:45,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:45,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:38:46,114 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,SelfDestructingSolverStorable6 [2025-02-05 10:38:46,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:46,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1822368346, now seen corresponding path program 1 times [2025-02-05 10:38:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:46,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954219515] [2025-02-05 10:38:46,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:46,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 10:38:46,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 10:38:46,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:46,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 10:38:46,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:46,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954219515] [2025-02-05 10:38:46,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954219515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:46,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:46,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 10:38:46,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526765919] [2025-02-05 10:38:46,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:46,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:38:46,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:46,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:38:46,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:38:46,164 INFO L87 Difference]: Start difference. First operand 278 states and 371 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 10:38:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:46,212 INFO L93 Difference]: Finished difference Result 286 states and 378 transitions. [2025-02-05 10:38:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:38:46,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2025-02-05 10:38:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:46,214 INFO L225 Difference]: With dead ends: 286 [2025-02-05 10:38:46,214 INFO L226 Difference]: Without dead ends: 271 [2025-02-05 10:38:46,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:38:46,215 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:46,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 447 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-05 10:38:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-02-05 10:38:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 228 states have (on average 1.3070175438596492) internal successors, (298), 232 states have internal predecessors, (298), 27 states have call successors, (27), 13 states have call predecessors, (27), 15 states have return successors, (35), 25 states have call predecessors, (35), 26 states have call successors, (35) [2025-02-05 10:38:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 360 transitions. [2025-02-05 10:38:46,231 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 360 transitions. Word has length 46 [2025-02-05 10:38:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:46,232 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 360 transitions. [2025-02-05 10:38:46,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 10:38:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 360 transitions. [2025-02-05 10:38:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 10:38:46,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:46,233 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-02-05 10:38:46,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:38:46,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:46,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1366105921, now seen corresponding path program 1 times [2025-02-05 10:38:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:46,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819565918] [2025-02-05 10:38:46,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:46,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:46,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:38:46,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:38:46,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:46,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:46,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:46,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819565918] [2025-02-05 10:38:46,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819565918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:46,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:46,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 10:38:46,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792437677] [2025-02-05 10:38:46,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:46,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:38:46,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:46,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:38:46,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:38:46,345 INFO L87 Difference]: Start difference. First operand 271 states and 360 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:38:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:46,426 INFO L93 Difference]: Finished difference Result 290 states and 380 transitions. [2025-02-05 10:38:46,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:38:46,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-02-05 10:38:46,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:46,428 INFO L225 Difference]: With dead ends: 290 [2025-02-05 10:38:46,428 INFO L226 Difference]: Without dead ends: 250 [2025-02-05 10:38:46,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:38:46,429 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 11 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:46,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 710 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-05 10:38:46,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2025-02-05 10:38:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 203 states have (on average 1.29064039408867) internal successors, (262), 207 states have internal predecessors, (262), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (33), 23 states have call predecessors, (33), 24 states have call successors, (33) [2025-02-05 10:38:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 320 transitions. [2025-02-05 10:38:46,449 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 320 transitions. Word has length 47 [2025-02-05 10:38:46,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:46,449 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 320 transitions. [2025-02-05 10:38:46,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:38:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 320 transitions. [2025-02-05 10:38:46,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:38:46,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:46,450 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:46,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:38:46,451 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:46,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:46,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1966612445, now seen corresponding path program 1 times [2025-02-05 10:38:46,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:46,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032167571] [2025-02-05 10:38:46,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:46,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:46,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:46,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:46,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:46,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:46,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:46,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032167571] [2025-02-05 10:38:46,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032167571] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:46,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643319442] [2025-02-05 10:38:46,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:46,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:46,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:46,599 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-02-05 10:38:46,601 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-02-05 10:38:46,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:46,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:46,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:46,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:46,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 10:38:46,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:46,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:47,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643319442] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:47,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:47,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2025-02-05 10:38:47,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129743843] [2025-02-05 10:38:47,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:47,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 10:38:47,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:47,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 10:38:47,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2025-02-05 10:38:47,110 INFO L87 Difference]: Start difference. First operand 244 states and 320 transitions. Second operand has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 10:38:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:48,586 INFO L93 Difference]: Finished difference Result 457 states and 635 transitions. [2025-02-05 10:38:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-05 10:38:48,587 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2025-02-05 10:38:48,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:48,588 INFO L225 Difference]: With dead ends: 457 [2025-02-05 10:38:48,588 INFO L226 Difference]: Without dead ends: 432 [2025-02-05 10:38:48,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 10:38:48,592 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 238 mSDsluCounter, 3667 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 3849 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:48,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 3849 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:38:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-02-05 10:38:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 287. [2025-02-05 10:38:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 237 states have (on average 1.2784810126582278) internal successors, (303), 245 states have internal predecessors, (303), 29 states have call successors, (29), 12 states have call predecessors, (29), 20 states have return successors, (49), 29 states have call predecessors, (49), 28 states have call successors, (49) [2025-02-05 10:38:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 381 transitions. [2025-02-05 10:38:48,621 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 381 transitions. Word has length 48 [2025-02-05 10:38:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:48,622 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 381 transitions. [2025-02-05 10:38:48,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 10:38:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 381 transitions. [2025-02-05 10:38:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 10:38:48,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:48,623 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:38:48,633 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-02-05 10:38:48,823 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,SelfDestructingSolverStorable9 [2025-02-05 10:38:48,824 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:48,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2064032554, now seen corresponding path program 1 times [2025-02-05 10:38:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:48,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399166456] [2025-02-05 10:38:48,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:48,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:48,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:38:48,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:38:48,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:48,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:48,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399166456] [2025-02-05 10:38:48,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399166456] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:48,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24011816] [2025-02-05 10:38:48,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:48,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:48,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:48,848 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-02-05 10:38:48,850 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-02-05 10:38:48,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:38:48,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:38:48,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:48,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:48,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:48,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:38:48,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:48,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24011816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:48,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:48,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-02-05 10:38:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832913749] [2025-02-05 10:38:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:48,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:48,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:48,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:48,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:48,892 INFO L87 Difference]: Start difference. First operand 287 states and 381 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:48,927 INFO L93 Difference]: Finished difference Result 573 states and 763 transitions. [2025-02-05 10:38:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:48,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2025-02-05 10:38:48,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:48,929 INFO L225 Difference]: With dead ends: 573 [2025-02-05 10:38:48,929 INFO L226 Difference]: Without dead ends: 289 [2025-02-05 10:38:48,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-02-05 10:38:48,930 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:48,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 169 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-05 10:38:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2025-02-05 10:38:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 237 states have (on average 1.2742616033755274) internal successors, (302), 245 states have internal predecessors, (302), 29 states have call successors, (29), 12 states have call predecessors, (29), 20 states have return successors, (49), 29 states have call predecessors, (49), 28 states have call successors, (49) [2025-02-05 10:38:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 380 transitions. [2025-02-05 10:38:48,943 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 380 transitions. Word has length 47 [2025-02-05 10:38:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:48,943 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 380 transitions. [2025-02-05 10:38:48,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 380 transitions. [2025-02-05 10:38:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:38:48,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:48,944 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:48,950 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-02-05 10:38:49,144 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,SelfDestructingSolverStorable10 [2025-02-05 10:38:49,145 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:49,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1180266671, now seen corresponding path program 2 times [2025-02-05 10:38:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:49,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047486935] [2025-02-05 10:38:49,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:49,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:49,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-05 10:38:49,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:49,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:38:49,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:49,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:49,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047486935] [2025-02-05 10:38:49,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047486935] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:49,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309008779] [2025-02-05 10:38:49,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:49,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:49,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:49,345 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-02-05 10:38:49,347 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-02-05 10:38:49,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-05 10:38:49,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:49,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:38:49,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:49,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 10:38:49,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:49,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:49,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309008779] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:49,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:49,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 30 [2025-02-05 10:38:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133657729] [2025-02-05 10:38:49,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:49,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 10:38:49,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:49,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 10:38:49,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-02-05 10:38:49,818 INFO L87 Difference]: Start difference. First operand 287 states and 380 transitions. Second operand has 30 states, 28 states have (on average 2.0) internal successors, (56), 24 states have internal predecessors, (56), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-05 10:38:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:50,937 INFO L93 Difference]: Finished difference Result 455 states and 639 transitions. [2025-02-05 10:38:50,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-05 10:38:50,938 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.0) internal successors, (56), 24 states have internal predecessors, (56), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 48 [2025-02-05 10:38:50,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:50,940 INFO L225 Difference]: With dead ends: 455 [2025-02-05 10:38:50,940 INFO L226 Difference]: Without dead ends: 442 [2025-02-05 10:38:50,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=2705, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 10:38:50,941 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 266 mSDsluCounter, 2886 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:50,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 3067 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:38:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-02-05 10:38:50,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 300. [2025-02-05 10:38:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 245 states have (on average 1.2653061224489797) internal successors, (310), 253 states have internal predecessors, (310), 33 states have call successors, (33), 13 states have call predecessors, (33), 21 states have return successors, (63), 33 states have call predecessors, (63), 32 states have call successors, (63) [2025-02-05 10:38:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 406 transitions. [2025-02-05 10:38:50,961 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 406 transitions. Word has length 48 [2025-02-05 10:38:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:50,962 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 406 transitions. [2025-02-05 10:38:50,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.0) internal successors, (56), 24 states have internal predecessors, (56), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-05 10:38:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 406 transitions. [2025-02-05 10:38:50,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:38:50,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:50,963 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:38:50,970 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-02-05 10:38:51,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:51,168 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:51,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash 553092331, now seen corresponding path program 1 times [2025-02-05 10:38:51,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:51,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465794447] [2025-02-05 10:38:51,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:51,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:51,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:51,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:51,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:51,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:51,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:51,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465794447] [2025-02-05 10:38:51,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465794447] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:51,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773717899] [2025-02-05 10:38:51,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:51,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:51,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:51,222 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-02-05 10:38:51,224 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-02-05 10:38:51,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:51,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:51,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:51,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:51,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:38:51,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:38:51,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:51,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773717899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:51,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:51,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:38:51,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558752031] [2025-02-05 10:38:51,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:51,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:51,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:51,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:51,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:51,302 INFO L87 Difference]: Start difference. First operand 300 states and 406 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:51,338 INFO L93 Difference]: Finished difference Result 602 states and 820 transitions. [2025-02-05 10:38:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-02-05 10:38:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:51,340 INFO L225 Difference]: With dead ends: 602 [2025-02-05 10:38:51,341 INFO L226 Difference]: Without dead ends: 305 [2025-02-05 10:38:51,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:51,345 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 6 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:51,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 172 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-05 10:38:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 300. [2025-02-05 10:38:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 245 states have (on average 1.2612244897959184) internal successors, (309), 253 states have internal predecessors, (309), 33 states have call successors, (33), 13 states have call predecessors, (33), 21 states have return successors, (63), 33 states have call predecessors, (63), 32 states have call successors, (63) [2025-02-05 10:38:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 405 transitions. [2025-02-05 10:38:51,363 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 405 transitions. Word has length 48 [2025-02-05 10:38:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:51,363 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 405 transitions. [2025-02-05 10:38:51,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 405 transitions. [2025-02-05 10:38:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 10:38:51,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:51,365 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:38:51,374 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-02-05 10:38:51,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:51,565 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:51,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1147977236, now seen corresponding path program 1 times [2025-02-05 10:38:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:51,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777005600] [2025-02-05 10:38:51,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:51,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 10:38:51,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 10:38:51,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:51,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:51,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777005600] [2025-02-05 10:38:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777005600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:51,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 10:38:51,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152691588] [2025-02-05 10:38:51,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:51,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:38:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:51,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:38:51,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:38:51,709 INFO L87 Difference]: Start difference. First operand 300 states and 405 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:51,828 INFO L93 Difference]: Finished difference Result 475 states and 645 transitions. [2025-02-05 10:38:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:38:51,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-02-05 10:38:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:51,832 INFO L225 Difference]: With dead ends: 475 [2025-02-05 10:38:51,832 INFO L226 Difference]: Without dead ends: 311 [2025-02-05 10:38:51,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:38:51,833 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 61 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:51,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 805 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-02-05 10:38:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 300. [2025-02-05 10:38:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 245 states have (on average 1.2530612244897958) internal successors, (307), 253 states have internal predecessors, (307), 33 states have call successors, (33), 13 states have call predecessors, (33), 21 states have return successors, (63), 33 states have call predecessors, (63), 32 states have call successors, (63) [2025-02-05 10:38:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 403 transitions. [2025-02-05 10:38:51,847 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 403 transitions. Word has length 49 [2025-02-05 10:38:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:51,848 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 403 transitions. [2025-02-05 10:38:51,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 403 transitions. [2025-02-05 10:38:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:38:51,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:51,849 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-02-05 10:38:51,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 10:38:51,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:51,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:51,849 INFO L85 PathProgramCache]: Analyzing trace with hash 469437525, now seen corresponding path program 1 times [2025-02-05 10:38:51,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:51,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394223177] [2025-02-05 10:38:51,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:51,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:51,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:38:51,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:38:51,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:51,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:51,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:51,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394223177] [2025-02-05 10:38:51,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394223177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:51,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519359415] [2025-02-05 10:38:51,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:51,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:51,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:51,946 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-02-05 10:38:51,948 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-02-05 10:38:51,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:38:51,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:38:51,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:51,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:51,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-05 10:38:51,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:52,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:52,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519359415] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:52,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:52,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 23 [2025-02-05 10:38:52,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608200703] [2025-02-05 10:38:52,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:52,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 10:38:52,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:52,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 10:38:52,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-02-05 10:38:52,356 INFO L87 Difference]: Start difference. First operand 300 states and 403 transitions. Second operand has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 10:38:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:52,833 INFO L93 Difference]: Finished difference Result 462 states and 657 transitions. [2025-02-05 10:38:52,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 10:38:52,834 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 50 [2025-02-05 10:38:52,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:52,836 INFO L225 Difference]: With dead ends: 462 [2025-02-05 10:38:52,836 INFO L226 Difference]: Without dead ends: 426 [2025-02-05 10:38:52,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 10:38:52,837 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 193 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:52,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1361 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:38:52,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-02-05 10:38:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 302. [2025-02-05 10:38:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 245 states have (on average 1.2448979591836735) internal successors, (305), 255 states have internal predecessors, (305), 34 states have call successors, (34), 12 states have call predecessors, (34), 22 states have return successors, (77), 34 states have call predecessors, (77), 33 states have call successors, (77) [2025-02-05 10:38:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 416 transitions. [2025-02-05 10:38:52,858 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 416 transitions. Word has length 50 [2025-02-05 10:38:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:52,858 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 416 transitions. [2025-02-05 10:38:52,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 10:38:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 416 transitions. [2025-02-05 10:38:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 10:38:52,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:52,859 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:38:52,865 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-02-05 10:38:53,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:53,060 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:53,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:53,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1257308471, now seen corresponding path program 1 times [2025-02-05 10:38:53,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:53,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986095727] [2025-02-05 10:38:53,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:53,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 10:38:53,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 10:38:53,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:53,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:53,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:53,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986095727] [2025-02-05 10:38:53,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986095727] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:53,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037018256] [2025-02-05 10:38:53,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:53,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:53,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:53,134 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-02-05 10:38:53,135 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-02-05 10:38:53,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 10:38:53,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 10:38:53,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:53,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:53,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 10:38:53,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:53,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:53,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037018256] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:53,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:53,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2025-02-05 10:38:53,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066022708] [2025-02-05 10:38:53,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:53,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:38:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:53,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:38:53,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:38:53,360 INFO L87 Difference]: Start difference. First operand 302 states and 416 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 10:38:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:53,505 INFO L93 Difference]: Finished difference Result 437 states and 591 transitions. [2025-02-05 10:38:53,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 10:38:53,505 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2025-02-05 10:38:53,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:53,507 INFO L225 Difference]: With dead ends: 437 [2025-02-05 10:38:53,507 INFO L226 Difference]: Without dead ends: 360 [2025-02-05 10:38:53,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:38:53,508 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 172 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:53,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 853 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-05 10:38:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 340. [2025-02-05 10:38:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 278 states have (on average 1.2553956834532374) internal successors, (349), 290 states have internal predecessors, (349), 36 states have call successors, (36), 13 states have call predecessors, (36), 25 states have return successors, (77), 36 states have call predecessors, (77), 35 states have call successors, (77) [2025-02-05 10:38:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 462 transitions. [2025-02-05 10:38:53,528 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 462 transitions. Word has length 49 [2025-02-05 10:38:53,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:53,528 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 462 transitions. [2025-02-05 10:38:53,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 10:38:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 462 transitions. [2025-02-05 10:38:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 10:38:53,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:53,531 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:38:53,537 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-02-05 10:38:53,735 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,SelfDestructingSolverStorable15 [2025-02-05 10:38:53,735 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:53,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1453821976, now seen corresponding path program 2 times [2025-02-05 10:38:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920191638] [2025-02-05 10:38:53,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:53,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-05 10:38:53,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 49 statements. [2025-02-05 10:38:53,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 10:38:53,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:53,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:53,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920191638] [2025-02-05 10:38:53,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920191638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:53,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:53,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 10:38:53,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997980549] [2025-02-05 10:38:53,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:53,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 10:38:53,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:53,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 10:38:53,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:38:53,881 INFO L87 Difference]: Start difference. First operand 340 states and 462 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:53,965 INFO L93 Difference]: Finished difference Result 346 states and 467 transitions. [2025-02-05 10:38:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:38:53,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-02-05 10:38:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:53,967 INFO L225 Difference]: With dead ends: 346 [2025-02-05 10:38:53,967 INFO L226 Difference]: Without dead ends: 344 [2025-02-05 10:38:53,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:38:53,968 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 14 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:53,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 471 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:53,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-05 10:38:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-02-05 10:38:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 281 states have (on average 1.2526690391459074) internal successors, (352), 293 states have internal predecessors, (352), 36 states have call successors, (36), 14 states have call predecessors, (36), 26 states have return successors, (77), 36 states have call predecessors, (77), 35 states have call successors, (77) [2025-02-05 10:38:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 465 transitions. [2025-02-05 10:38:53,985 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 465 transitions. Word has length 49 [2025-02-05 10:38:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:53,985 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 465 transitions. [2025-02-05 10:38:53,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 465 transitions. [2025-02-05 10:38:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 10:38:53,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:53,987 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:53,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 10:38:53,988 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:53,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:53,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1099163510, now seen corresponding path program 1 times [2025-02-05 10:38:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:53,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296326692] [2025-02-05 10:38:53,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:53,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:53,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 10:38:53,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:38:53,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:53,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:54,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:54,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296326692] [2025-02-05 10:38:54,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296326692] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:54,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044217736] [2025-02-05 10:38:54,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:54,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:54,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:54,147 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:54,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 10:38:54,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 10:38:54,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:38:54,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:54,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:54,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 10:38:54,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:54,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:54,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044217736] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:54,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:54,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-02-05 10:38:54,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849135972] [2025-02-05 10:38:54,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:54,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 10:38:54,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:54,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 10:38:54,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2025-02-05 10:38:54,471 INFO L87 Difference]: Start difference. First operand 344 states and 465 transitions. Second operand has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 21 states have internal predecessors, (55), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 10:38:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:55,026 INFO L93 Difference]: Finished difference Result 410 states and 571 transitions. [2025-02-05 10:38:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 10:38:55,026 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 21 states have internal predecessors, (55), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2025-02-05 10:38:55,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:55,028 INFO L225 Difference]: With dead ends: 410 [2025-02-05 10:38:55,028 INFO L226 Difference]: Without dead ends: 378 [2025-02-05 10:38:55,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 10:38:55,029 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 137 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:55,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1809 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:38:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-05 10:38:55,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 330. [2025-02-05 10:38:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 271 states have (on average 1.2619926199261993) internal successors, (342), 282 states have internal predecessors, (342), 34 states have call successors, (34), 12 states have call predecessors, (34), 24 states have return successors, (73), 35 states have call predecessors, (73), 33 states have call successors, (73) [2025-02-05 10:38:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 449 transitions. [2025-02-05 10:38:55,044 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 449 transitions. Word has length 56 [2025-02-05 10:38:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:55,044 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 449 transitions. [2025-02-05 10:38:55,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 21 states have internal predecessors, (55), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 10:38:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 449 transitions. [2025-02-05 10:38:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 10:38:55,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:55,045 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:55,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:55,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 10:38:55,250 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:55,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:55,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1376227774, now seen corresponding path program 2 times [2025-02-05 10:38:55,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:55,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341532837] [2025-02-05 10:38:55,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:55,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-05 10:38:55,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:38:55,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:38:55,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:55,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:55,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341532837] [2025-02-05 10:38:55,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341532837] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:55,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352641636] [2025-02-05 10:38:55,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:55,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:55,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:55,773 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:55,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 10:38:55,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-05 10:38:55,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:38:55,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:38:55,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:55,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 10:38:55,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:56,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352641636] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:59,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:59,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 35 [2025-02-05 10:38:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810851862] [2025-02-05 10:38:59,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:59,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 10:38:59,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:59,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 10:38:59,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1101, Unknown=1, NotChecked=0, Total=1190 [2025-02-05 10:38:59,897 INFO L87 Difference]: Start difference. First operand 330 states and 449 transitions. Second operand has 35 states, 31 states have (on average 2.064516129032258) internal successors, (64), 29 states have internal predecessors, (64), 6 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 10:39:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:09,400 INFO L93 Difference]: Finished difference Result 401 states and 563 transitions. [2025-02-05 10:39:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-05 10:39:09,400 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 2.064516129032258) internal successors, (64), 29 states have internal predecessors, (64), 6 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) Word has length 56 [2025-02-05 10:39:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:09,402 INFO L225 Difference]: With dead ends: 401 [2025-02-05 10:39:09,402 INFO L226 Difference]: Without dead ends: 368 [2025-02-05 10:39:09,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=203, Invalid=2446, Unknown=3, NotChecked=0, Total=2652 [2025-02-05 10:39:09,403 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 124 mSDsluCounter, 2573 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:09,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 2687 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 10:39:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-05 10:39:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 322. [2025-02-05 10:39:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 264 states have (on average 1.268939393939394) internal successors, (335), 277 states have internal predecessors, (335), 33 states have call successors, (33), 10 states have call predecessors, (33), 24 states have return successors, (72), 34 states have call predecessors, (72), 32 states have call successors, (72) [2025-02-05 10:39:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 440 transitions. [2025-02-05 10:39:09,421 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 440 transitions. Word has length 56 [2025-02-05 10:39:09,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:09,421 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 440 transitions. [2025-02-05 10:39:09,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 2.064516129032258) internal successors, (64), 29 states have internal predecessors, (64), 6 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 10:39:09,422 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 440 transitions. [2025-02-05 10:39:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:39:09,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:09,423 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:09,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-05 10:39:09,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:09,624 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1520938285, now seen corresponding path program 1 times [2025-02-05 10:39:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:09,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045524103] [2025-02-05 10:39:09,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:09,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:09,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:39:09,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:39:09,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:09,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 10:39:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:09,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045524103] [2025-02-05 10:39:09,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045524103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:09,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:09,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:39:09,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781107612] [2025-02-05 10:39:09,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:09,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:39:09,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:09,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:39:09,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:39:09,689 INFO L87 Difference]: Start difference. First operand 322 states and 440 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 10:39:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:09,759 INFO L93 Difference]: Finished difference Result 363 states and 503 transitions. [2025-02-05 10:39:09,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:39:09,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2025-02-05 10:39:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:09,761 INFO L225 Difference]: With dead ends: 363 [2025-02-05 10:39:09,761 INFO L226 Difference]: Without dead ends: 361 [2025-02-05 10:39:09,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:39:09,762 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 11 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:09,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 333 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-05 10:39:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 341. [2025-02-05 10:39:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 277 states have (on average 1.2924187725631768) internal successors, (358), 295 states have internal predecessors, (358), 38 states have call successors, (38), 11 states have call predecessors, (38), 25 states have return successors, (77), 34 states have call predecessors, (77), 37 states have call successors, (77) [2025-02-05 10:39:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 473 transitions. [2025-02-05 10:39:09,785 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 473 transitions. Word has length 57 [2025-02-05 10:39:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:09,785 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 473 transitions. [2025-02-05 10:39:09,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 10:39:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 473 transitions. [2025-02-05 10:39:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 10:39:09,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:09,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 10:39:09,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 10:39:09,787 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:09,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash 47416840, now seen corresponding path program 1 times [2025-02-05 10:39:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:09,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508514647] [2025-02-05 10:39:09,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:09,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:09,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 10:39:09,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 10:39:09,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:09,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:39:09,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:09,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508514647] [2025-02-05 10:39:09,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508514647] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:39:09,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241222763] [2025-02-05 10:39:09,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:09,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:09,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:09,908 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:09,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 10:39:09,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 10:39:09,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 10:39:09,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:09,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:09,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 10:39:09,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 10:39:10,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:10,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241222763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:10,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:39:10,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 10:39:10,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423475389] [2025-02-05 10:39:10,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:10,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:39:10,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:10,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:39:10,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:39:10,009 INFO L87 Difference]: Start difference. First operand 341 states and 473 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:39:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:10,093 INFO L93 Difference]: Finished difference Result 635 states and 886 transitions. [2025-02-05 10:39:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:39:10,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2025-02-05 10:39:10,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:10,095 INFO L225 Difference]: With dead ends: 635 [2025-02-05 10:39:10,095 INFO L226 Difference]: Without dead ends: 476 [2025-02-05 10:39:10,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:39:10,097 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 23 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:10,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 346 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:10,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-02-05 10:39:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 346. [2025-02-05 10:39:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 282 states have (on average 1.2872340425531914) internal successors, (363), 300 states have internal predecessors, (363), 38 states have call successors, (38), 11 states have call predecessors, (38), 25 states have return successors, (77), 34 states have call predecessors, (77), 37 states have call successors, (77) [2025-02-05 10:39:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 478 transitions. [2025-02-05 10:39:10,119 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 478 transitions. Word has length 58 [2025-02-05 10:39:10,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:10,119 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 478 transitions. [2025-02-05 10:39:10,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:39:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 478 transitions. [2025-02-05 10:39:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 10:39:10,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:10,120 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 10:39:10,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-05 10:39:10,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:10,321 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:10,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:10,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1382606697, now seen corresponding path program 1 times [2025-02-05 10:39:10,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:10,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214062234] [2025-02-05 10:39:10,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:10,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:10,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 10:39:10,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 10:39:10,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:10,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 10:39:10,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:10,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214062234] [2025-02-05 10:39:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214062234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:10,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:10,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 10:39:10,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963474248] [2025-02-05 10:39:10,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:10,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:39:10,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:10,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:39:10,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:39:10,412 INFO L87 Difference]: Start difference. First operand 346 states and 478 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 10:39:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:10,497 INFO L93 Difference]: Finished difference Result 382 states and 531 transitions. [2025-02-05 10:39:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:39:10,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 59 [2025-02-05 10:39:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:10,499 INFO L225 Difference]: With dead ends: 382 [2025-02-05 10:39:10,499 INFO L226 Difference]: Without dead ends: 380 [2025-02-05 10:39:10,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:39:10,502 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:10,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 435 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-05 10:39:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 346. [2025-02-05 10:39:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 282 states have (on average 1.2872340425531914) internal successors, (363), 300 states have internal predecessors, (363), 38 states have call successors, (38), 11 states have call predecessors, (38), 25 states have return successors, (77), 34 states have call predecessors, (77), 37 states have call successors, (77) [2025-02-05 10:39:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 478 transitions. [2025-02-05 10:39:10,523 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 478 transitions. Word has length 59 [2025-02-05 10:39:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:10,523 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 478 transitions. [2025-02-05 10:39:10,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 10:39:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 478 transitions. [2025-02-05 10:39:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 10:39:10,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:10,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 10:39:10,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 10:39:10,524 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:10,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1784667207, now seen corresponding path program 1 times [2025-02-05 10:39:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6868900] [2025-02-05 10:39:10,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:10,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 10:39:10,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 10:39:10,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:10,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:39:10,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:10,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6868900] [2025-02-05 10:39:10,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6868900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:39:10,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523084310] [2025-02-05 10:39:10,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:10,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:10,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:10,663 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:10,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 10:39:10,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 10:39:10,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 10:39:10,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:10,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:10,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 10:39:10,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:39:10,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:10,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523084310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:10,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:39:10,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 14 [2025-02-05 10:39:10,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540600732] [2025-02-05 10:39:10,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:10,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:39:10,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:10,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:39:10,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:39:10,781 INFO L87 Difference]: Start difference. First operand 346 states and 478 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 10:39:10,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:10,927 INFO L93 Difference]: Finished difference Result 464 states and 634 transitions. [2025-02-05 10:39:10,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 10:39:10,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2025-02-05 10:39:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:10,929 INFO L225 Difference]: With dead ends: 464 [2025-02-05 10:39:10,929 INFO L226 Difference]: Without dead ends: 362 [2025-02-05 10:39:10,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:39:10,930 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 57 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:10,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 832 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-05 10:39:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 346. [2025-02-05 10:39:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 282 states have (on average 1.2801418439716312) internal successors, (361), 300 states have internal predecessors, (361), 38 states have call successors, (38), 11 states have call predecessors, (38), 25 states have return successors, (77), 34 states have call predecessors, (77), 37 states have call successors, (77) [2025-02-05 10:39:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 476 transitions. [2025-02-05 10:39:10,950 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 476 transitions. Word has length 59 [2025-02-05 10:39:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:10,950 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 476 transitions. [2025-02-05 10:39:10,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 10:39:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 476 transitions. [2025-02-05 10:39:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 10:39:10,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:10,951 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 10:39:10,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 10:39:11,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-05 10:39:11,152 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:11,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash -189254180, now seen corresponding path program 1 times [2025-02-05 10:39:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:11,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466281698] [2025-02-05 10:39:11,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:11,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 10:39:11,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 10:39:11,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:11,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 10:39:11,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 10:39:11,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 10:39:11,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 10:39:11,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:11,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 10:39:11,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 10:39:11,206 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 10:39:11,207 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:39:11,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 10:39:11,213 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:11,243 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:39:11,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:39:11 BoogieIcfgContainer [2025-02-05 10:39:11,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:39:11,248 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:39:11,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:39:11,248 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:39:11,249 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:41" (3/4) ... [2025-02-05 10:39:11,250 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 10:39:11,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:39:11,252 INFO L158 Benchmark]: Toolchain (without parser) took 30673.19ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 112.9MB in the beginning and 242.5MB in the end (delta: -129.6MB). Peak memory consumption was 137.6MB. Max. memory is 16.1GB. [2025-02-05 10:39:11,253 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:39:11,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.10ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.6MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:39:11,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.73ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:39:11,253 INFO L158 Benchmark]: Boogie Preprocessor took 35.61ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:39:11,253 INFO L158 Benchmark]: IcfgBuilder took 363.33ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 76.0MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 10:39:11,253 INFO L158 Benchmark]: TraceAbstraction took 30011.45ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 75.0MB in the beginning and 242.6MB in the end (delta: -167.6MB). Peak memory consumption was 104.1MB. Max. memory is 16.1GB. [2025-02-05 10:39:11,253 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 411.0MB. Free memory was 242.6MB in the beginning and 242.5MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:39:11,254 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.10ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.6MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.73ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.61ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 363.33ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 76.0MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 30011.45ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 75.0MB in the beginning and 242.6MB in the end (delta: -167.6MB). Peak memory consumption was 104.1MB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 411.0MB. Free memory was 242.6MB in the beginning and 242.5MB in the end (delta: 84.1kB). There was no memory consumed. 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 - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 114, overapproximation of bitwiseOr at line 111, overapproximation of bitwiseAnd at line 127. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add1 ; [L234] unsigned int r_add2 ; [L235] unsigned int zero ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int __retres14 ; VAL [ea=127, eb=127] [L242] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L242] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=127] [L242] zero = base2flt(0, 0) [L243] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=4328521728] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=4328521728, __retres4=4294967295, m=4328521728] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=4328521728, \result=4294967295, m=4328521728] [L243] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=127, ma=4328521728] [L243] a = base2flt(ma, ea) [L244] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L244] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432] [L244] b = base2flt(mb, eb) [L245] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=4294967295] [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L95] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=127, ma=16777215] [L111] EXPR ma | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=127] [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217, mb=16777215] [L114] EXPR mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217] [L114] mb = mb | (1U << 24U) [L115] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L115] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217, mb=-4278190080] [L116] delta = ea - eb VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, delta=0, ea=127, ma=16777217, mb=-4278190080] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, delta=0, ea=127, ma=16777217, mb=-4278190080] [L118] EXPR mb >> delta VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=16777217] [L118] mb = mb >> delta [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=-4261412863] [L127] ma & (1U << 25U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=-4261412863] [L127] COND FALSE !(ma & (1U << 25U)) [L140] CALL __VERIFIER_assert(ma < 1U << 25U) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L18] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.9s, OverallIterations: 24, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1850 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1720 mSDsluCounter, 25313 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22916 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8167 IncrementalHoareTripleChecker+Invalid, 8393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 2397 mSDtfsCounter, 8167 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1427 GetRequests, 1005 SyntacticMatches, 4 SemanticMatches, 418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2042 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=21, InterpolantAutomatonStates: 321, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 890 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 1856 NumberOfCodeBlocks, 1820 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2139 ConstructedInterpolants, 5 QuantifiedInterpolants, 4815 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2125 ConjunctsInSsa, 288 ConjunctsInUnsatCore, 45 InterpolantComputations, 15 PerfectInterpolantSequences, 722/849 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 10:39:11,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/soft_float_4-2a.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:39:13,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:39:13,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 10:39:13,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:39:13,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:39:13,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:39:13,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:39:13,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:39:13,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:39:13,190 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:39:13,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:39:13,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:39:13,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 10:39:13,191 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:39:13,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:39:13,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 10:39:13,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:39:13,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:39:13,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:39:13,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:39:13,195 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2025-02-05 10:39:13,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:39:13,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:39:13,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:39:13,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:39:13,467 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:39:13,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-02-05 10:39:14,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82e04aedd/13c67ecb12a3456899f52badf5665ae1/FLAG136ad4d4d [2025-02-05 10:39:14,933 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:39:14,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-02-05 10:39:14,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82e04aedd/13c67ecb12a3456899f52badf5665ae1/FLAG136ad4d4d [2025-02-05 10:39:14,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82e04aedd/13c67ecb12a3456899f52badf5665ae1 [2025-02-05 10:39:14,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:39:14,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:39:14,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:39:14,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:39:14,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:39:14,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:39:14" (1/1) ... [2025-02-05 10:39:14,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31039a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:14, skipping insertion in model container [2025-02-05 10:39:14,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:39:14" (1/1) ... [2025-02-05 10:39:14,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:39:15,100 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/bitvector/soft_float_4-2a.c.cil.c[755,768] [2025-02-05 10:39:15,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:39:15,162 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:39:15,171 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/bitvector/soft_float_4-2a.c.cil.c[755,768] [2025-02-05 10:39:15,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:39:15,209 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:39:15,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15 WrapperNode [2025-02-05 10:39:15,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:39:15,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:39:15,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:39:15,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:39:15,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (1/1) ... [2025-02-05 10:39:15,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (1/1) ... [2025-02-05 10:39:15,231 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-02-05 10:39:15,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:39:15,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:39:15,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:39:15,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:39:15,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (1/1) ... [2025-02-05 10:39:15,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (1/1) ... [2025-02-05 10:39:15,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (1/1) ... [2025-02-05 10:39:15,248 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-02-05 10:39:15,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (1/1) ... [2025-02-05 10:39:15,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (1/1) ... [2025-02-05 10:39:15,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (1/1) ... [2025-02-05 10:39:15,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (1/1) ... [2025-02-05 10:39:15,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (1/1) ... [2025-02-05 10:39:15,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (1/1) ... [2025-02-05 10:39:15,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:39:15,257 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:39:15,257 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:39:15,257 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:39:15,257 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (1/1) ... [2025-02-05 10:39:15,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:39:15,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:15,282 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-02-05 10:39:15,285 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-02-05 10:39:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:39:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 10:39:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-05 10:39:15,307 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-05 10:39:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:39:15,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:39:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-02-05 10:39:15,307 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-02-05 10:39:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 10:39:15,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 10:39:15,368 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:39:15,369 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:39:15,611 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-05 10:39:15,611 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:39:15,620 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:39:15,620 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:39:15,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:39:15 BoogieIcfgContainer [2025-02-05 10:39:15,621 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:39:15,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:39:15,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:39:15,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:39:15,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:39:14" (1/3) ... [2025-02-05 10:39:15,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11941bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:39:15, skipping insertion in model container [2025-02-05 10:39:15,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:15" (2/3) ... [2025-02-05 10:39:15,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11941bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:39:15, skipping insertion in model container [2025-02-05 10:39:15,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:39:15" (3/3) ... [2025-02-05 10:39:15,630 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2025-02-05 10:39:15,641 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:39:15,642 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-2a.c.cil.c that has 4 procedures, 55 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 10:39:15,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:39:15,685 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;@333ee917, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:39:15,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:39:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 10:39:15,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 10:39:15,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:15,696 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:15,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:15,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:15,699 INFO L85 PathProgramCache]: Analyzing trace with hash -449560281, now seen corresponding path program 1 times [2025-02-05 10:39:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390323246] [2025-02-05 10:39:15,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:15,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:15,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:15,718 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-02-05 10:39:15,719 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-02-05 10:39:15,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 10:39:15,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 10:39:15,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:15,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:15,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 10:39:15,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:39:15,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:39:15,990 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:15,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390323246] [2025-02-05 10:39:15,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390323246] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:39:15,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:39:15,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-02-05 10:39:15,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866827243] [2025-02-05 10:39:15,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:39:15,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:39:15,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:16,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:39:16,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:39:16,013 INFO L87 Difference]: Start difference. First operand has 55 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:39:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:16,165 INFO L93 Difference]: Finished difference Result 130 states and 192 transitions. [2025-02-05 10:39:16,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:39:16,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-02-05 10:39:16,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:16,173 INFO L225 Difference]: With dead ends: 130 [2025-02-05 10:39:16,174 INFO L226 Difference]: Without dead ends: 71 [2025-02-05 10:39:16,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:39:16,181 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 15 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:16,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 502 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:16,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-05 10:39:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2025-02-05 10:39:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.297872340425532) internal successors, (61), 49 states have internal predecessors, (61), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2025-02-05 10:39:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2025-02-05 10:39:16,213 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 31 [2025-02-05 10:39:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:16,213 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2025-02-05 10:39:16,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:39:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2025-02-05 10:39:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 10:39:16,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:16,215 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:39:16,221 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-02-05 10:39:16,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:16,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:16,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:16,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1422964749, now seen corresponding path program 1 times [2025-02-05 10:39:16,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:16,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1088334961] [2025-02-05 10:39:16,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:16,419 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-02-05 10:39:16,420 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-02-05 10:39:16,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 10:39:16,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 10:39:16,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:16,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:16,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 10:39:16,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:39:16,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:39:16,725 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:16,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088334961] [2025-02-05 10:39:16,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088334961] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 10:39:16,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:39:16,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 16 [2025-02-05 10:39:16,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236129913] [2025-02-05 10:39:16,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:16,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:39:16,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:16,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:39:16,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:39:16,726 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:16,824 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2025-02-05 10:39:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:39:16,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-02-05 10:39:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:16,830 INFO L225 Difference]: With dead ends: 127 [2025-02-05 10:39:16,830 INFO L226 Difference]: Without dead ends: 95 [2025-02-05 10:39:16,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:39:16,831 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 24 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:16,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 486 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-05 10:39:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2025-02-05 10:39:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 68 states have internal predecessors, (84), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-05 10:39:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2025-02-05 10:39:16,847 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 35 [2025-02-05 10:39:16,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:16,847 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2025-02-05 10:39:16,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2025-02-05 10:39:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 10:39:16,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:16,848 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:39:16,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:39:17,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:17,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:17,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1451593900, now seen corresponding path program 1 times [2025-02-05 10:39:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521665689] [2025-02-05 10:39:17,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:17,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:17,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:17,053 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-02-05 10:39:17,054 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-02-05 10:39:17,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 10:39:17,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 10:39:17,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:17,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:17,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 10:39:17,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:39:17,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:17,140 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:17,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521665689] [2025-02-05 10:39:17,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521665689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:17,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:17,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 10:39:17,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028822963] [2025-02-05 10:39:17,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:17,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:39:17,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:17,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:39:17,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:39:17,141 INFO L87 Difference]: Start difference. First operand 88 states and 115 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:17,198 INFO L93 Difference]: Finished difference Result 126 states and 164 transitions. [2025-02-05 10:39:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:39:17,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-02-05 10:39:17,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:17,200 INFO L225 Difference]: With dead ends: 126 [2025-02-05 10:39:17,200 INFO L226 Difference]: Without dead ends: 86 [2025-02-05 10:39:17,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:39:17,201 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:17,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 412 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:17,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-05 10:39:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2025-02-05 10:39:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 55 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-02-05 10:39:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-02-05 10:39:17,210 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 35 [2025-02-05 10:39:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-02-05 10:39:17,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-02-05 10:39:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 10:39:17,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:17,211 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:39:17,217 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-02-05 10:39:17,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:17,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:17,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:17,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1012685794, now seen corresponding path program 1 times [2025-02-05 10:39:17,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:17,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767649084] [2025-02-05 10:39:17,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:17,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:17,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:17,414 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-02-05 10:39:17,416 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-02-05 10:39:17,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 10:39:17,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 10:39:17,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:17,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:17,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 10:39:17,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:39:17,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:17,528 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:17,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767649084] [2025-02-05 10:39:17,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767649084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:17,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:17,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 10:39:17,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522427050] [2025-02-05 10:39:17,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:17,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:39:17,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:17,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:39:17,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:39:17,529 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:39:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:17,614 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2025-02-05 10:39:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:39:17,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2025-02-05 10:39:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:17,616 INFO L225 Difference]: With dead ends: 108 [2025-02-05 10:39:17,616 INFO L226 Difference]: Without dead ends: 85 [2025-02-05 10:39:17,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:39:17,617 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 13 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:17,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 493 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-05 10:39:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2025-02-05 10:39:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 61 states have internal predecessors, (74), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-05 10:39:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2025-02-05 10:39:17,631 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 39 [2025-02-05 10:39:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:17,631 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2025-02-05 10:39:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:39:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2025-02-05 10:39:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 10:39:17,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:17,632 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:17,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:39:17,839 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 [2025-02-05 10:39:17,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:17,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash 241285479, now seen corresponding path program 2 times [2025-02-05 10:39:17,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:17,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013259432] [2025-02-05 10:39:17,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:39:17,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:17,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:17,841 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-02-05 10:39:17,842 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-02-05 10:39:17,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-05 10:39:17,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 39 statements. [2025-02-05 10:39:17,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 10:39:17,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:17,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 10:39:17,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:39:18,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:18,019 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013259432] [2025-02-05 10:39:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013259432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 10:39:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890125891] [2025-02-05 10:39:18,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:18,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 10:39:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:18,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 10:39:18,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:39:18,020 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:18,233 INFO L93 Difference]: Finished difference Result 154 states and 200 transitions. [2025-02-05 10:39:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:39:18,233 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-02-05 10:39:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:18,234 INFO L225 Difference]: With dead ends: 154 [2025-02-05 10:39:18,235 INFO L226 Difference]: Without dead ends: 122 [2025-02-05 10:39:18,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:39:18,236 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 40 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:18,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 969 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:18,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-05 10:39:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2025-02-05 10:39:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 87 states have internal predecessors, (104), 16 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (23), 15 states have call predecessors, (23), 15 states have call successors, (23) [2025-02-05 10:39:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2025-02-05 10:39:18,248 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 143 transitions. Word has length 39 [2025-02-05 10:39:18,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:18,248 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 143 transitions. [2025-02-05 10:39:18,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2025-02-05 10:39:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 10:39:18,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:18,249 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:39:18,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:39:18,449 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 [2025-02-05 10:39:18,450 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:18,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash 295632954, now seen corresponding path program 1 times [2025-02-05 10:39:18,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:18,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659373511] [2025-02-05 10:39:18,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:18,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:18,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:18,452 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-02-05 10:39:18,453 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-02-05 10:39:18,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 10:39:18,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 10:39:18,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:18,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:18,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 10:39:18,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 10:39:26,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:43,159 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659373511] [2025-02-05 10:39:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659373511] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:39:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1192143712] [2025-02-05 10:39:43,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:43,160 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 10:39:43,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 10:39:43,161 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 10:39:43,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-02-05 10:39:43,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 10:39:43,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 10:39:43,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:43,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:43,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 10:39:43,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:39:43,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:39:43,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1192143712] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:39:43,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:39:43,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 15 [2025-02-05 10:39:43,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257442908] [2025-02-05 10:39:43,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:39:43,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:39:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:43,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:39:43,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=313, Unknown=13, NotChecked=0, Total=380 [2025-02-05 10:39:43,295 INFO L87 Difference]: Start difference. First operand 112 states and 143 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:39:45,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:46,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:48,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:54,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:55,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:40:03,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:40:05,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:40:07,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:40:09,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:40:10,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:40:13,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]