./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i --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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i -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 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:26:39,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:26:39,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:26:39,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:26:39,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:26:39,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:26:39,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:26:39,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:26:39,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:26:39,511 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:26:39,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:26:39,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:26:39,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:26:39,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:26:39,511 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:26:39,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:26:39,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:26:39,513 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:26:39,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:26:39,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:26:39,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:26:39,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:26:39,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:26:39,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:26:39,514 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:26:39,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:26:39,514 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:26:39,514 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:26:39,514 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:26:39,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:26:39,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:26:39,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:26:39,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:26:39,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:26:39,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:26:39,516 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:26:39,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:26:39,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:26:39,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:26:39,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:26:39,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:26:39,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:26:39,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:26:39,516 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 -> 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba [2025-02-05 22:26:39,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:26:39,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:26:39,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:26:39,759 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:26:39,759 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:26:39,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2025-02-05 22:26:40,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46c81ef41/3663738d0775414e9d282ab84628b196/FLAGbc7936be3 [2025-02-05 22:26:41,229 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:26:41,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2025-02-05 22:26:41,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46c81ef41/3663738d0775414e9d282ab84628b196/FLAGbc7936be3 [2025-02-05 22:26:41,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46c81ef41/3663738d0775414e9d282ab84628b196 [2025-02-05 22:26:41,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:26:41,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:26:41,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:26:41,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:26:41,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:26:41,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:26:41" (1/1) ... [2025-02-05 22:26:41,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50087bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41, skipping insertion in model container [2025-02-05 22:26:41,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:26:41" (1/1) ... [2025-02-05 22:26:41,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:26:41,383 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i[918,931] [2025-02-05 22:26:41,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:26:41,457 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:26:41,464 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i[918,931] [2025-02-05 22:26:41,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:26:41,500 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:26:41,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41 WrapperNode [2025-02-05 22:26:41,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:26:41,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:26:41,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:26:41,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:26:41,506 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:26:41" (1/1) ... [2025-02-05 22:26:41,512 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:26:41" (1/1) ... [2025-02-05 22:26:41,531 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-02-05 22:26:41,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:26:41,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:26:41,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:26:41,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:26:41,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41" (1/1) ... [2025-02-05 22:26:41,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41" (1/1) ... [2025-02-05 22:26:41,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41" (1/1) ... [2025-02-05 22:26:41,558 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 22:26:41,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41" (1/1) ... [2025-02-05 22:26:41,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41" (1/1) ... [2025-02-05 22:26:41,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41" (1/1) ... [2025-02-05 22:26:41,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41" (1/1) ... [2025-02-05 22:26:41,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41" (1/1) ... [2025-02-05 22:26:41,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41" (1/1) ... [2025-02-05 22:26:41,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:26:41,580 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:26:41,580 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:26:41,580 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:26:41,581 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41" (1/1) ... [2025-02-05 22:26:41,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:26:41,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:26:41,606 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 22:26:41,618 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 22:26:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:26:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:26:41,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:26:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:26:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:26:41,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:26:41,682 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:26:41,683 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:26:42,025 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-02-05 22:26:42,049 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 22:26:42,051 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:26:42,061 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:26:42,062 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:26:42,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:26:42 BoogieIcfgContainer [2025-02-05 22:26:42,062 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:26:42,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:26:42,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:26:42,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:26:42,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:26:41" (1/3) ... [2025-02-05 22:26:42,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c27c877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:26:42, skipping insertion in model container [2025-02-05 22:26:42,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:26:41" (2/3) ... [2025-02-05 22:26:42,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c27c877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:26:42, skipping insertion in model container [2025-02-05 22:26:42,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:26:42" (3/3) ... [2025-02-05 22:26:42,067 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2025-02-05 22:26:42,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:26:42,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:26:42,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:26:42,134 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;@79846096, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:26:42,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:26:42,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 22:26:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 22:26:42,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:26:42,152 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:26:42,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:26:42,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:26:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2064993240, now seen corresponding path program 1 times [2025-02-05 22:26:42,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:26:42,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946657335] [2025-02-05 22:26:42,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:42,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:26:42,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 22:26:42,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 22:26:42,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:42,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-05 22:26:42,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:26:42,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946657335] [2025-02-05 22:26:42,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946657335] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:26:42,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740318897] [2025-02-05 22:26:42,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:42,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:26:42,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:26:42,439 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 22:26:42,440 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 22:26:42,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 22:26:42,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 22:26:42,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:42,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:42,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:26:42,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:26:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-05 22:26:42,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:26:42,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740318897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:26:42,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:26:42,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:26:42,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366153664] [2025-02-05 22:26:42,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:26:42,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:26:42,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:26:42,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:26:42,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:26:42,648 INFO L87 Difference]: Start difference. First operand has 96 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 22:26:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:26:42,672 INFO L93 Difference]: Finished difference Result 186 states and 312 transitions. [2025-02-05 22:26:42,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:26:42,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2025-02-05 22:26:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:26:42,681 INFO L225 Difference]: With dead ends: 186 [2025-02-05 22:26:42,683 INFO L226 Difference]: Without dead ends: 93 [2025-02-05 22:26:42,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:26:42,690 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:26:42,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:26:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-05 22:26:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-05 22:26:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 72 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 22:26:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2025-02-05 22:26:42,725 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 137 [2025-02-05 22:26:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:26:42,725 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2025-02-05 22:26:42,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 22:26:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2025-02-05 22:26:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 22:26:42,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:26:42,728 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:26:42,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 22:26:42,932 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 22:26:42,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:26:42,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:26:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash 382117739, now seen corresponding path program 1 times [2025-02-05 22:26:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:26:42,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703529775] [2025-02-05 22:26:42,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:26:42,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 22:26:42,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 22:26:42,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:42,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 22:26:43,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:26:43,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703529775] [2025-02-05 22:26:43,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703529775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:26:43,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:26:43,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:26:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99795252] [2025-02-05 22:26:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:26:43,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:26:43,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:26:43,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:26:43,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:26:43,167 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:26:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:26:43,202 INFO L93 Difference]: Finished difference Result 184 states and 285 transitions. [2025-02-05 22:26:43,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:26:43,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2025-02-05 22:26:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:26:43,205 INFO L225 Difference]: With dead ends: 184 [2025-02-05 22:26:43,205 INFO L226 Difference]: Without dead ends: 94 [2025-02-05 22:26:43,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:26:43,206 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:26:43,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:26:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-05 22:26:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-05 22:26:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 22:26:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions. [2025-02-05 22:26:43,219 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 144 transitions. Word has length 137 [2025-02-05 22:26:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:26:43,220 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 144 transitions. [2025-02-05 22:26:43,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:26:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 144 transitions. [2025-02-05 22:26:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 22:26:43,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:26:43,222 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:26:43,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:26:43,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:26:43,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:26:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash 690116777, now seen corresponding path program 1 times [2025-02-05 22:26:43,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:26:43,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680437736] [2025-02-05 22:26:43,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:43,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:26:43,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:26:43,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:26:43,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:43,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 22:26:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:26:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680437736] [2025-02-05 22:26:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680437736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:26:43,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:26:43,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:26:43,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13927552] [2025-02-05 22:26:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:26:43,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:26:43,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:26:43,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:26:43,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:26:43,349 INFO L87 Difference]: Start difference. First operand 94 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:26:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:26:43,443 INFO L93 Difference]: Finished difference Result 253 states and 387 transitions. [2025-02-05 22:26:43,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:26:43,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-02-05 22:26:43,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:26:43,445 INFO L225 Difference]: With dead ends: 253 [2025-02-05 22:26:43,445 INFO L226 Difference]: Without dead ends: 162 [2025-02-05 22:26:43,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:26:43,447 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 99 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:26:43,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 274 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:26:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-05 22:26:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2025-02-05 22:26:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 125 states have internal predecessors, (176), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 22:26:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 240 transitions. [2025-02-05 22:26:43,462 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 240 transitions. Word has length 138 [2025-02-05 22:26:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:26:43,462 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 240 transitions. [2025-02-05 22:26:43,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:26:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 240 transitions. [2025-02-05 22:26:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 22:26:43,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:26:43,464 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:26:43,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:26:43,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:26:43,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:26:43,464 INFO L85 PathProgramCache]: Analyzing trace with hash 179582600, now seen corresponding path program 1 times [2025-02-05 22:26:43,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:26:43,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083781702] [2025-02-05 22:26:43,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:43,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:26:43,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:26:43,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:26:43,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:43,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 22:26:46,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:26:46,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083781702] [2025-02-05 22:26:46,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083781702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:26:46,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197689115] [2025-02-05 22:26:46,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:46,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:26:46,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:26:46,409 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 22:26:46,410 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 22:26:46,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:26:46,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:26:46,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:46,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:46,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 22:26:46,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:26:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 22:26:47,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:26:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197689115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:26:47,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:26:47,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-02-05 22:26:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015202484] [2025-02-05 22:26:47,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:26:47,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:26:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:26:47,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:26:47,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-05 22:26:47,364 INFO L87 Difference]: Start difference. First operand 159 states and 240 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:26:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:26:47,839 INFO L93 Difference]: Finished difference Result 663 states and 995 transitions. [2025-02-05 22:26:47,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:26:47,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-02-05 22:26:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:26:47,843 INFO L225 Difference]: With dead ends: 663 [2025-02-05 22:26:47,843 INFO L226 Difference]: Without dead ends: 507 [2025-02-05 22:26:47,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-02-05 22:26:47,845 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 335 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:26:47,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 639 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:26:47,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-02-05 22:26:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 412. [2025-02-05 22:26:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 365 states have (on average 1.4958904109589042) internal successors, (546), 368 states have internal predecessors, (546), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 22:26:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 630 transitions. [2025-02-05 22:26:47,870 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 630 transitions. Word has length 138 [2025-02-05 22:26:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:26:47,870 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 630 transitions. [2025-02-05 22:26:47,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:26:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 630 transitions. [2025-02-05 22:26:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 22:26:47,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:26:47,873 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:26:47,884 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 22:26:48,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:26:48,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:26:48,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:26:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash 385617376, now seen corresponding path program 1 times [2025-02-05 22:26:48,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:26:48,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608087687] [2025-02-05 22:26:48,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:26:48,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:26:48,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:26:48,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:48,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 22:26:51,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:26:51,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608087687] [2025-02-05 22:26:51,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608087687] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:26:51,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234907861] [2025-02-05 22:26:51,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:51,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:26:51,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:26:51,902 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 22:26:51,904 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 22:26:51,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:26:51,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:26:51,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:51,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:51,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 22:26:51,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:26:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 242 proven. 54 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-02-05 22:26:52,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:26:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 22:26:52,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234907861] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:26:52,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:26:52,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 23 [2025-02-05 22:26:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048195950] [2025-02-05 22:26:52,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:26:52,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 22:26:52,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:26:52,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 22:26:52,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-02-05 22:26:52,557 INFO L87 Difference]: Start difference. First operand 412 states and 630 transitions. Second operand has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) [2025-02-05 22:26:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:26:54,714 INFO L93 Difference]: Finished difference Result 900 states and 1349 transitions. [2025-02-05 22:26:54,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 22:26:54,715 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) Word has length 138 [2025-02-05 22:26:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:26:54,718 INFO L225 Difference]: With dead ends: 900 [2025-02-05 22:26:54,718 INFO L226 Difference]: Without dead ends: 491 [2025-02-05 22:26:54,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 22:26:54,721 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1037 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:26:54,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 555 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 22:26:54,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-02-05 22:26:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 313. [2025-02-05 22:26:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 274 states have (on average 1.467153284671533) internal successors, (402), 275 states have internal predecessors, (402), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 22:26:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 466 transitions. [2025-02-05 22:26:54,745 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 466 transitions. Word has length 138 [2025-02-05 22:26:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:26:54,745 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 466 transitions. [2025-02-05 22:26:54,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) [2025-02-05 22:26:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 466 transitions. [2025-02-05 22:26:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 22:26:54,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:26:54,747 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:26:54,754 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 22:26:54,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:26:54,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:26:54,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:26:54,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1630381857, now seen corresponding path program 1 times [2025-02-05 22:26:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:26:54,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135546208] [2025-02-05 22:26:54,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:54,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:26:54,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:26:54,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:26:54,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:54,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 22:26:57,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:26:57,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135546208] [2025-02-05 22:26:57,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135546208] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:26:57,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58736469] [2025-02-05 22:26:57,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:57,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:26:57,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:26:57,126 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 22:26:57,127 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 22:26:57,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:26:57,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:26:57,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:57,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:57,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 22:26:57,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:26:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-02-05 22:26:58,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:26:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 22:26:59,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58736469] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 22:26:59,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:26:59,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 14] total 28 [2025-02-05 22:26:59,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625188917] [2025-02-05 22:26:59,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:26:59,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:26:59,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:26:59,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:26:59,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2025-02-05 22:26:59,256 INFO L87 Difference]: Start difference. First operand 313 states and 466 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:01,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-02-05 22:27:03,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-02-05 22:27:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:27:03,413 INFO L93 Difference]: Finished difference Result 1059 states and 1559 transitions. [2025-02-05 22:27:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:27:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-02-05 22:27:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:27:03,417 INFO L225 Difference]: With dead ends: 1059 [2025-02-05 22:27:03,417 INFO L226 Difference]: Without dead ends: 749 [2025-02-05 22:27:03,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2025-02-05 22:27:03,418 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 483 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:27:03,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 668 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-05 22:27:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-02-05 22:27:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 319. [2025-02-05 22:27:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 280 states have (on average 1.4642857142857142) internal successors, (410), 281 states have internal predecessors, (410), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 22:27:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 474 transitions. [2025-02-05 22:27:03,433 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 474 transitions. Word has length 138 [2025-02-05 22:27:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:27:03,433 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 474 transitions. [2025-02-05 22:27:03,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 474 transitions. [2025-02-05 22:27:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 22:27:03,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:27:03,434 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:27:03,442 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 22:27:03,638 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,SelfDestructingSolverStorable5 [2025-02-05 22:27:03,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:27:03,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:27:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash 210602407, now seen corresponding path program 1 times [2025-02-05 22:27:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:27:03,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421188424] [2025-02-05 22:27:03,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:27:03,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:27:03,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:27:03,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:03,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 22:27:05,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:27:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421188424] [2025-02-05 22:27:05,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421188424] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:27:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554212386] [2025-02-05 22:27:05,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:05,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:27:05,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:27:05,500 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 22:27:05,504 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 22:27:05,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:27:05,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:27:05,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:05,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:05,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 22:27:05,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:27:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 22:27:05,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:27:05,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554212386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:27:05,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:27:05,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 16 [2025-02-05 22:27:05,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734433907] [2025-02-05 22:27:05,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:27:05,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:27:05,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:27:05,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:27:05,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:27:05,780 INFO L87 Difference]: Start difference. First operand 319 states and 474 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:27:06,104 INFO L93 Difference]: Finished difference Result 844 states and 1243 transitions. [2025-02-05 22:27:06,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:27:06,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-02-05 22:27:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:27:06,107 INFO L225 Difference]: With dead ends: 844 [2025-02-05 22:27:06,107 INFO L226 Difference]: Without dead ends: 528 [2025-02-05 22:27:06,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:27:06,109 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 166 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:27:06,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 522 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:27:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-05 22:27:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 361. [2025-02-05 22:27:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 322 states have (on average 1.4782608695652173) internal successors, (476), 323 states have internal predecessors, (476), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 22:27:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 540 transitions. [2025-02-05 22:27:06,133 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 540 transitions. Word has length 138 [2025-02-05 22:27:06,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:27:06,134 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 540 transitions. [2025-02-05 22:27:06,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 540 transitions. [2025-02-05 22:27:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 22:27:06,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:27:06,135 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:27:06,144 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 22:27:06,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:27:06,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:27:06,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:27:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash -75153945, now seen corresponding path program 1 times [2025-02-05 22:27:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:27:06,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475199741] [2025-02-05 22:27:06,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:27:06,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:27:06,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:27:06,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:06,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 22:27:06,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:27:06,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475199741] [2025-02-05 22:27:06,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475199741] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:27:06,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067004513] [2025-02-05 22:27:06,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:06,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:27:06,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:27:06,963 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 22:27:06,965 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 22:27:07,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:27:07,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:27:07,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:07,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:07,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 22:27:07,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:27:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 22:27:07,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:27:07,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067004513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:27:07,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:27:07,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 14 [2025-02-05 22:27:07,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071651072] [2025-02-05 22:27:07,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:27:07,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:27:07,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:27:07,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:27:07,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:27:07,971 INFO L87 Difference]: Start difference. First operand 361 states and 540 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:27:08,773 INFO L93 Difference]: Finished difference Result 1001 states and 1491 transitions. [2025-02-05 22:27:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:27:08,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-02-05 22:27:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:27:08,776 INFO L225 Difference]: With dead ends: 1001 [2025-02-05 22:27:08,776 INFO L226 Difference]: Without dead ends: 643 [2025-02-05 22:27:08,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:27:08,778 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 411 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:27:08,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 745 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:27:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-02-05 22:27:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 458. [2025-02-05 22:27:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 419 states have (on average 1.503579952267303) internal successors, (630), 420 states have internal predecessors, (630), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 22:27:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 694 transitions. [2025-02-05 22:27:08,803 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 694 transitions. Word has length 138 [2025-02-05 22:27:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:27:08,803 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 694 transitions. [2025-02-05 22:27:08,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 694 transitions. [2025-02-05 22:27:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 22:27:08,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:27:08,805 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:27:08,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 22:27:09,005 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,SelfDestructingSolverStorable7 [2025-02-05 22:27:09,006 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:27:09,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:27:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1375645312, now seen corresponding path program 1 times [2025-02-05 22:27:09,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:27:09,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325144773] [2025-02-05 22:27:09,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:09,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:27:09,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:27:09,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:27:09,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:09,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 22:27:09,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:27:09,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325144773] [2025-02-05 22:27:09,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325144773] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:27:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118990934] [2025-02-05 22:27:09,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:09,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:27:09,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:27:09,669 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 22:27:09,674 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 22:27:09,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:27:09,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:27:09,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:09,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:09,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 22:27:09,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:27:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-02-05 22:27:10,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:27:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 22:27:11,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118990934] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 22:27:11,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:27:11,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 14] total 26 [2025-02-05 22:27:11,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502252174] [2025-02-05 22:27:11,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:27:11,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:27:11,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:27:11,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:27:11,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2025-02-05 22:27:11,241 INFO L87 Difference]: Start difference. First operand 458 states and 694 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:27:12,880 INFO L93 Difference]: Finished difference Result 1348 states and 2015 transitions. [2025-02-05 22:27:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:27:12,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-02-05 22:27:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:27:12,883 INFO L225 Difference]: With dead ends: 1348 [2025-02-05 22:27:12,883 INFO L226 Difference]: Without dead ends: 893 [2025-02-05 22:27:12,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2025-02-05 22:27:12,885 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 395 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:27:12,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 785 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 22:27:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-02-05 22:27:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 361. [2025-02-05 22:27:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 322 states have (on average 1.4782608695652173) internal successors, (476), 323 states have internal predecessors, (476), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 22:27:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 540 transitions. [2025-02-05 22:27:12,900 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 540 transitions. Word has length 138 [2025-02-05 22:27:12,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:27:12,900 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 540 transitions. [2025-02-05 22:27:12,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 540 transitions. [2025-02-05 22:27:12,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 22:27:12,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:27:12,902 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:27:12,908 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 22:27:13,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:27:13,102 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:27:13,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:27:13,103 INFO L85 PathProgramCache]: Analyzing trace with hash -44134138, now seen corresponding path program 1 times [2025-02-05 22:27:13,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:27:13,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677866573] [2025-02-05 22:27:13,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:13,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:27:13,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:27:13,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:27:13,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:13,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 22:27:13,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:27:13,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677866573] [2025-02-05 22:27:13,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677866573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:27:13,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610699375] [2025-02-05 22:27:13,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:13,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:27:13,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:27:13,586 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 22:27:13,588 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 22:27:13,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 22:27:13,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 22:27:13,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:13,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:13,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 22:27:13,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:27:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 22:27:13,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:27:13,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610699375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:27:13,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:27:13,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 12 [2025-02-05 22:27:13,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197974055] [2025-02-05 22:27:13,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:27:13,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:27:13,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:27:13,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:27:13,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:27:13,954 INFO L87 Difference]: Start difference. First operand 361 states and 540 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:27:14,435 INFO L93 Difference]: Finished difference Result 944 states and 1407 transitions. [2025-02-05 22:27:14,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:27:14,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-02-05 22:27:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:27:14,441 INFO L225 Difference]: With dead ends: 944 [2025-02-05 22:27:14,441 INFO L226 Difference]: Without dead ends: 586 [2025-02-05 22:27:14,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:27:14,443 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 150 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:27:14,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 662 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:27:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-02-05 22:27:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 292. [2025-02-05 22:27:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 253 states have (on average 1.4426877470355732) internal successors, (365), 254 states have internal predecessors, (365), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 22:27:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 429 transitions. [2025-02-05 22:27:14,459 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 429 transitions. Word has length 138 [2025-02-05 22:27:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:27:14,460 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 429 transitions. [2025-02-05 22:27:14,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 429 transitions. [2025-02-05 22:27:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 22:27:14,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:27:14,461 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:27:14,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 22:27:14,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:27:14,667 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:27:14,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:27:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash 176813512, now seen corresponding path program 1 times [2025-02-05 22:27:14,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:27:14,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177765274] [2025-02-05 22:27:14,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:14,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:27:14,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 22:27:14,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 22:27:14,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:14,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 22:27:15,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:27:15,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177765274] [2025-02-05 22:27:15,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177765274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:27:15,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:27:15,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:27:15,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356833240] [2025-02-05 22:27:15,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:27:15,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:27:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:27:15,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:27:15,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:27:15,155 INFO L87 Difference]: Start difference. First operand 292 states and 429 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:27:16,064 INFO L93 Difference]: Finished difference Result 1148 states and 1632 transitions. [2025-02-05 22:27:16,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:27:16,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-02-05 22:27:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:27:16,067 INFO L225 Difference]: With dead ends: 1148 [2025-02-05 22:27:16,067 INFO L226 Difference]: Without dead ends: 859 [2025-02-05 22:27:16,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:27:16,068 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 440 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:27:16,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 950 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:27:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-02-05 22:27:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 579. [2025-02-05 22:27:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 504 states have (on average 1.4186507936507937) internal successors, (715), 509 states have internal predecessors, (715), 58 states have call successors, (58), 16 states have call predecessors, (58), 16 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 22:27:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 831 transitions. [2025-02-05 22:27:16,097 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 831 transitions. Word has length 140 [2025-02-05 22:27:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:27:16,098 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 831 transitions. [2025-02-05 22:27:16,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 831 transitions. [2025-02-05 22:27:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 22:27:16,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:27:16,099 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:27:16,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:27:16,099 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:27:16,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:27:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1692497697, now seen corresponding path program 1 times [2025-02-05 22:27:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:27:16,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661801155] [2025-02-05 22:27:16,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:16,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:27:16,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 22:27:16,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 22:27:16,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:16,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:27:16,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32685486] [2025-02-05 22:27:16,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:16,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:27:16,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:27:16,139 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 22:27:16,140 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 22:27:16,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 22:27:16,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 22:27:16,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:16,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:16,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 22:27:16,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:27:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 268 proven. 42 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2025-02-05 22:27:16,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:27:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 22:27:16,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:27:16,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661801155] [2025-02-05 22:27:16,750 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 22:27:16,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32685486] [2025-02-05 22:27:16,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32685486] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:27:16,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:27:16,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-02-05 22:27:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391996812] [2025-02-05 22:27:16,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:27:16,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 22:27:16,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:27:16,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 22:27:16,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:27:16,752 INFO L87 Difference]: Start difference. First operand 579 states and 831 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-05 22:27:17,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:27:17,699 INFO L93 Difference]: Finished difference Result 1643 states and 2302 transitions. [2025-02-05 22:27:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 22:27:17,699 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 140 [2025-02-05 22:27:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:27:17,702 INFO L225 Difference]: With dead ends: 1643 [2025-02-05 22:27:17,703 INFO L226 Difference]: Without dead ends: 1051 [2025-02-05 22:27:17,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2025-02-05 22:27:17,704 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 498 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:27:17,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1218 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:27:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-02-05 22:27:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 710. [2025-02-05 22:27:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 639 states have (on average 1.4491392801251957) internal successors, (926), 642 states have internal predecessors, (926), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 22:27:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1034 transitions. [2025-02-05 22:27:17,735 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1034 transitions. Word has length 140 [2025-02-05 22:27:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:27:17,735 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1034 transitions. [2025-02-05 22:27:17,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-05 22:27:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1034 transitions. [2025-02-05 22:27:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 22:27:17,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:27:17,737 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:27:17,747 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 22:27:17,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:27:17,938 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:27:17,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:27:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash -300949019, now seen corresponding path program 1 times [2025-02-05 22:27:17,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:27:17,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040269653] [2025-02-05 22:27:17,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:27:17,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 22:27:17,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 22:27:17,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:17,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 22:27:17,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:27:17,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040269653] [2025-02-05 22:27:17,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040269653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:27:17,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:27:17,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:27:17,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518406261] [2025-02-05 22:27:17,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:27:17,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:27:17,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:27:17,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:27:17,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:27:17,975 INFO L87 Difference]: Start difference. First operand 710 states and 1034 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:27:18,091 INFO L93 Difference]: Finished difference Result 1594 states and 2285 transitions. [2025-02-05 22:27:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:27:18,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-02-05 22:27:18,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:27:18,094 INFO L225 Difference]: With dead ends: 1594 [2025-02-05 22:27:18,094 INFO L226 Difference]: Without dead ends: 887 [2025-02-05 22:27:18,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:27:18,096 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 116 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:27:18,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 235 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:27:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-02-05 22:27:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 710. [2025-02-05 22:27:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 639 states have (on average 1.4460093896713615) internal successors, (924), 642 states have internal predecessors, (924), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 22:27:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1032 transitions. [2025-02-05 22:27:18,129 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1032 transitions. Word has length 140 [2025-02-05 22:27:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:27:18,129 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1032 transitions. [2025-02-05 22:27:18,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1032 transitions. [2025-02-05 22:27:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 22:27:18,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:27:18,131 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:27:18,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:27:18,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:27:18,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:27:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash -77923033, now seen corresponding path program 1 times [2025-02-05 22:27:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:27:18,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153185748] [2025-02-05 22:27:18,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:18,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:27:18,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 22:27:18,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 22:27:18,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:18,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 22:27:18,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:27:18,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153185748] [2025-02-05 22:27:18,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153185748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:27:18,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:27:18,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 22:27:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074798179] [2025-02-05 22:27:18,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:27:18,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:27:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:27:18,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:27:18,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:27:18,378 INFO L87 Difference]: Start difference. First operand 710 states and 1032 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:27:18,868 INFO L93 Difference]: Finished difference Result 1964 states and 2795 transitions. [2025-02-05 22:27:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:27:18,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-02-05 22:27:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:27:18,872 INFO L225 Difference]: With dead ends: 1964 [2025-02-05 22:27:18,873 INFO L226 Difference]: Without dead ends: 1257 [2025-02-05 22:27:18,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:27:18,875 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 228 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:27:18,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 702 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:27:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-02-05 22:27:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 754. [2025-02-05 22:27:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 683 states have (on average 1.4553440702781846) internal successors, (994), 686 states have internal predecessors, (994), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 22:27:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1102 transitions. [2025-02-05 22:27:18,914 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1102 transitions. Word has length 140 [2025-02-05 22:27:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:27:18,914 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1102 transitions. [2025-02-05 22:27:18,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 22:27:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1102 transitions. [2025-02-05 22:27:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 22:27:18,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:27:18,916 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:27:18,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 22:27:18,916 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:27:18,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:27:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1688410972, now seen corresponding path program 1 times [2025-02-05 22:27:18,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:27:18,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722156350] [2025-02-05 22:27:18,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:18,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:27:18,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 22:27:18,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 22:27:18,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:18,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:27:18,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818149106] [2025-02-05 22:27:18,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:27:18,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:27:18,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:27:18,961 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 22:27:18,963 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 22:27:19,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 22:27:19,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 22:27:19,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:27:19,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:27:19,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 22:27:19,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:27:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 288 proven. 39 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2025-02-05 22:27:19,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:27:32,859 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_12~0 65536))) (or (and (not (= (mod c_~var_1_6~0 65536) .cse0)) (forall ((~last_1_var_1_13~0 Int)) (< 255 (mod (* ~last_1_var_1_13~0 (div c_~var_1_6~0 4)) 4294967296)))) (let ((.cse1 (div c_~var_1_6~0 c_~var_1_6~0))) (let ((.cse2 (< .cse1 c_~var_1_6~0))) (and (or (< c_~var_1_6~0 (+ (mod c_~last_1_var_1_12~0 65536) 1 c_~var_1_7~0)) (and (forall ((v_z_31 Int)) (or (< .cse1 v_z_31) (< v_z_31 0) (< .cse0 v_z_31) (< (div v_z_31 c_~var_1_6~0) v_z_31))) (or .cse2 (< .cse0 c_~var_1_6~0)))) (or (< .cse0 1) (< .cse1 1) .cse2) (forall ((v_z_36 Int)) (or (< (div v_z_36 c_~var_1_6~0) v_z_36) (= v_z_36 0) (< v_z_36 0) (< .cse0 v_z_36) (< 255 v_z_36) (< .cse1 v_z_36)))))))) is different from false [2025-02-05 22:27:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 22:27:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:27:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722156350] [2025-02-05 22:27:35,551 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 22:27:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818149106] [2025-02-05 22:27:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818149106] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:27:35,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:27:35,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2025-02-05 22:27:35,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894945239] [2025-02-05 22:27:35,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:27:35,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 22:27:35,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:27:35,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 22:27:35,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=280, Unknown=1, NotChecked=36, Total=420 [2025-02-05 22:27:35,553 INFO L87 Difference]: Start difference. First operand 754 states and 1102 transitions. Second operand has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-02-05 22:27:44,542 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~last_1_var_1_12~0 65536))) (and (<= c_~var_1_6~0 (+ .cse0 c_~var_1_7~0)) (let ((.cse1 (mod c_~var_1_12~0 65536))) (or (and (not (= (mod c_~var_1_6~0 65536) .cse1)) (forall ((~last_1_var_1_13~0 Int)) (< 255 (mod (* ~last_1_var_1_13~0 (div c_~var_1_6~0 4)) 4294967296)))) (let ((.cse2 (div c_~var_1_6~0 c_~var_1_6~0))) (let ((.cse3 (< .cse2 c_~var_1_6~0))) (and (or (< c_~var_1_6~0 (+ .cse0 1 c_~var_1_7~0)) (and (forall ((v_z_31 Int)) (or (< .cse2 v_z_31) (< v_z_31 0) (< .cse1 v_z_31) (< (div v_z_31 c_~var_1_6~0) v_z_31))) (or .cse3 (< .cse1 c_~var_1_6~0)))) (or (< .cse1 1) (< .cse2 1) .cse3) (forall ((v_z_36 Int)) (or (< (div v_z_36 c_~var_1_6~0) v_z_36) (= v_z_36 0) (< v_z_36 0) (< .cse1 v_z_36) (< 255 v_z_36) (< .cse2 v_z_36)))))))) (<= 6 c_~var_1_6~0) (= c_~var_1_6~0 c_~var_1_12~0))) is different from false [2025-02-05 22:27:48,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_~var_1_6~0 c_~var_1_6~0))) (let ((.cse5 (< .cse4 c_~var_1_6~0)) (.cse3 (mod c_~var_1_12~0 65536))) (let ((.cse0 (and (not (= (mod c_~var_1_6~0 65536) .cse3)) (forall ((~last_1_var_1_13~0 Int)) (< 255 (mod (* ~last_1_var_1_13~0 (div c_~var_1_6~0 4)) 4294967296))))) (.cse1 (or (< c_~var_1_6~0 (+ (mod c_~last_1_var_1_12~0 65536) 1 c_~var_1_7~0)) (and (forall ((v_z_31 Int)) (or (< .cse4 v_z_31) (< v_z_31 0) (< .cse3 v_z_31) (< (div v_z_31 c_~var_1_6~0) v_z_31))) (or .cse5 (< .cse3 c_~var_1_6~0))))) (.cse2 (or (< .cse3 1) (< .cse4 1) .cse5))) (and (or .cse0 (and .cse1 .cse2 (forall ((v_z_36 Int)) (or (< (div v_z_36 c_~var_1_6~0) v_z_36) (= v_z_36 0) (< v_z_36 0) (< .cse3 v_z_36) (< 255 v_z_36) (< .cse4 v_z_36))))) (<= 6 c_~var_1_6~0) (or .cse0 (and .cse1 .cse2) (< |c_ULTIMATE.start_step_~stepLocal_2~0#1| c_~var_1_6~0)))))) is different from false [2025-02-05 22:27:54,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-02-05 22:27:59,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-02-05 22:28:03,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-02-05 22:28:08,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-02-05 22:28:13,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1]