./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_allDiff2_ground.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/array-examples/standard_allDiff2_ground.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 45c2395b28f523380bfcff26ce2efb02406d69c6cc122ac9297e3f35ef9c7306 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:00:15,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:00:16,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:00:16,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:00:16,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:00:16,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:00:16,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:00:16,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:00:16,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:00:16,077 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:00:16,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:00:16,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:00:16,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:00:16,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:00:16,079 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:00:16,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:00:16,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:00:16,079 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:00:16,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:00:16,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:00:16,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:00:16,080 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:00:16,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:00:16,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:00:16,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:00:16,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:00:16,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:00:16,081 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:00:16,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:00:16,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:00:16,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:00:16,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:00:16,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:00:16,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:00:16,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:00:16,081 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 -> 45c2395b28f523380bfcff26ce2efb02406d69c6cc122ac9297e3f35ef9c7306 [2025-01-08 22:00:16,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:00:16,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:00:16,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:00:16,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:00:16,309 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:00:16,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_allDiff2_ground.i [2025-01-08 22:00:17,439 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a4e4c6c5/8b6651fabc4545089829dfa6ea98fb86/FLAGf1884df02 [2025-01-08 22:00:17,658 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:00:17,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-examples/standard_allDiff2_ground.i [2025-01-08 22:00:17,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a4e4c6c5/8b6651fabc4545089829dfa6ea98fb86/FLAGf1884df02 [2025-01-08 22:00:17,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a4e4c6c5/8b6651fabc4545089829dfa6ea98fb86 [2025-01-08 22:00:17,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:00:17,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:00:17,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:00:17,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:00:17,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:00:17,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:00:17" (1/1) ... [2025-01-08 22:00:17,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9ded05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:17, skipping insertion in model container [2025-01-08 22:00:17,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:00:17" (1/1) ... [2025-01-08 22:00:18,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:00:18,096 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/array-examples/standard_allDiff2_ground.i[817,830] [2025-01-08 22:00:18,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:00:18,116 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:00:18,124 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/array-examples/standard_allDiff2_ground.i[817,830] [2025-01-08 22:00:18,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:00:18,145 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:00:18,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18 WrapperNode [2025-01-08 22:00:18,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:00:18,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:00:18,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:00:18,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:00:18,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,168 INFO L138 Inliner]: procedures = 16, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2025-01-08 22:00:18,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:00:18,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:00:18,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:00:18,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:00:18,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,195 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-08 22:00:18,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:00:18,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:00:18,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:00:18,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:00:18,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (1/1) ... [2025-01-08 22:00:18,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:00:18,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:18,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:00:18,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:00:18,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:00:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:00:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:00:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:00:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:00:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:00:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:00:18,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:00:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:00:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:00:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:00:18,301 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:00:18,302 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:00:18,399 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-08 22:00:18,399 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:00:18,404 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:00:18,404 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:00:18,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:00:18 BoogieIcfgContainer [2025-01-08 22:00:18,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:00:18,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:00:18,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:00:18,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:00:18,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:00:17" (1/3) ... [2025-01-08 22:00:18,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552b58e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:00:18, skipping insertion in model container [2025-01-08 22:00:18,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:00:18" (2/3) ... [2025-01-08 22:00:18,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552b58e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:00:18, skipping insertion in model container [2025-01-08 22:00:18,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:00:18" (3/3) ... [2025-01-08 22:00:18,410 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_allDiff2_ground.i [2025-01-08 22:00:18,419 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:00:18,419 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_allDiff2_ground.i that has 1 procedures, 18 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-08 22:00:18,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:00:18,457 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;@25d783f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:00:18,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:00:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-08 22:00:18,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:18,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:18,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:18,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:18,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1694021842, now seen corresponding path program 1 times [2025-01-08 22:00:18,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:18,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083709406] [2025-01-08 22:00:18,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:00:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:18,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-08 22:00:18,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-08 22:00:18,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:00:18,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:18,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:00:18,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:18,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083709406] [2025-01-08 22:00:18,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083709406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:00:18,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:00:18,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:00:18,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180686223] [2025-01-08 22:00:18,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:00:18,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:00:18,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:18,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:00:18,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:00:18,627 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:18,659 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2025-01-08 22:00:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:00:18,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-08 22:00:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:18,666 INFO L225 Difference]: With dead ends: 34 [2025-01-08 22:00:18,666 INFO L226 Difference]: Without dead ends: 15 [2025-01-08 22:00:18,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:00:18,673 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:18,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:00:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-08 22:00:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-08 22:00:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-01-08 22:00:18,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 9 [2025-01-08 22:00:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:18,691 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-01-08 22:00:18,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2025-01-08 22:00:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:00:18,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:18,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:18,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:00:18,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:18,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash 61872718, now seen corresponding path program 1 times [2025-01-08 22:00:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:18,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826461051] [2025-01-08 22:00:18,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:00:18,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:18,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:00:18,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:00:18,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:00:18,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:00:18,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:18,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826461051] [2025-01-08 22:00:18,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826461051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:00:18,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:00:18,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:00:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124976948] [2025-01-08 22:00:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:00:18,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:00:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:18,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:00:18,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:00:18,804 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:18,835 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2025-01-08 22:00:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:00:18,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-08 22:00:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:18,836 INFO L225 Difference]: With dead ends: 26 [2025-01-08 22:00:18,836 INFO L226 Difference]: Without dead ends: 19 [2025-01-08 22:00:18,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:00:18,837 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:18,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:00:18,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-08 22:00:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2025-01-08 22:00:18,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-01-08 22:00:18,841 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 10 [2025-01-08 22:00:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:18,842 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-01-08 22:00:18,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2025-01-08 22:00:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-08 22:00:18,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:18,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:18,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:00:18,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:18,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:18,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1392766757, now seen corresponding path program 1 times [2025-01-08 22:00:18,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:18,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981145346] [2025-01-08 22:00:18,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:00:18,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:18,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-08 22:00:18,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-08 22:00:18,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:00:18,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:00:18,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:18,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981145346] [2025-01-08 22:00:18,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981145346] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:18,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568892623] [2025-01-08 22:00:18,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:00:18,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:18,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:18,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:18,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:00:18,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-08 22:00:18,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-08 22:00:18,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:00:18,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:18,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:00:18,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:00:18,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:00:18,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568892623] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:18,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:18,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-08 22:00:18,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155755912] [2025-01-08 22:00:18,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:18,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:00:18,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:18,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:00:19,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:00:19,000 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:19,039 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2025-01-08 22:00:19,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:00:19,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-08 22:00:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:19,040 INFO L225 Difference]: With dead ends: 39 [2025-01-08 22:00:19,041 INFO L226 Difference]: Without dead ends: 27 [2025-01-08 22:00:19,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:00:19,042 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:19,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 71 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:00:19,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-08 22:00:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2025-01-08 22:00:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-01-08 22:00:19,049 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2025-01-08 22:00:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:19,049 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-01-08 22:00:19,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-01-08 22:00:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-08 22:00:19,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:19,050 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:19,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:00:19,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:19,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:19,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:19,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2090159547, now seen corresponding path program 2 times [2025-01-08 22:00:19,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:19,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233363255] [2025-01-08 22:00:19,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:00:19,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:19,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-08 22:00:19,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:00:19,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:00:19,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:00:19,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:19,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233363255] [2025-01-08 22:00:19,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233363255] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:19,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704664218] [2025-01-08 22:00:19,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:00:19,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:19,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:19,356 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:19,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:00:19,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-08 22:00:19,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:00:19,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:00:19,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:19,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:00:19,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:00:19,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:00:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704664218] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:19,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:19,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2025-01-08 22:00:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226467744] [2025-01-08 22:00:19,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:19,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:00:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:19,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:00:19,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=103, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:00:19,497 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:19,582 INFO L93 Difference]: Finished difference Result 70 states and 109 transitions. [2025-01-08 22:00:19,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:00:19,582 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-08 22:00:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:19,583 INFO L225 Difference]: With dead ends: 70 [2025-01-08 22:00:19,583 INFO L226 Difference]: Without dead ends: 57 [2025-01-08 22:00:19,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=103, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:00:19,583 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 77 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:19,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 88 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:00:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-08 22:00:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-08 22:00:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2025-01-08 22:00:19,594 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 15 [2025-01-08 22:00:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:19,594 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2025-01-08 22:00:19,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2025-01-08 22:00:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-08 22:00:19,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:19,595 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:19,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:00:19,795 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-08 22:00:19,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:19,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash -780990173, now seen corresponding path program 3 times [2025-01-08 22:00:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:19,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627464373] [2025-01-08 22:00:19,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:00:19,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:19,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 10 equivalence classes. [2025-01-08 22:00:19,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 37 statements. [2025-01-08 22:00:19,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:00:19,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:19,866 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-01-08 22:00:19,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:19,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627464373] [2025-01-08 22:00:19,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627464373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:00:19,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:00:19,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:00:19,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131777643] [2025-01-08 22:00:19,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:00:19,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:00:19,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:19,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:00:19,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:00:19,867 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:19,922 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2025-01-08 22:00:19,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:00:19,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-08 22:00:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:19,923 INFO L225 Difference]: With dead ends: 134 [2025-01-08 22:00:19,924 INFO L226 Difference]: Without dead ends: 127 [2025-01-08 22:00:19,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:00:19,925 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:19,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 36 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:00:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-08 22:00:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 58. [2025-01-08 22:00:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2025-01-08 22:00:19,936 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 37 [2025-01-08 22:00:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:19,937 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2025-01-08 22:00:19,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:19,937 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2025-01-08 22:00:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-08 22:00:19,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:19,938 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:19,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:00:19,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:19,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash -629692019, now seen corresponding path program 1 times [2025-01-08 22:00:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:19,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194955540] [2025-01-08 22:00:19,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:00:19,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:19,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-08 22:00:19,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-08 22:00:19,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:00:19,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-01-08 22:00:20,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:20,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194955540] [2025-01-08 22:00:20,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194955540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:00:20,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:00:20,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:00:20,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010342735] [2025-01-08 22:00:20,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:00:20,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:00:20,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:20,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:00:20,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:00:20,049 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:20,076 INFO L93 Difference]: Finished difference Result 100 states and 142 transitions. [2025-01-08 22:00:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:00:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-01-08 22:00:20,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:20,077 INFO L225 Difference]: With dead ends: 100 [2025-01-08 22:00:20,077 INFO L226 Difference]: Without dead ends: 59 [2025-01-08 22:00:20,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:00:20,078 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:20,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:00:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-08 22:00:20,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-08 22:00:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2025-01-08 22:00:20,086 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 40 [2025-01-08 22:00:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:20,086 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2025-01-08 22:00:20,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2025-01-08 22:00:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:00:20,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:20,087 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:20,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:00:20,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:20,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 880435987, now seen corresponding path program 2 times [2025-01-08 22:00:20,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:20,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985714450] [2025-01-08 22:00:20,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:00:20,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:20,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-08 22:00:20,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:00:20,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:00:20,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-01-08 22:00:20,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:20,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985714450] [2025-01-08 22:00:20,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985714450] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:20,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582119311] [2025-01-08 22:00:20,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:00:20,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:20,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:20,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:20,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:00:20,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-08 22:00:20,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:00:20,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:00:20,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:20,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:00:20,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-01-08 22:00:20,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-01-08 22:00:20,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582119311] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:20,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:20,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-08 22:00:20,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404542423] [2025-01-08 22:00:20,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:20,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-08 22:00:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:20,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-08 22:00:20,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-08 22:00:20,575 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:20,722 INFO L93 Difference]: Finished difference Result 190 states and 293 transitions. [2025-01-08 22:00:20,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-08 22:00:20,722 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-01-08 22:00:20,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:20,725 INFO L225 Difference]: With dead ends: 190 [2025-01-08 22:00:20,727 INFO L226 Difference]: Without dead ends: 144 [2025-01-08 22:00:20,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-08 22:00:20,728 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 235 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:20,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 143 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:00:20,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-08 22:00:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 71. [2025-01-08 22:00:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2025-01-08 22:00:20,749 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 43 [2025-01-08 22:00:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:20,749 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2025-01-08 22:00:20,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2025-01-08 22:00:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-08 22:00:20,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:20,750 INFO L218 NwaCegarLoop]: trace histogram [22, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:20,756 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-08 22:00:20,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:20,951 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:20,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1757133587, now seen corresponding path program 3 times [2025-01-08 22:00:20,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:20,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656127017] [2025-01-08 22:00:20,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:00:20,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:20,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 12 equivalence classes. [2025-01-08 22:00:20,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 27 of 55 statements. [2025-01-08 22:00:20,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-08 22:00:20,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-08 22:00:21,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:21,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656127017] [2025-01-08 22:00:21,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656127017] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:21,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809808685] [2025-01-08 22:00:21,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:00:21,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:21,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:21,040 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:21,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:00:21,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 12 equivalence classes. [2025-01-08 22:00:21,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 27 of 55 statements. [2025-01-08 22:00:21,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-08 22:00:21,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:21,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:00:21,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-08 22:00:21,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-08 22:00:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809808685] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:21,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-01-08 22:00:21,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767120691] [2025-01-08 22:00:21,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:21,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-08 22:00:21,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:21,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-08 22:00:21,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:00:21,209 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:21,368 INFO L93 Difference]: Finished difference Result 333 states and 518 transitions. [2025-01-08 22:00:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-08 22:00:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-01-08 22:00:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:21,370 INFO L225 Difference]: With dead ends: 333 [2025-01-08 22:00:21,370 INFO L226 Difference]: Without dead ends: 326 [2025-01-08 22:00:21,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:00:21,371 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:21,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 72 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:00:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-08 22:00:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 92. [2025-01-08 22:00:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 91 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2025-01-08 22:00:21,391 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 55 [2025-01-08 22:00:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:21,391 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2025-01-08 22:00:21,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2025-01-08 22:00:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-08 22:00:21,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:21,392 INFO L218 NwaCegarLoop]: trace histogram [22, 9, 9, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:21,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 22:00:21,597 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,SelfDestructingSolverStorable7 [2025-01-08 22:00:21,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:21,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:21,598 INFO L85 PathProgramCache]: Analyzing trace with hash 872996317, now seen corresponding path program 4 times [2025-01-08 22:00:21,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:21,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086352540] [2025-01-08 22:00:21,598 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:00:21,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:21,620 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 64 statements into 2 equivalence classes. [2025-01-08 22:00:21,634 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-01-08 22:00:21,635 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:00:21,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 7 proven. 133 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-08 22:00:21,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:21,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086352540] [2025-01-08 22:00:21,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086352540] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:21,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971425183] [2025-01-08 22:00:21,875 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:00:21,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:21,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:21,877 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:21,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:00:21,933 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 64 statements into 2 equivalence classes. [2025-01-08 22:00:21,970 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-01-08 22:00:21,970 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:00:21,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:21,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:00:21,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-08 22:00:22,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-08 22:00:22,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971425183] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:22,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:22,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-08 22:00:22,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912469442] [2025-01-08 22:00:22,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:22,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-08 22:00:22,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:22,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-08 22:00:22,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=339, Unknown=0, NotChecked=0, Total=600 [2025-01-08 22:00:22,221 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:22,487 INFO L93 Difference]: Finished difference Result 435 states and 685 transitions. [2025-01-08 22:00:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-08 22:00:22,488 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-08 22:00:22,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:22,489 INFO L225 Difference]: With dead ends: 435 [2025-01-08 22:00:22,489 INFO L226 Difference]: Without dead ends: 427 [2025-01-08 22:00:22,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=453, Invalid=603, Unknown=0, NotChecked=0, Total=1056 [2025-01-08 22:00:22,491 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 230 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:22,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 125 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:00:22,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-08 22:00:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 136. [2025-01-08 22:00:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4370370370370371) internal successors, (194), 135 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2025-01-08 22:00:22,522 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 64 [2025-01-08 22:00:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:22,523 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2025-01-08 22:00:22,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2025-01-08 22:00:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-08 22:00:22,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:22,524 INFO L218 NwaCegarLoop]: trace histogram [22, 20, 20, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:22,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 22:00:22,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:22,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:22,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1240513388, now seen corresponding path program 5 times [2025-01-08 22:00:22,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:22,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526451633] [2025-01-08 22:00:22,726 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:00:22,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:22,748 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 86 statements into 24 equivalence classes. [2025-01-08 22:00:22,782 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) and asserted 58 of 86 statements. [2025-01-08 22:00:22,782 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2025-01-08 22:00:22,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 329 proven. 26 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2025-01-08 22:00:22,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:22,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526451633] [2025-01-08 22:00:22,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526451633] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:22,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994489864] [2025-01-08 22:00:22,889 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:00:22,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:22,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:22,895 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:22,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:00:22,954 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 86 statements into 24 equivalence classes. [2025-01-08 22:00:23,028 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) and asserted 58 of 86 statements. [2025-01-08 22:00:23,028 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2025-01-08 22:00:23,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:23,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:00:23,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 329 proven. 26 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2025-01-08 22:00:23,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 321 proven. 34 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2025-01-08 22:00:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994489864] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:23,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:23,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-01-08 22:00:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280837549] [2025-01-08 22:00:23,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:23,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:00:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:23,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:00:23,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:00:23,121 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:23,214 INFO L93 Difference]: Finished difference Result 388 states and 592 transitions. [2025-01-08 22:00:23,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 22:00:23,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-01-08 22:00:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:23,215 INFO L225 Difference]: With dead ends: 388 [2025-01-08 22:00:23,215 INFO L226 Difference]: Without dead ends: 279 [2025-01-08 22:00:23,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:00:23,216 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:23,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 52 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:00:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-08 22:00:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 238. [2025-01-08 22:00:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.459915611814346) internal successors, (346), 237 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 346 transitions. [2025-01-08 22:00:23,251 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 346 transitions. Word has length 86 [2025-01-08 22:00:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:23,251 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 346 transitions. [2025-01-08 22:00:23,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 346 transitions. [2025-01-08 22:00:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-08 22:00:23,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:23,252 INFO L218 NwaCegarLoop]: trace histogram [22, 20, 20, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:23,259 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-08 22:00:23,457 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,SelfDestructingSolverStorable9 [2025-01-08 22:00:23,457 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:23,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1233340706, now seen corresponding path program 6 times [2025-01-08 22:00:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:23,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941740266] [2025-01-08 22:00:23,458 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:00:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:23,472 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 89 statements into 24 equivalence classes. [2025-01-08 22:00:23,521 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 54 of 89 statements. [2025-01-08 22:00:23,521 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-01-08 22:00:23,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 141 proven. 22 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2025-01-08 22:00:23,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941740266] [2025-01-08 22:00:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941740266] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309614767] [2025-01-08 22:00:23,634 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:00:23,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:23,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:23,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:23,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 22:00:23,696 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 89 statements into 24 equivalence classes. [2025-01-08 22:00:23,789 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 54 of 89 statements. [2025-01-08 22:00:23,790 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-01-08 22:00:23,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:23,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:00:23,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 141 proven. 22 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2025-01-08 22:00:23,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 141 proven. 22 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2025-01-08 22:00:23,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309614767] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:23,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:23,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-01-08 22:00:23,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357565102] [2025-01-08 22:00:23,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:23,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-08 22:00:23,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:23,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-08 22:00:23,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:00:23,919 INFO L87 Difference]: Start difference. First operand 238 states and 346 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:24,334 INFO L93 Difference]: Finished difference Result 1668 states and 2677 transitions. [2025-01-08 22:00:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-08 22:00:24,335 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-08 22:00:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:24,340 INFO L225 Difference]: With dead ends: 1668 [2025-01-08 22:00:24,341 INFO L226 Difference]: Without dead ends: 1661 [2025-01-08 22:00:24,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=334, Invalid=596, Unknown=0, NotChecked=0, Total=930 [2025-01-08 22:00:24,342 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:24,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 105 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:00:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2025-01-08 22:00:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 274. [2025-01-08 22:00:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.4871794871794872) internal successors, (406), 273 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 406 transitions. [2025-01-08 22:00:24,402 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 406 transitions. Word has length 89 [2025-01-08 22:00:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:24,402 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 406 transitions. [2025-01-08 22:00:24,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 406 transitions. [2025-01-08 22:00:24,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-08 22:00:24,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:24,403 INFO L218 NwaCegarLoop]: trace histogram [22, 20, 20, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:24,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-08 22:00:24,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:24,604 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:24,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:24,604 INFO L85 PathProgramCache]: Analyzing trace with hash -737608354, now seen corresponding path program 7 times [2025-01-08 22:00:24,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:24,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559893783] [2025-01-08 22:00:24,604 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:00:24,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:24,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-08 22:00:24,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-08 22:00:24,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:00:24,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-01-08 22:00:25,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:25,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559893783] [2025-01-08 22:00:25,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559893783] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:25,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361955661] [2025-01-08 22:00:25,109 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:00:25,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:25,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:25,111 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:25,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 22:00:25,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-08 22:00:25,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-08 22:00:25,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:00:25,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:25,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-08 22:00:25,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-01-08 22:00:25,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-01-08 22:00:25,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361955661] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:25,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:25,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-01-08 22:00:25,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657257088] [2025-01-08 22:00:25,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:25,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-08 22:00:25,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:25,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-08 22:00:25,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-01-08 22:00:25,787 INFO L87 Difference]: Start difference. First operand 274 states and 406 transitions. Second operand has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:26,241 INFO L93 Difference]: Finished difference Result 1930 states and 3094 transitions. [2025-01-08 22:00:26,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-08 22:00:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-01-08 22:00:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:26,247 INFO L225 Difference]: With dead ends: 1930 [2025-01-08 22:00:26,247 INFO L226 Difference]: Without dead ends: 1681 [2025-01-08 22:00:26,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-01-08 22:00:26,248 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 665 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:26,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 197 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:00:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2025-01-08 22:00:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 298. [2025-01-08 22:00:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4478114478114479) internal successors, (430), 297 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 430 transitions. [2025-01-08 22:00:26,297 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 430 transitions. Word has length 107 [2025-01-08 22:00:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:26,297 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 430 transitions. [2025-01-08 22:00:26,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 430 transitions. [2025-01-08 22:00:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-08 22:00:26,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:26,298 INFO L218 NwaCegarLoop]: trace histogram [46, 20, 20, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:26,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-08 22:00:26,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:26,502 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:26,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1614303906, now seen corresponding path program 8 times [2025-01-08 22:00:26,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:26,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507696561] [2025-01-08 22:00:26,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:00:26,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:26,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 131 statements into 2 equivalence classes. [2025-01-08 22:00:26,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 131 of 131 statements. [2025-01-08 22:00:26,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:00:26,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1919 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-01-08 22:00:27,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:27,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507696561] [2025-01-08 22:00:27,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507696561] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:27,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946972521] [2025-01-08 22:00:27,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:00:27,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:27,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:27,874 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:27,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 22:00:27,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 131 statements into 2 equivalence classes. [2025-01-08 22:00:28,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 131 of 131 statements. [2025-01-08 22:00:28,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:00:28,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:28,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-08 22:00:28,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1919 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-01-08 22:00:28,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1919 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-01-08 22:00:29,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946972521] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:29,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:29,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2025-01-08 22:00:29,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311821052] [2025-01-08 22:00:29,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:29,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-01-08 22:00:29,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:29,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-01-08 22:00:29,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-01-08 22:00:29,906 INFO L87 Difference]: Start difference. First operand 298 states and 430 transitions. Second operand has 97 states, 97 states have (on average 1.134020618556701) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:31,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:31,925 INFO L93 Difference]: Finished difference Result 4618 states and 7486 transitions. [2025-01-08 22:00:31,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-08 22:00:31,926 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.134020618556701) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-08 22:00:31,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:31,937 INFO L225 Difference]: With dead ends: 4618 [2025-01-08 22:00:31,937 INFO L226 Difference]: Without dead ends: 4369 [2025-01-08 22:00:31,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-01-08 22:00:31,940 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1615 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1615 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:31,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1615 Valid, 350 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:00:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4369 states. [2025-01-08 22:00:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4369 to 346. [2025-01-08 22:00:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.3855072463768117) internal successors, (478), 345 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 478 transitions. [2025-01-08 22:00:32,010 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 478 transitions. Word has length 131 [2025-01-08 22:00:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:32,010 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 478 transitions. [2025-01-08 22:00:32,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.134020618556701) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 478 transitions. [2025-01-08 22:00:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-08 22:00:32,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:32,012 INFO L218 NwaCegarLoop]: trace histogram [94, 20, 20, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:32,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-08 22:00:32,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:32,213 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:32,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:32,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2014645598, now seen corresponding path program 9 times [2025-01-08 22:00:32,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:32,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833459216] [2025-01-08 22:00:32,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:00:32,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:32,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 179 statements into 48 equivalence classes. [2025-01-08 22:00:32,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 52 of 179 statements. [2025-01-08 22:00:32,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-08 22:00:32,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5303 backedges. 148 proven. 3 refuted. 0 times theorem prover too weak. 5152 trivial. 0 not checked. [2025-01-08 22:00:32,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833459216] [2025-01-08 22:00:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833459216] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397969321] [2025-01-08 22:00:32,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:00:32,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:32,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:32,341 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:32,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 22:00:32,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 179 statements into 48 equivalence classes. [2025-01-08 22:00:32,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 52 of 179 statements. [2025-01-08 22:00:32,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-08 22:00:32,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:32,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:00:32,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5303 backedges. 148 proven. 2 refuted. 0 times theorem prover too weak. 5153 trivial. 0 not checked. [2025-01-08 22:00:32,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5303 backedges. 148 proven. 2 refuted. 0 times theorem prover too weak. 5153 trivial. 0 not checked. [2025-01-08 22:00:32,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397969321] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:32,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:32,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-01-08 22:00:32,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562529561] [2025-01-08 22:00:32,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:32,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 22:00:32,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:32,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 22:00:32,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:00:32,617 INFO L87 Difference]: Start difference. First operand 346 states and 478 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:32,759 INFO L93 Difference]: Finished difference Result 551 states and 810 transitions. [2025-01-08 22:00:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:00:32,759 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2025-01-08 22:00:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:32,761 INFO L225 Difference]: With dead ends: 551 [2025-01-08 22:00:32,761 INFO L226 Difference]: Without dead ends: 312 [2025-01-08 22:00:32,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:00:32,762 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:32,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 77 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:00:32,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-01-08 22:00:32,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2025-01-08 22:00:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.2990353697749195) internal successors, (404), 311 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 404 transitions. [2025-01-08 22:00:32,837 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 404 transitions. Word has length 179 [2025-01-08 22:00:32,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:32,838 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 404 transitions. [2025-01-08 22:00:32,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 404 transitions. [2025-01-08 22:00:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-01-08 22:00:32,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:32,840 INFO L218 NwaCegarLoop]: trace histogram [94, 47, 47, 47, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:32,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-08 22:00:33,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-08 22:00:33,040 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:33,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:33,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1244257364, now seen corresponding path program 10 times [2025-01-08 22:00:33,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:33,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647260809] [2025-01-08 22:00:33,041 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:00:33,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:33,083 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 284 statements into 2 equivalence classes. [2025-01-08 22:00:33,156 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 284 of 284 statements. [2025-01-08 22:00:33,156 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:00:33,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9048 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4583 trivial. 0 not checked. [2025-01-08 22:00:37,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:37,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647260809] [2025-01-08 22:00:37,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647260809] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:37,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167371789] [2025-01-08 22:00:37,137 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:00:37,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:37,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:37,139 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:37,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-08 22:00:37,294 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 284 statements into 2 equivalence classes. [2025-01-08 22:00:37,421 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 284 of 284 statements. [2025-01-08 22:00:37,421 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:00:37,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:37,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-08 22:00:37,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9048 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 4701 trivial. 0 not checked. [2025-01-08 22:00:37,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9048 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 4701 trivial. 0 not checked. [2025-01-08 22:00:38,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167371789] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:38,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:38,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 24, 24] total 119 [2025-01-08 22:00:38,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887439291] [2025-01-08 22:00:38,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:38,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2025-01-08 22:00:38,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:38,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2025-01-08 22:00:38,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6905, Invalid=7137, Unknown=0, NotChecked=0, Total=14042 [2025-01-08 22:00:38,785 INFO L87 Difference]: Start difference. First operand 312 states and 404 transitions. Second operand has 119 states, 119 states have (on average 2.6470588235294117) internal successors, (315), 119 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:42,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:42,757 INFO L93 Difference]: Finished difference Result 5302 states and 8262 transitions. [2025-01-08 22:00:42,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2025-01-08 22:00:42,758 INFO L78 Accepts]: Start accepts. Automaton has has 119 states, 119 states have (on average 2.6470588235294117) internal successors, (315), 119 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 284 [2025-01-08 22:00:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:42,769 INFO L225 Difference]: With dead ends: 5302 [2025-01-08 22:00:42,770 INFO L226 Difference]: Without dead ends: 5086 [2025-01-08 22:00:42,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=6905, Invalid=7137, Unknown=0, NotChecked=0, Total=14042 [2025-01-08 22:00:42,773 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1837 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1837 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:42,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1837 Valid, 415 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:00:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5086 states. [2025-01-08 22:00:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5086 to 1094. [2025-01-08 22:00:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1093 states have (on average 1.3458371454711802) internal successors, (1471), 1093 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1471 transitions. [2025-01-08 22:00:43,806 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1471 transitions. Word has length 284 [2025-01-08 22:00:43,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:43,807 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1471 transitions. [2025-01-08 22:00:43,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 119 states have (on average 2.6470588235294117) internal successors, (315), 119 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1471 transitions. [2025-01-08 22:00:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2025-01-08 22:00:43,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:43,822 INFO L218 NwaCegarLoop]: trace histogram [237, 237, 237, 116, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:43,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-08 22:00:44,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-08 22:00:44,022 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:44,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:44,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1091002431, now seen corresponding path program 11 times [2025-01-08 22:00:44,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:44,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306993536] [2025-01-08 22:00:44,023 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:00:44,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:44,079 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1066 statements into 307 equivalence classes. [2025-01-08 22:00:44,082 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 16 of 1066 statements. [2025-01-08 22:00:44,082 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-08 22:00:44,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 131164 backedges. 57049 proven. 26 refuted. 0 times theorem prover too weak. 74089 trivial. 0 not checked. [2025-01-08 22:00:44,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:44,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306993536] [2025-01-08 22:00:44,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306993536] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:44,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975678085] [2025-01-08 22:00:44,133 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:00:44,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:44,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:44,140 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:44,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-08 22:00:44,438 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1066 statements into 307 equivalence classes. [2025-01-08 22:00:44,446 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 16 of 1066 statements. [2025-01-08 22:00:44,446 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-08 22:00:44,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:44,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:00:44,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 131164 backedges. 57049 proven. 26 refuted. 0 times theorem prover too weak. 74089 trivial. 0 not checked. [2025-01-08 22:00:44,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 131164 backedges. 57053 proven. 22 refuted. 0 times theorem prover too weak. 74089 trivial. 0 not checked. [2025-01-08 22:00:44,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975678085] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:44,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:44,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2025-01-08 22:00:44,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358710934] [2025-01-08 22:00:44,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:44,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:00:44,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:44,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:00:44,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:00:44,589 INFO L87 Difference]: Start difference. First operand 1094 states and 1471 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:47,000 INFO L93 Difference]: Finished difference Result 3184 states and 4491 transitions. [2025-01-08 22:00:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-08 22:00:47,000 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1066 [2025-01-08 22:00:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:47,005 INFO L225 Difference]: With dead ends: 3184 [2025-01-08 22:00:47,005 INFO L226 Difference]: Without dead ends: 2230 [2025-01-08 22:00:47,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2159 GetRequests, 2131 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2025-01-08 22:00:47,007 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:47,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 78 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:00:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2025-01-08 22:00:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1427. [2025-01-08 22:00:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.3408134642356242) internal successors, (1912), 1426 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1912 transitions. [2025-01-08 22:00:48,607 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1912 transitions. Word has length 1066 [2025-01-08 22:00:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:48,608 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1912 transitions. [2025-01-08 22:00:48,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1912 transitions. [2025-01-08 22:00:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1403 [2025-01-08 22:00:48,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:48,639 INFO L218 NwaCegarLoop]: trace histogram [349, 349, 349, 116, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:48,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-08 22:00:48,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:48,840 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:48,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1290241649, now seen corresponding path program 12 times [2025-01-08 22:00:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:48,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331010806] [2025-01-08 22:00:48,841 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:00:48,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:48,934 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1402 statements into 417 equivalence classes. [2025-01-08 22:00:48,966 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 64 of 1402 statements. [2025-01-08 22:00:48,966 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-01-08 22:00:48,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 242324 backedges. 108095 proven. 53 refuted. 0 times theorem prover too weak. 134176 trivial. 0 not checked. [2025-01-08 22:00:49,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:00:49,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331010806] [2025-01-08 22:00:49,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331010806] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:00:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5785829] [2025-01-08 22:00:49,104 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:00:49,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:00:49,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:00:49,105 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:00:49,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-08 22:00:49,430 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1402 statements into 417 equivalence classes. [2025-01-08 22:00:49,574 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 64 of 1402 statements. [2025-01-08 22:00:49,574 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-01-08 22:00:49,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:00:49,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:00:49,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:00:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 242324 backedges. 108095 proven. 53 refuted. 0 times theorem prover too weak. 134176 trivial. 0 not checked. [2025-01-08 22:00:49,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:00:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 242324 backedges. 108102 proven. 46 refuted. 0 times theorem prover too weak. 134176 trivial. 0 not checked. [2025-01-08 22:00:49,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5785829] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:00:49,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:00:49,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 19 [2025-01-08 22:00:49,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861786120] [2025-01-08 22:00:49,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:00:49,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-08 22:00:49,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:00:49,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-08 22:00:49,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:00:49,740 INFO L87 Difference]: Start difference. First operand 1427 states and 1912 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:00:54,164 INFO L93 Difference]: Finished difference Result 4690 states and 6584 transitions. [2025-01-08 22:00:54,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-08 22:00:54,164 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1402 [2025-01-08 22:00:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:00:54,172 INFO L225 Difference]: With dead ends: 4690 [2025-01-08 22:00:54,172 INFO L226 Difference]: Without dead ends: 3406 [2025-01-08 22:00:54,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2845 GetRequests, 2805 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2025-01-08 22:00:54,174 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 67 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:00:54,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 185 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:00:54,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2025-01-08 22:00:56,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 1764. [2025-01-08 22:00:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 1.3380601247872943) internal successors, (2359), 1763 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2359 transitions. [2025-01-08 22:00:56,339 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2359 transitions. Word has length 1402 [2025-01-08 22:00:56,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:00:56,339 INFO L471 AbstractCegarLoop]: Abstraction has 1764 states and 2359 transitions. [2025-01-08 22:00:56,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:00:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2359 transitions. [2025-01-08 22:00:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1736 [2025-01-08 22:00:56,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:00:56,352 INFO L218 NwaCegarLoop]: trace histogram [460, 460, 460, 116, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:00:56,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-08 22:00:56,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-08 22:00:56,553 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:00:56,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:00:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1995997969, now seen corresponding path program 13 times [2025-01-08 22:00:56,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:00:56,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522018076] [2025-01-08 22:00:56,554 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:00:56,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:00:56,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1735 statements into 1 equivalence classes. [2025-01-08 22:00:56,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1735 of 1735 statements. [2025-01-08 22:00:56,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:00:56,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:01:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 389621 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 382835 trivial. 0 not checked. [2025-01-08 22:01:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:01:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522018076] [2025-01-08 22:01:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522018076] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:01:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481362477] [2025-01-08 22:01:12,653 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:01:12,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:01:12,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:01:12,655 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:01:12,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-08 22:01:13,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1735 statements into 1 equivalence classes. [2025-01-08 22:01:13,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1735 of 1735 statements. [2025-01-08 22:01:13,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:01:13,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:01:13,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 7424 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-01-08 22:01:13,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:01:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 389621 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 382835 trivial. 0 not checked. [2025-01-08 22:01:13,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:01:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 389621 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 382835 trivial. 0 not checked. [2025-01-08 22:01:23,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481362477] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:01:23,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:01:23,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 237 [2025-01-08 22:01:23,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493169452] [2025-01-08 22:01:23,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:01:23,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 237 states [2025-01-08 22:01:23,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:01:23,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 237 interpolants. [2025-01-08 22:01:23,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27966, Invalid=27966, Unknown=0, NotChecked=0, Total=55932 [2025-01-08 22:01:23,821 INFO L87 Difference]: Start difference. First operand 1764 states and 2359 transitions. Second operand has 237 states, 237 states have (on average 1.0548523206751055) internal successors, (250), 237 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)