./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-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 a84128d9dc2647965d087aabf3251d6852e74faf39ebdf7a8caa157044f8c0e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:10:34,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:10:35,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:10:35,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:10:35,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:10:35,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:10:35,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:10:35,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:10:35,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:10:35,028 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:10:35,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:10:35,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:10:35,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:10:35,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:10:35,029 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:10:35,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:10:35,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:10:35,029 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:10:35,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:10:35,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:10:35,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:10:35,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:10:35,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:10:35,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:10:35,030 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:10:35,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:10:35,030 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:10:35,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:10:35,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:10:35,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:10:35,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:10:35,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:10:35,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:10:35,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:10:35,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:10:35,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:10:35,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:10:35,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:10:35,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:10:35,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:10:35,031 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:10:35,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:10:35,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:10:35,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:10:35,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:10:35,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:10:35,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:10:35,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:10:35,032 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 -> a84128d9dc2647965d087aabf3251d6852e74faf39ebdf7a8caa157044f8c0e2 [2025-01-09 11:10:35,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:10:35,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:10:35,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:10:35,266 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:10:35,267 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:10:35,267 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-pr-ci_file-9.i [2025-01-09 11:10:36,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c83b026d/2f16a7255f7f4bc5adea18909319c99a/FLAG492098c12 [2025-01-09 11:10:36,667 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:10:36,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2025-01-09 11:10:36,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c83b026d/2f16a7255f7f4bc5adea18909319c99a/FLAG492098c12 [2025-01-09 11:10:36,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c83b026d/2f16a7255f7f4bc5adea18909319c99a [2025-01-09 11:10:36,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:10:36,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:10:36,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:10:36,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:10:36,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:10:36,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:10:36" (1/1) ... [2025-01-09 11:10:36,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f68d2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:36, skipping insertion in model container [2025-01-09 11:10:36,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:10:36" (1/1) ... [2025-01-09 11:10:36,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:10:37,076 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-pr-ci_file-9.i[918,931] [2025-01-09 11:10:37,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:10:37,147 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:10:37,156 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-pr-ci_file-9.i[918,931] [2025-01-09 11:10:37,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:10:37,202 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:10:37,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37 WrapperNode [2025-01-09 11:10:37,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:10:37,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:10:37,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:10:37,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:10:37,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,252 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-01-09 11:10:37,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:10:37,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:10:37,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:10:37,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:10:37,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,289 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 11:10:37,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:10:37,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:10:37,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:10:37,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:10:37,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (1/1) ... [2025-01-09 11:10:37,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:10:37,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:10:37,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:10:37,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:10:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:10:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:10:37,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:10:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:10:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:10:37,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:10:37,416 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:10:37,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:10:37,721 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-09 11:10:37,721 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:10:37,732 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:10:37,732 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:10:37,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:10:37 BoogieIcfgContainer [2025-01-09 11:10:37,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:10:37,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:10:37,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:10:37,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:10:37,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:10:36" (1/3) ... [2025-01-09 11:10:37,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7199e8c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:10:37, skipping insertion in model container [2025-01-09 11:10:37,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:37" (2/3) ... [2025-01-09 11:10:37,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7199e8c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:10:37, skipping insertion in model container [2025-01-09 11:10:37,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:10:37" (3/3) ... [2025-01-09 11:10:37,741 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2025-01-09 11:10:37,752 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:10:37,753 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:10:37,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:10:37,802 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;@331b8add, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:10:37,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:10:37,805 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-01-09 11:10:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 11:10:37,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:37,813 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-01-09 11:10:37,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:37,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:37,816 INFO L85 PathProgramCache]: Analyzing trace with hash 156868659, now seen corresponding path program 1 times [2025-01-09 11:10:37,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:10:37,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056378949] [2025-01-09 11:10:37,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:37,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:10:37,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 11:10:37,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 11:10:37,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:37,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 11:10:38,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:10:38,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056378949] [2025-01-09 11:10:38,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056378949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:10:38,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142177757] [2025-01-09 11:10:38,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:38,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:10:38,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:10:38,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:10:38,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 11:10:38,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 11:10:38,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 11:10:38,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:38,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:38,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:10:38,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:10:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 11:10:38,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:10:38,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142177757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:10:38,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:10:38,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:10:38,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495943342] [2025-01-09 11:10:38,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:10:38,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:10:38,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:10:38,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:10:38,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:10:38,237 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-01-09 11:10:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:10:38,254 INFO L93 Difference]: Finished difference Result 186 states and 312 transitions. [2025-01-09 11:10:38,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:10:38,256 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-01-09 11:10:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:10:38,260 INFO L225 Difference]: With dead ends: 186 [2025-01-09 11:10:38,260 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 11:10:38,262 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-01-09 11:10:38,264 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:10:38,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:10:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 11:10:38,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 11:10:38,285 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-01-09 11:10:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2025-01-09 11:10:38,289 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 137 [2025-01-09 11:10:38,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:10:38,290 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2025-01-09 11:10:38,290 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-01-09 11:10:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2025-01-09 11:10:38,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 11:10:38,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:38,292 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-01-09 11:10:38,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:10:38,496 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-01-09 11:10:38,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:38,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash 756123321, now seen corresponding path program 1 times [2025-01-09 11:10:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:10:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070720740] [2025-01-09 11:10:38,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:10:38,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 11:10:38,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 11:10:38,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:38,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:10:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:10:38,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070720740] [2025-01-09 11:10:38,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070720740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:10:38,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:10:38,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:10:38,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452388047] [2025-01-09 11:10:38,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:10:38,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:10:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:10:38,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:10:38,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:10:38,702 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-01-09 11:10:38,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:10:38,717 INFO L93 Difference]: Finished difference Result 184 states and 285 transitions. [2025-01-09 11:10:38,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:10:38,718 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-01-09 11:10:38,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:10:38,720 INFO L225 Difference]: With dead ends: 184 [2025-01-09 11:10:38,720 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 11:10:38,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:10:38,721 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:10:38,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:10:38,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 11:10:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 11:10:38,727 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-01-09 11:10:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions. [2025-01-09 11:10:38,728 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 144 transitions. Word has length 137 [2025-01-09 11:10:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:10:38,730 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 144 transitions. [2025-01-09 11:10:38,730 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-01-09 11:10:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 144 transitions. [2025-01-09 11:10:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 11:10:38,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:38,731 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-01-09 11:10:38,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:10:38,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:38,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:38,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1268103243, now seen corresponding path program 1 times [2025-01-09 11:10:38,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:10:38,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514683884] [2025-01-09 11:10:38,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:38,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:10:38,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 11:10:38,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 11:10:38,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:38,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:10:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:10:38,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514683884] [2025-01-09 11:10:38,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514683884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:10:38,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:10:38,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:10:38,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929324639] [2025-01-09 11:10:38,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:10:38,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:10:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:10:38,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:10:38,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:10:38,845 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-01-09 11:10:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:10:38,886 INFO L93 Difference]: Finished difference Result 261 states and 399 transitions. [2025-01-09 11:10:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:10:38,887 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-01-09 11:10:38,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:10:38,888 INFO L225 Difference]: With dead ends: 261 [2025-01-09 11:10:38,888 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 11:10:38,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:10:38,889 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 114 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:10:38,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 326 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:10:38,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 11:10:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2025-01-09 11:10:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 132 states have (on average 1.4242424242424243) internal successors, (188), 133 states have internal predecessors, (188), 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-01-09 11:10:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 252 transitions. [2025-01-09 11:10:38,911 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 252 transitions. Word has length 138 [2025-01-09 11:10:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:10:38,911 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 252 transitions. [2025-01-09 11:10:38,911 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-01-09 11:10:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2025-01-09 11:10:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 11:10:38,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:38,915 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-01-09 11:10:38,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:10:38,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:38,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1969167821, now seen corresponding path program 1 times [2025-01-09 11:10:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:10:38,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427948237] [2025-01-09 11:10:38,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:38,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:10:38,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 11:10:38,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 11:10:38,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:38,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 11:10:42,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:10:42,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427948237] [2025-01-09 11:10:42,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427948237] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:10:42,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574718672] [2025-01-09 11:10:42,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:42,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:10:42,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:10:42,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:10:42,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 11:10:42,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 11:10:42,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 11:10:42,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:42,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:42,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 11:10:42,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:10:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 332 proven. 66 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-01-09 11:10:43,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:10:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 69 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-01-09 11:10:44,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574718672] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:10:44,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:10:44,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 11] total 32 [2025-01-09 11:10:44,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651776470] [2025-01-09 11:10:44,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:10:44,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 11:10:44,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:10:44,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 11:10:44,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-01-09 11:10:44,156 INFO L87 Difference]: Start difference. First operand 167 states and 252 transitions. Second operand has 32 states, 32 states have (on average 3.8125) internal successors, (122), 32 states have internal predecessors, (122), 8 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 8 states have call predecessors, (57), 8 states have call successors, (57) [2025-01-09 11:10:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:10:53,920 INFO L93 Difference]: Finished difference Result 1600 states and 2354 transitions. [2025-01-09 11:10:53,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-01-09 11:10:53,920 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.8125) internal successors, (122), 32 states have internal predecessors, (122), 8 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 8 states have call predecessors, (57), 8 states have call successors, (57) Word has length 138 [2025-01-09 11:10:53,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:10:53,927 INFO L225 Difference]: With dead ends: 1600 [2025-01-09 11:10:53,927 INFO L226 Difference]: Without dead ends: 1436 [2025-01-09 11:10:53,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2585 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1428, Invalid=6944, Unknown=0, NotChecked=0, Total=8372 [2025-01-09 11:10:53,932 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 2979 mSDsluCounter, 2241 mSDsCounter, 0 mSdLazyCounter, 3089 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2985 SdHoareTripleChecker+Valid, 2403 SdHoareTripleChecker+Invalid, 3330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 3089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:10:53,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2985 Valid, 2403 Invalid, 3330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 3089 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-01-09 11:10:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-01-09 11:10:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 679. [2025-01-09 11:10:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 558 states have (on average 1.4301075268817205) internal successors, (798), 563 states have internal predecessors, (798), 106 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 11:10:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1010 transitions. [2025-01-09 11:10:54,001 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1010 transitions. Word has length 138 [2025-01-09 11:10:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:10:54,002 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1010 transitions. [2025-01-09 11:10:54,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.8125) internal successors, (122), 32 states have internal predecessors, (122), 8 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 8 states have call predecessors, (57), 8 states have call successors, (57) [2025-01-09 11:10:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1010 transitions. [2025-01-09 11:10:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 11:10:54,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:54,006 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-01-09 11:10:54,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 11:10:54,207 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-01-09 11:10:54,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:54,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1319146121, now seen corresponding path program 1 times [2025-01-09 11:10:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:10:54,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523471245] [2025-01-09 11:10:54,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:54,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:10:54,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 11:10:54,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 11:10:54,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:54,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 11:10:55,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:10:55,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523471245] [2025-01-09 11:10:55,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523471245] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:10:55,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413895283] [2025-01-09 11:10:55,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:55,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:10:55,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:10:55,160 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:10:55,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 11:10:55,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 11:10:55,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 11:10:55,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:55,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:55,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 11:10:55,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:10:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-01-09 11:10:56,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:10:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:10:57,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413895283] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 11:10:57,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:10:57,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 22 [2025-01-09 11:10:57,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238771393] [2025-01-09 11:10:57,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:10:57,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:10:57,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:10:57,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:10:57,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-01-09 11:10:57,059 INFO L87 Difference]: Start difference. First operand 679 states and 1010 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-01-09 11:10:58,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:10:58,630 INFO L93 Difference]: Finished difference Result 2243 states and 3365 transitions. [2025-01-09 11:10:58,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 11:10:58,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-01-09 11:10:58,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:10:58,638 INFO L225 Difference]: With dead ends: 2243 [2025-01-09 11:10:58,639 INFO L226 Difference]: Without dead ends: 1567 [2025-01-09 11:10:58,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2025-01-09 11:10:58,642 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 402 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:10:58,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 925 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 11:10:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-01-09 11:10:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 904. [2025-01-09 11:10:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 783 states have (on average 1.4738186462324394) internal successors, (1154), 788 states have internal predecessors, (1154), 106 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 11:10:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1366 transitions. [2025-01-09 11:10:58,700 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1366 transitions. Word has length 138 [2025-01-09 11:10:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:10:58,700 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1366 transitions. [2025-01-09 11:10:58,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-01-09 11:10:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1366 transitions. [2025-01-09 11:10:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 11:10:58,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:58,703 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-01-09 11:10:58,709 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-01-09 11:10:58,907 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-01-09 11:10:58,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:58,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:58,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1318159584, now seen corresponding path program 1 times [2025-01-09 11:10:58,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:10:58,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133446364] [2025-01-09 11:10:58,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:58,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:10:58,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 11:10:58,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 11:10:58,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:58,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 11:10:59,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:10:59,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133446364] [2025-01-09 11:10:59,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133446364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:10:59,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645019459] [2025-01-09 11:10:59,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:59,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:10:59,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:10:59,886 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:10:59,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 11:10:59,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 11:11:00,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 11:11:00,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:00,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:00,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 11:11:00,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 321 proven. 57 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-01-09 11:11:00,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:11:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:11:01,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645019459] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 11:11:01,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:11:01,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 11] total 21 [2025-01-09 11:11:01,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241922456] [2025-01-09 11:11:01,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:01,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:11:01,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:01,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:11:01,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:11:01,450 INFO L87 Difference]: Start difference. First operand 904 states and 1366 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-01-09 11:11:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:02,952 INFO L93 Difference]: Finished difference Result 2745 states and 4145 transitions. [2025-01-09 11:11:02,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 11:11:02,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-01-09 11:11:02,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:02,959 INFO L225 Difference]: With dead ends: 2745 [2025-01-09 11:11:02,959 INFO L226 Difference]: Without dead ends: 1844 [2025-01-09 11:11:02,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2025-01-09 11:11:02,961 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 391 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:02,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 812 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 11:11:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-01-09 11:11:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 845. [2025-01-09 11:11:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 724 states have (on average 1.4613259668508287) internal successors, (1058), 729 states have internal predecessors, (1058), 106 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 11:11:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1270 transitions. [2025-01-09 11:11:03,040 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1270 transitions. Word has length 138 [2025-01-09 11:11:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:03,041 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1270 transitions. [2025-01-09 11:11:03,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-01-09 11:11:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1270 transitions. [2025-01-09 11:11:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 11:11:03,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:03,046 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-01-09 11:11:03,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 11:11:03,249 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-01-09 11:11:03,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:03,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:03,250 INFO L85 PathProgramCache]: Analyzing trace with hash 378360609, now seen corresponding path program 1 times [2025-01-09 11:11:03,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:03,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421831066] [2025-01-09 11:11:03,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:03,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:03,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 11:11:03,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 11:11:03,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:03,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 11:11:05,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:05,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421831066] [2025-01-09 11:11:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421831066] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:11:05,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270791797] [2025-01-09 11:11:05,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:05,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:11:05,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:11:05,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:11:05,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 11:11:05,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 11:11:05,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 11:11:05,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:05,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:05,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 11:11:05,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 288 proven. 39 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2025-01-09 11:11:05,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:11:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 11:11:05,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270791797] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:11:05,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:11:05,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 17 [2025-01-09 11:11:05,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918403459] [2025-01-09 11:11:05,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:11:05,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:11:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:05,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:11:05,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:11:05,880 INFO L87 Difference]: Start difference. First operand 845 states and 1270 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 4 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-01-09 11:11:08,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:08,241 INFO L93 Difference]: Finished difference Result 3356 states and 4951 transitions. [2025-01-09 11:11:08,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 11:11:08,241 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 4 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) Word has length 140 [2025-01-09 11:11:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:08,256 INFO L225 Difference]: With dead ends: 3356 [2025-01-09 11:11:08,256 INFO L226 Difference]: Without dead ends: 2514 [2025-01-09 11:11:08,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 11:11:08,262 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1612 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:08,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 461 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 11:11:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2025-01-09 11:11:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 1231. [2025-01-09 11:11:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1092 states have (on average 1.435897435897436) internal successors, (1568), 1099 states have internal predecessors, (1568), 116 states have call successors, (116), 22 states have call predecessors, (116), 22 states have return successors, (116), 109 states have call predecessors, (116), 116 states have call successors, (116) [2025-01-09 11:11:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1800 transitions. [2025-01-09 11:11:08,318 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1800 transitions. Word has length 140 [2025-01-09 11:11:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:08,319 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1800 transitions. [2025-01-09 11:11:08,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 4 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-01-09 11:11:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1800 transitions. [2025-01-09 11:11:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 11:11:08,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:08,321 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-01-09 11:11:08,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 11:11:08,526 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-01-09 11:11:08,526 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:08,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash 414751750, now seen corresponding path program 1 times [2025-01-09 11:11:08,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:08,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029495217] [2025-01-09 11:11:08,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:08,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:08,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 11:11:08,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 11:11:08,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:08,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:11:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029495217] [2025-01-09 11:11:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029495217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:11:08,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:11:08,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 11:11:08,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445737675] [2025-01-09 11:11:08,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:08,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:11:08,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:08,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:11:08,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:11:08,784 INFO L87 Difference]: Start difference. First operand 1231 states and 1800 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-01-09 11:11:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:09,358 INFO L93 Difference]: Finished difference Result 4248 states and 6067 transitions. [2025-01-09 11:11:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 11:11:09,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-01-09 11:11:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:09,369 INFO L225 Difference]: With dead ends: 4248 [2025-01-09 11:11:09,370 INFO L226 Difference]: Without dead ends: 3020 [2025-01-09 11:11:09,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:11:09,374 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 462 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:09,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1072 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:11:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2025-01-09 11:11:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 2854. [2025-01-09 11:11:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2403 states have (on average 1.356221389929255) internal successors, (3259), 2433 states have internal predecessors, (3259), 365 states have call successors, (365), 85 states have call predecessors, (365), 85 states have return successors, (365), 335 states have call predecessors, (365), 365 states have call successors, (365) [2025-01-09 11:11:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3989 transitions. [2025-01-09 11:11:09,520 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3989 transitions. Word has length 140 [2025-01-09 11:11:09,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:09,521 INFO L471 AbstractCegarLoop]: Abstraction has 2854 states and 3989 transitions. [2025-01-09 11:11:09,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-01-09 11:11:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3989 transitions. [2025-01-09 11:11:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 11:11:09,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:09,525 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-01-09 11:11:09,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:11:09,526 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:09,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:09,526 INFO L85 PathProgramCache]: Analyzing trace with hash 112986470, now seen corresponding path program 1 times [2025-01-09 11:11:09,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:09,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135146328] [2025-01-09 11:11:09,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:09,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:09,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 11:11:09,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 11:11:09,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:09,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:11:09,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1948454534] [2025-01-09 11:11:09,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:09,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:11:09,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:11:09,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:11:09,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 11:11:09,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 11:11:09,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 11:11:09,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:09,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:09,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 11:11:09,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 268 proven. 42 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2025-01-09 11:11:10,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:11:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 11:11:10,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:10,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135146328] [2025-01-09 11:11:10,383 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 11:11:10,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948454534] [2025-01-09 11:11:10,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948454534] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:11:10,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:11:10,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-01-09 11:11:10,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884126066] [2025-01-09 11:11:10,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:11:10,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:11:10,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:10,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:11:10,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:11:10,386 INFO L87 Difference]: Start difference. First operand 2854 states and 3989 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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-01-09 11:11:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:11,232 INFO L93 Difference]: Finished difference Result 5987 states and 8251 transitions. [2025-01-09 11:11:11,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 11:11:11,233 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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-01-09 11:11:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:11,244 INFO L225 Difference]: With dead ends: 5987 [2025-01-09 11:11:11,244 INFO L226 Difference]: Without dead ends: 3136 [2025-01-09 11:11:11,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2025-01-09 11:11:11,250 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 426 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:11,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 983 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:11:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2025-01-09 11:11:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 2696. [2025-01-09 11:11:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2277 states have (on average 1.3623188405797102) internal successors, (3102), 2296 states have internal predecessors, (3102), 325 states have call successors, (325), 93 states have call predecessors, (325), 93 states have return successors, (325), 306 states have call predecessors, (325), 325 states have call successors, (325) [2025-01-09 11:11:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 3752 transitions. [2025-01-09 11:11:11,388 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 3752 transitions. Word has length 140 [2025-01-09 11:11:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:11,388 INFO L471 AbstractCegarLoop]: Abstraction has 2696 states and 3752 transitions. [2025-01-09 11:11:11,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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-01-09 11:11:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3752 transitions. [2025-01-09 11:11:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 11:11:11,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:11,390 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-01-09 11:11:11,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 11:11:11,594 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,SelfDestructingSolverStorable8 [2025-01-09 11:11:11,594 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:11,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:11,595 INFO L85 PathProgramCache]: Analyzing trace with hash -5326115, now seen corresponding path program 1 times [2025-01-09 11:11:11,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:11,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904619149] [2025-01-09 11:11:11,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:11,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:11,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 11:11:11,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 11:11:11,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:11,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:11:12,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:12,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904619149] [2025-01-09 11:11:12,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904619149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:11:12,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:11:12,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 11:11:12,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39772794] [2025-01-09 11:11:12,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:12,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:11:12,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:12,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:11:12,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:11:12,070 INFO L87 Difference]: Start difference. First operand 2696 states and 3752 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-01-09 11:11:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:12,730 INFO L93 Difference]: Finished difference Result 7758 states and 10549 transitions. [2025-01-09 11:11:12,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:11:12,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-01-09 11:11:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:12,748 INFO L225 Difference]: With dead ends: 7758 [2025-01-09 11:11:12,748 INFO L226 Difference]: Without dead ends: 5065 [2025-01-09 11:11:12,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:11:12,754 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 249 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:12,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 499 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:11:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5065 states. [2025-01-09 11:11:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5065 to 3712. [2025-01-09 11:11:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 3094 states have (on average 1.3435681965093729) internal successors, (4157), 3129 states have internal predecessors, (4157), 466 states have call successors, (466), 151 states have call predecessors, (466), 151 states have return successors, (466), 431 states have call predecessors, (466), 466 states have call successors, (466) [2025-01-09 11:11:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 5089 transitions. [2025-01-09 11:11:12,973 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 5089 transitions. Word has length 140 [2025-01-09 11:11:12,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:12,974 INFO L471 AbstractCegarLoop]: Abstraction has 3712 states and 5089 transitions. [2025-01-09 11:11:12,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-01-09 11:11:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 5089 transitions. [2025-01-09 11:11:12,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 11:11:12,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:12,975 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-01-09 11:11:12,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:11:12,976 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:12,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash -307091395, now seen corresponding path program 1 times [2025-01-09 11:11:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:12,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125768658] [2025-01-09 11:11:12,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:12,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:12,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 11:11:12,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 11:11:12,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:12,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:11:13,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:13,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125768658] [2025-01-09 11:11:13,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125768658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:11:13,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:11:13,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:11:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915013585] [2025-01-09 11:11:13,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:13,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:11:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:13,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:11:13,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:11:13,017 INFO L87 Difference]: Start difference. First operand 3712 states and 5089 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-01-09 11:11:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:13,245 INFO L93 Difference]: Finished difference Result 7636 states and 10461 transitions. [2025-01-09 11:11:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:11:13,246 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-01-09 11:11:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:13,260 INFO L225 Difference]: With dead ends: 7636 [2025-01-09 11:11:13,260 INFO L226 Difference]: Without dead ends: 3961 [2025-01-09 11:11:13,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:11:13,266 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 116 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 265 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:13,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 265 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:11:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2025-01-09 11:11:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3712. [2025-01-09 11:11:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 3094 states have (on average 1.3358112475759534) internal successors, (4133), 3129 states have internal predecessors, (4133), 466 states have call successors, (466), 151 states have call predecessors, (466), 151 states have return successors, (466), 431 states have call predecessors, (466), 466 states have call successors, (466) [2025-01-09 11:11:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 5065 transitions. [2025-01-09 11:11:13,501 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 5065 transitions. Word has length 140 [2025-01-09 11:11:13,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:13,502 INFO L471 AbstractCegarLoop]: Abstraction has 3712 states and 5065 transitions. [2025-01-09 11:11:13,502 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-01-09 11:11:13,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 5065 transitions. [2025-01-09 11:11:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 11:11:13,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:13,505 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-01-09 11:11:13,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:11:13,505 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:13,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1774016632, now seen corresponding path program 1 times [2025-01-09 11:11:13,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:13,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859719350] [2025-01-09 11:11:13,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:13,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:13,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 11:11:13,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 11:11:13,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:13,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:11:14,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:14,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859719350] [2025-01-09 11:11:14,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859719350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:11:14,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:11:14,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 11:11:14,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406089997] [2025-01-09 11:11:14,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:14,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:11:14,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:14,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:11:14,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:11:14,013 INFO L87 Difference]: Start difference. First operand 3712 states and 5065 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-01-09 11:11:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:14,668 INFO L93 Difference]: Finished difference Result 8031 states and 10909 transitions. [2025-01-09 11:11:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:11:14,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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 141 [2025-01-09 11:11:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:14,688 INFO L225 Difference]: With dead ends: 8031 [2025-01-09 11:11:14,690 INFO L226 Difference]: Without dead ends: 4356 [2025-01-09 11:11:14,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:11:14,696 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 193 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:14,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 369 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:11:14,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4356 states. [2025-01-09 11:11:14,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4356 to 3569. [2025-01-09 11:11:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3569 states, 2951 states have (on average 1.3249745848864791) internal successors, (3910), 2986 states have internal predecessors, (3910), 466 states have call successors, (466), 151 states have call predecessors, (466), 151 states have return successors, (466), 431 states have call predecessors, (466), 466 states have call successors, (466) [2025-01-09 11:11:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3569 states to 3569 states and 4842 transitions. [2025-01-09 11:11:14,926 INFO L78 Accepts]: Start accepts. Automaton has 3569 states and 4842 transitions. Word has length 141 [2025-01-09 11:11:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:14,926 INFO L471 AbstractCegarLoop]: Abstraction has 3569 states and 4842 transitions. [2025-01-09 11:11:14,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-01-09 11:11:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3569 states and 4842 transitions. [2025-01-09 11:11:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 11:11:14,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:14,928 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-01-09 11:11:14,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 11:11:14,929 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:14,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:14,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1472251352, now seen corresponding path program 1 times [2025-01-09 11:11:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:14,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425594035] [2025-01-09 11:11:14,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:14,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 11:11:14,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 11:11:14,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:14,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:11:15,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:15,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425594035] [2025-01-09 11:11:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425594035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:11:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:11:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:11:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135868655] [2025-01-09 11:11:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:15,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:11:15,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:15,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:11:15,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:11:15,922 INFO L87 Difference]: Start difference. First operand 3569 states and 4842 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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-01-09 11:11:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:17,971 INFO L93 Difference]: Finished difference Result 8281 states and 11240 transitions. [2025-01-09 11:11:17,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:11:17,972 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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 141 [2025-01-09 11:11:17,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:17,986 INFO L225 Difference]: With dead ends: 8281 [2025-01-09 11:11:17,987 INFO L226 Difference]: Without dead ends: 4749 [2025-01-09 11:11:17,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-01-09 11:11:17,994 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 400 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:17,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1170 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 11:11:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4749 states. [2025-01-09 11:11:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4749 to 3847. [2025-01-09 11:11:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3847 states, 3229 states have (on average 1.3310622483741097) internal successors, (4298), 3264 states have internal predecessors, (4298), 466 states have call successors, (466), 151 states have call predecessors, (466), 151 states have return successors, (466), 431 states have call predecessors, (466), 466 states have call successors, (466) [2025-01-09 11:11:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 5230 transitions. [2025-01-09 11:11:18,328 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 5230 transitions. Word has length 141 [2025-01-09 11:11:18,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:18,330 INFO L471 AbstractCegarLoop]: Abstraction has 3847 states and 5230 transitions. [2025-01-09 11:11:18,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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-01-09 11:11:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 5230 transitions. [2025-01-09 11:11:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 11:11:18,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:18,333 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-01-09 11:11:18,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 11:11:18,333 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:18,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1331702742, now seen corresponding path program 1 times [2025-01-09 11:11:18,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:18,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225777105] [2025-01-09 11:11:18,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:18,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:18,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 11:11:18,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 11:11:18,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:18,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:11:18,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225777105] [2025-01-09 11:11:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225777105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:11:18,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:11:18,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:11:18,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960431056] [2025-01-09 11:11:18,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:18,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:11:18,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:18,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:11:18,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:11:18,515 INFO L87 Difference]: Start difference. First operand 3847 states and 5230 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 11:11:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:18,995 INFO L93 Difference]: Finished difference Result 9976 states and 13639 transitions. [2025-01-09 11:11:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:11:18,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 141 [2025-01-09 11:11:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:19,011 INFO L225 Difference]: With dead ends: 9976 [2025-01-09 11:11:19,011 INFO L226 Difference]: Without dead ends: 6166 [2025-01-09 11:11:19,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:11:19,017 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 298 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:19,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 298 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:11:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6166 states. [2025-01-09 11:11:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6166 to 4163. [2025-01-09 11:11:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4163 states, 3545 states have (on average 1.3385049365303243) internal successors, (4745), 3580 states have internal predecessors, (4745), 466 states have call successors, (466), 151 states have call predecessors, (466), 151 states have return successors, (466), 431 states have call predecessors, (466), 466 states have call successors, (466) [2025-01-09 11:11:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 5677 transitions. [2025-01-09 11:11:19,264 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 5677 transitions. Word has length 141 [2025-01-09 11:11:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:19,265 INFO L471 AbstractCegarLoop]: Abstraction has 4163 states and 5677 transitions. [2025-01-09 11:11:19,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 11:11:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 5677 transitions. [2025-01-09 11:11:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 11:11:19,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:19,267 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-01-09 11:11:19,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 11:11:19,267 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:19,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:19,268 INFO L85 PathProgramCache]: Analyzing trace with hash 784094055, now seen corresponding path program 1 times [2025-01-09 11:11:19,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:19,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193595027] [2025-01-09 11:11:19,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:19,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:19,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 11:11:19,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 11:11:19,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:19,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:11:19,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765100707] [2025-01-09 11:11:19,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:19,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:11:19,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:11:19,312 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:11:19,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 11:11:19,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 11:11:19,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 11:11:19,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:19,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:19,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 11:11:19,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 293 proven. 39 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-01-09 11:11:19,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:11:25,457 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse37 (+ 1 (div c_~var_1_6~0 c_~var_1_6~0))) (.cse48 (mod c_~last_1_var_1_12~0 65536)) (.cse49 (mod c_~var_1_10~0 256)) (.cse2 (mod c_~var_1_7~0 256))) (and (or (let ((.cse0 (< (+ .cse48 c_~var_1_7~0) c_~var_1_6~0)) (.cse23 (not (= (mod c_~var_1_6~0 c_~var_1_6~0) 0))) (.cse7 (+ c_~var_1_6~0 .cse2)) (.cse5 (< 0 .cse2)) (.cse6 (< .cse2 1)) (.cse4 (* (- 1) .cse2))) (and (or (forall ((~var_1_3~0 Int)) (or (< c_~var_1_6~0 ~var_1_3~0) (= (mod ~var_1_3~0 c_~var_1_6~0) 0) (< (div ~var_1_3~0 c_~var_1_6~0) 1))) .cse0) (or (forall ((v_y_43 Int)) (let ((.cse3 (* v_y_43 256))) (let ((.cse1 (+ .cse3 .cse4))) (or (< (+ (div .cse1 c_~var_1_6~0) 1) 0) (< .cse2 (+ .cse3 1)) (= (mod .cse1 c_~var_1_6~0) 0))))) .cse5) (or .cse6 (forall ((v_y_42 Int)) (let ((.cse8 (* v_y_42 256))) (let ((.cse9 (+ 256 .cse8 .cse4))) (or (< .cse7 (+ 256 .cse8)) (= (mod .cse9 c_~var_1_6~0) 0) (< (div .cse9 c_~var_1_6~0) 1)))))) (or (forall ((~var_1_3~0 Int)) (or (< c_~var_1_6~0 ~var_1_3~0) (< (div ~var_1_3~0 c_~var_1_6~0) 0))) .cse0) (or (forall ((v_y_37 Int)) (let ((.cse10 (* v_y_37 256))) (let ((.cse11 (div (+ .cse10 .cse4) c_~var_1_6~0))) (or (< .cse7 .cse10) (= .cse11 0) (< .cse11 0))))) .cse5) (or (forall ((~var_1_3~0 Int)) (or (not (= (mod ~var_1_3~0 c_~var_1_6~0) 0)) (< c_~var_1_6~0 ~var_1_3~0) (< (div ~var_1_3~0 c_~var_1_6~0) 0))) .cse0) (or .cse6 (forall ((v_y_43 Int)) (let ((.cse13 (* v_y_43 256))) (let ((.cse12 (+ .cse13 256 .cse4))) (or (< (+ (div .cse12 c_~var_1_6~0) 1) 0) (< .cse7 (+ .cse13 256)) (= (mod .cse12 c_~var_1_6~0) 0)))))) (or (and (or .cse6 (forall ((v_y_16 Int)) (let ((.cse15 (* v_y_16 256))) (let ((.cse14 (+ 256 .cse4 .cse15))) (or (< (div .cse14 c_~var_1_6~0) 0) (< .cse7 (+ 256 .cse15)) (not (= (mod .cse14 c_~var_1_6~0) 0))))))) (or (forall ((v_y_16 Int)) (let ((.cse17 (* v_y_16 256))) (let ((.cse16 (+ .cse4 .cse17))) (or (< (div .cse16 c_~var_1_6~0) 0) (< .cse7 .cse17) (not (= (mod .cse16 c_~var_1_6~0) 0)))))) .cse5)) (< c_~var_1_6~0 0)) (or .cse6 (forall ((v_y_37 Int)) (let ((.cse19 (* v_y_37 256))) (let ((.cse18 (div (+ 256 .cse19 .cse4) c_~var_1_6~0))) (or (= .cse18 0) (< .cse7 (+ 256 .cse19)) (< .cse18 0)))))) (or (forall ((v_y_27 Int)) (let ((.cse21 (* v_y_27 256))) (let ((.cse20 (+ .cse21 .cse4))) (or (not (= (mod .cse20 c_~var_1_6~0) 0)) (< .cse7 .cse21) (< (div .cse20 c_~var_1_6~0) 0))))) .cse5) (or (forall ((~var_1_3~0 Int)) (let ((.cse22 (div ~var_1_3~0 c_~var_1_6~0))) (or (< c_~var_1_6~0 ~var_1_3~0) (= .cse22 0) (< .cse22 0)))) .cse0) (or (forall ((~var_1_3~0 Int)) (or (< (+ (div ~var_1_3~0 c_~var_1_6~0) 1) 0) (< 0 (+ ~var_1_3~0 1)) (= (mod ~var_1_3~0 c_~var_1_6~0) 0))) .cse0) (or .cse23 (and (or .cse6 (forall ((v_y_38 Int)) (let ((.cse25 (* v_y_38 256))) (let ((.cse24 (div (+ .cse25 256 .cse4) c_~var_1_6~0))) (or (= .cse24 0) (< .cse24 0) (< .cse7 (+ .cse25 256))))))) (or (forall ((v_y_38 Int)) (let ((.cse27 (* v_y_38 256))) (let ((.cse26 (div (+ .cse27 .cse4) c_~var_1_6~0))) (or (= .cse26 0) (< .cse26 0) (< .cse7 .cse27))))) .cse5))) (or (forall ((v_y_42 Int)) (let ((.cse29 (* v_y_42 256))) (let ((.cse28 (+ .cse29 .cse4))) (or (< (div .cse28 c_~var_1_6~0) 1) (= (mod .cse28 c_~var_1_6~0) 0) (< .cse7 .cse29))))) .cse5) (or .cse23 (and (or (forall ((v_y_17 Int)) (let ((.cse31 (* v_y_17 256))) (let ((.cse30 (+ .cse31 .cse4))) (or (not (= (mod .cse30 c_~var_1_6~0) 0)) (< (div .cse30 c_~var_1_6~0) 0) (< .cse7 .cse31))))) .cse5) (or .cse6 (forall ((v_y_17 Int)) (let ((.cse33 (* v_y_17 256))) (let ((.cse32 (+ .cse33 256 .cse4))) (or (not (= (mod .cse32 c_~var_1_6~0) 0)) (< .cse7 (+ .cse33 256)) (< (div .cse32 c_~var_1_6~0) 0)))))))) (or .cse6 (forall ((v_y_36 Int)) (let ((.cse34 (* v_y_36 256))) (or (< .cse7 (+ .cse34 256)) (< (div (+ .cse34 256 .cse4) c_~var_1_6~0) 0))))) (or .cse6 (forall ((v_y_27 Int)) (let ((.cse36 (* v_y_27 256))) (let ((.cse35 (+ 256 .cse36 .cse4))) (or (< (div .cse35 c_~var_1_6~0) 0) (not (= (mod .cse35 c_~var_1_6~0) 0)) (< .cse7 (+ 256 .cse36))))))) (<= .cse37 0) (or .cse6 (forall ((v_y_34 Int)) (let ((.cse39 (* v_y_34 256))) (let ((.cse38 (+ 256 .cse4 .cse39))) (or (< (div .cse38 c_~var_1_6~0) 0) (not (= (mod .cse38 c_~var_1_6~0) 0)) (< .cse7 (+ 256 .cse39))))))) (or (forall ((v_y_34 Int)) (let ((.cse41 (* v_y_34 256))) (let ((.cse40 (+ .cse4 .cse41))) (or (not (= (mod .cse40 c_~var_1_6~0) 0)) (< (div .cse40 c_~var_1_6~0) 0) (< .cse7 .cse41))))) .cse5) (or (forall ((v_y_36 Int)) (let ((.cse42 (* v_y_36 256))) (or (< (div (+ .cse42 .cse4) c_~var_1_6~0) 0) (< .cse7 .cse42)))) .cse5) (or .cse6 (forall ((v_y_28 Int)) (let ((.cse43 (+ (* v_y_28 256) 256))) (or (< .cse43 .cse2) (< .cse7 .cse43))))) (or .cse23 (and (or (forall ((v_y_41 Int)) (let ((.cse45 (* v_y_41 256))) (let ((.cse44 (+ .cse45 .cse4))) (or (< (div .cse44 c_~var_1_6~0) 1) (= (mod .cse44 c_~var_1_6~0) 0) (< .cse7 .cse45))))) .cse5) (or .cse6 (forall ((v_y_41 Int)) (let ((.cse47 (* v_y_41 256))) (let ((.cse46 (+ 256 .cse47 .cse4))) (or (< (div .cse46 c_~var_1_6~0) 1) (= (mod .cse46 c_~var_1_6~0) 0) (< .cse2 (+ 257 .cse47))))))))))) (not (= .cse49 0))) (or (and (<= (+ c_~var_1_6~0 1) 0) (<= .cse37 .cse49)) (and (<= (+ (div 0 c_~var_1_6~0) 1) .cse49) (<= 0 c_~var_1_6~0)) (and (<= (+ .cse48 1 c_~var_1_7~0) c_~var_1_6~0) (not (= .cse49 .cse2)))))) is different from true [2025-01-09 11:11:44,051 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 277 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 11:11:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:11:45,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:45,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193595027] [2025-01-09 11:11:45,284 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 11:11:45,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765100707] [2025-01-09 11:11:45,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765100707] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 11:11:45,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:11:45,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2025-01-09 11:11:45,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220096114] [2025-01-09 11:11:45,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:45,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:11:45,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:45,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:11:45,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=4, NotChecked=30, Total=306 [2025-01-09 11:11:45,285 INFO L87 Difference]: Start difference. First operand 4163 states and 5677 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-01-09 11:11:51,140 WARN L286 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 295 DAG size of output: 265 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 11:11:53,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 11:11:57,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 11:12:01,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 11:12:05,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1]