./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/sep05-1.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/reducercommutativity/sep05-1.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 ac50477087b7e2b9c80860ad42d4d46d99ddf32e797cee205c21d5ff44f08ec3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:15:01,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:15:01,119 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:15:01,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:15:01,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:15:01,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:15:01,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:15:01,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:15:01,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:15:01,150 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:15:01,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:15:01,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:15:01,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:15:01,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:15:01,151 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:15:01,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:15:01,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:15:01,152 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:15:01,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:15:01,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:15:01,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:15:01,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:15:01,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:15:01,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:15:01,153 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:15:01,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:15:01,153 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:15:01,153 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:15:01,153 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:15:01,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:15:01,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:15:01,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:15:01,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:15:01,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:15:01,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:15:01,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:15:01,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:15:01,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:15:01,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:15:01,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:15:01,154 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:15:01,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:15:01,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:15:01,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:15:01,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:15:01,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:15:01,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:15:01,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:15:01,155 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 -> ac50477087b7e2b9c80860ad42d4d46d99ddf32e797cee205c21d5ff44f08ec3 [2025-01-08 22:15:01,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:15:01,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:15:01,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:15:01,506 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:15:01,506 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:15:01,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep05-1.i [2025-01-08 22:15:02,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a1e11a03/14de736615094f79a10b5e4057681d48/FLAGb59354e6b [2025-01-08 22:15:02,871 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:15:02,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep05-1.i [2025-01-08 22:15:02,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a1e11a03/14de736615094f79a10b5e4057681d48/FLAGb59354e6b [2025-01-08 22:15:02,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a1e11a03/14de736615094f79a10b5e4057681d48 [2025-01-08 22:15:02,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:15:02,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:15:02,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:15:02,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:15:02,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:15:02,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:15:02" (1/1) ... [2025-01-08 22:15:02,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5861885e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:02, skipping insertion in model container [2025-01-08 22:15:02,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:15:02" (1/1) ... [2025-01-08 22:15:02,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:15:03,002 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/reducercommutativity/sep05-1.i[1287,1300] [2025-01-08 22:15:03,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:15:03,012 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:15:03,028 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/reducercommutativity/sep05-1.i[1287,1300] [2025-01-08 22:15:03,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:15:03,042 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:15:03,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03 WrapperNode [2025-01-08 22:15:03,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:15:03,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:15:03,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:15:03,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:15:03,047 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:15:03" (1/1) ... [2025-01-08 22:15:03,051 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:15:03" (1/1) ... [2025-01-08 22:15:03,060 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2025-01-08 22:15:03,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:15:03,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:15:03,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:15:03,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:15:03,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03" (1/1) ... [2025-01-08 22:15:03,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03" (1/1) ... [2025-01-08 22:15:03,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03" (1/1) ... [2025-01-08 22:15:03,073 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-01-08 22:15:03,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03" (1/1) ... [2025-01-08 22:15:03,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03" (1/1) ... [2025-01-08 22:15:03,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03" (1/1) ... [2025-01-08 22:15:03,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03" (1/1) ... [2025-01-08 22:15:03,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03" (1/1) ... [2025-01-08 22:15:03,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03" (1/1) ... [2025-01-08 22:15:03,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03" (1/1) ... [2025-01-08 22:15:03,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:15:03,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:15:03,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:15:03,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:15:03,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03" (1/1) ... [2025-01-08 22:15:03,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:15:03,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:15:03,101 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:15:03,109 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:15:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:15:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:15:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:15:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:15:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:15:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:15:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:15:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:15:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:15:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:15:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:15:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2025-01-08 22:15:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2025-01-08 22:15:03,167 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:15:03,168 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:15:03,259 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-08 22:15:03,259 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:15:03,264 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:15:03,265 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:15:03,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:15:03 BoogieIcfgContainer [2025-01-08 22:15:03,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:15:03,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:15:03,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:15:03,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:15:03,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:15:02" (1/3) ... [2025-01-08 22:15:03,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee6becb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:15:03, skipping insertion in model container [2025-01-08 22:15:03,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:15:03" (2/3) ... [2025-01-08 22:15:03,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee6becb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:15:03, skipping insertion in model container [2025-01-08 22:15:03,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:15:03" (3/3) ... [2025-01-08 22:15:03,271 INFO L128 eAbstractionObserver]: Analyzing ICFG sep05-1.i [2025-01-08 22:15:03,280 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:15:03,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sep05-1.i that has 2 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-08 22:15:03,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:15:03,316 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;@51050623, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:15:03,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:15:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:15:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:15:03,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:15:03,322 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:15:03,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:15:03,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:15:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2031379065, now seen corresponding path program 1 times [2025-01-08 22:15:03,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:15:03,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289462542] [2025-01-08 22:15:03,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:15:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:15:03,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:15:03,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:15:03,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:15:03,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:15:03,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:15:03,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289462542] [2025-01-08 22:15:03,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289462542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:15:03,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:15:03,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:15:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146545806] [2025-01-08 22:15:03,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:15:03,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:15:03,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:15:03,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:15:03,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:15:03,514 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:15:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:15:03,538 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2025-01-08 22:15:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:15:03,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-01-08 22:15:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:15:03,546 INFO L225 Difference]: With dead ends: 44 [2025-01-08 22:15:03,546 INFO L226 Difference]: Without dead ends: 20 [2025-01-08 22:15:03,547 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:15:03,549 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:15:03,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:15:03,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-08 22:15:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-08 22:15:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:15:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-01-08 22:15:03,573 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 24 [2025-01-08 22:15:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:15:03,573 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-01-08 22:15:03,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:15:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-01-08 22:15:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:15:03,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:15:03,575 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:15:03,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:15:03,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:15:03,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:15:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 626927207, now seen corresponding path program 1 times [2025-01-08 22:15:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:15:03,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120322362] [2025-01-08 22:15:03,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:15:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:15:03,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:15:03,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:15:03,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:15:03,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:15:03,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:15:03,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120322362] [2025-01-08 22:15:03,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120322362] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:15:03,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667355437] [2025-01-08 22:15:03,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:15:03,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:03,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:15:03,695 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:15:03,696 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:15:03,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:15:03,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:15:03,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:15:03,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:03,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:15:03,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:15:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:15:03,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:15:03,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667355437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:15:03,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:15:03,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:15:03,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637067103] [2025-01-08 22:15:03,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:15:03,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:15:03,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:15:03,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:15:03,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:15:03,778 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:15:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:15:03,786 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2025-01-08 22:15:03,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:15:03,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-01-08 22:15:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:15:03,787 INFO L225 Difference]: With dead ends: 38 [2025-01-08 22:15:03,787 INFO L226 Difference]: Without dead ends: 23 [2025-01-08 22:15:03,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:15:03,788 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:15:03,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:15:03,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-08 22:15:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-01-08 22:15:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:15:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-01-08 22:15:03,791 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 25 [2025-01-08 22:15:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:15:03,791 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-01-08 22:15:03,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:15:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-01-08 22:15:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-08 22:15:03,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:15:03,792 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:15:03,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:15:03,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:03,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:15:03,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:15:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1760474482, now seen corresponding path program 1 times [2025-01-08 22:15:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:15:03,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300613930] [2025-01-08 22:15:03,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:15:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:15:04,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-08 22:15:04,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-08 22:15:04,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:15:04,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-08 22:15:04,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:15:04,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300613930] [2025-01-08 22:15:04,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300613930] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:15:04,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610340881] [2025-01-08 22:15:04,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:15:04,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:04,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:15:04,148 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:15:04,154 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:15:04,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-08 22:15:04,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-08 22:15:04,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:15:04,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:04,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:15:04,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:15:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:15:04,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:15:04,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610340881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:15:04,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:15:04,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:15:04,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954690148] [2025-01-08 22:15:04,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:15:04,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:15:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:15:04,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:15:04,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:15:04,251 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:15:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:15:04,258 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-01-08 22:15:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:15:04,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-01-08 22:15:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:15:04,259 INFO L225 Difference]: With dead ends: 34 [2025-01-08 22:15:04,259 INFO L226 Difference]: Without dead ends: 22 [2025-01-08 22:15:04,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:15:04,260 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:15:04,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:15:04,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-08 22:15:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-08 22:15:04,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:15:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-01-08 22:15:04,264 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 34 [2025-01-08 22:15:04,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:15:04,265 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-01-08 22:15:04,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:15:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-01-08 22:15:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-08 22:15:04,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:15:04,267 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:15:04,273 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:15:04,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:04,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:15:04,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:15:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1174703444, now seen corresponding path program 1 times [2025-01-08 22:15:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:15:04,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814031968] [2025-01-08 22:15:04,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:15:04,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:15:04,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-08 22:15:04,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:15:04,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:15:04,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-08 22:15:04,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:15:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814031968] [2025-01-08 22:15:04,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814031968] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:15:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046256345] [2025-01-08 22:15:04,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:15:04,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:04,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:15:04,576 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:15:04,580 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:15:04,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-08 22:15:04,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:15:04,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:15:04,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:04,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:15:04,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:15:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-08 22:15:04,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:15:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-08 22:15:04,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046256345] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:15:04,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:15:04,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-08 22:15:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570187065] [2025-01-08 22:15:04,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:15:04,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:15:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:15:04,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:15:04,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:15:04,681 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-08 22:15:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:15:04,691 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2025-01-08 22:15:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:15:04,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 35 [2025-01-08 22:15:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:15:04,692 INFO L225 Difference]: With dead ends: 43 [2025-01-08 22:15:04,692 INFO L226 Difference]: Without dead ends: 25 [2025-01-08 22:15:04,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 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:15:04,692 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:15:04,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:15:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-08 22:15:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-08 22:15:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:15:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-01-08 22:15:04,695 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 35 [2025-01-08 22:15:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:15:04,695 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-01-08 22:15:04,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-08 22:15:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-01-08 22:15:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-08 22:15:04,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:15:04,696 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:15:04,704 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:15:04,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:04,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:15:04,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:15:04,901 INFO L85 PathProgramCache]: Analyzing trace with hash -651897740, now seen corresponding path program 2 times [2025-01-08 22:15:04,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:15:04,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371491540] [2025-01-08 22:15:04,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:15:04,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:15:04,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-08 22:15:04,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-08 22:15:04,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:15:04,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 22:15:04,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:15:04,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371491540] [2025-01-08 22:15:04,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371491540] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:15:04,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412210387] [2025-01-08 22:15:04,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:15:04,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:04,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:15:04,967 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:15:04,968 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:15:05,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-08 22:15:05,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-08 22:15:05,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:15:05,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:05,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:15:05,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:15:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-08 22:15:05,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:15:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-08 22:15:05,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412210387] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:15:05,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:15:05,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2025-01-08 22:15:05,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5583016] [2025-01-08 22:15:05,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:15:05,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-08 22:15:05,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:15:05,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-08 22:15:05,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:15:05,133 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-08 22:15:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:15:05,150 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2025-01-08 22:15:05,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 22:15:05,150 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 38 [2025-01-08 22:15:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:15:05,151 INFO L225 Difference]: With dead ends: 49 [2025-01-08 22:15:05,151 INFO L226 Difference]: Without dead ends: 31 [2025-01-08 22:15:05,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:15:05,151 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:15:05,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:15:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-08 22:15:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-01-08 22:15:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:15:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-01-08 22:15:05,154 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 38 [2025-01-08 22:15:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:15:05,155 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-01-08 22:15:05,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-08 22:15:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-01-08 22:15:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:15:05,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:15:05,155 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:15:05,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:15:05,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:05,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:15:05,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:15:05,357 INFO L85 PathProgramCache]: Analyzing trace with hash 936341513, now seen corresponding path program 3 times [2025-01-08 22:15:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:15:05,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045969222] [2025-01-08 22:15:05,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:15:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:15:05,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 6 equivalence classes. [2025-01-08 22:15:05,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 48 statements. [2025-01-08 22:15:05,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:15:05,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-08 22:15:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:15:05,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045969222] [2025-01-08 22:15:05,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045969222] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:15:05,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631941648] [2025-01-08 22:15:05,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:15:05,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:05,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:15:05,429 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:15:05,431 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:15:05,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 6 equivalence classes. [2025-01-08 22:15:05,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 48 statements. [2025-01-08 22:15:05,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:15:05,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:05,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:15:05,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:15:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-08 22:15:05,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:15:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-08 22:15:05,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631941648] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:15:05,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:15:05,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-08 22:15:05,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133354732] [2025-01-08 22:15:05,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:15:05,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:15:05,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:15:05,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:15:05,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:15:05,521 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:15:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:15:05,532 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2025-01-08 22:15:05,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:15:05,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2025-01-08 22:15:05,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:15:05,533 INFO L225 Difference]: With dead ends: 47 [2025-01-08 22:15:05,533 INFO L226 Difference]: Without dead ends: 32 [2025-01-08 22:15:05,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 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:15:05,534 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:15:05,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:15:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-08 22:15:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-08 22:15:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:15:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-01-08 22:15:05,537 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 48 [2025-01-08 22:15:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:15:05,537 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-01-08 22:15:05,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:15:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-01-08 22:15:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-08 22:15:05,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:15:05,538 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:15:05,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 22:15:05,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:05,739 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:15:05,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:15:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash -929516857, now seen corresponding path program 4 times [2025-01-08 22:15:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:15:05,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237453045] [2025-01-08 22:15:05,740 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:15:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:15:05,751 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-01-08 22:15:05,777 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 22:15:05,777 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:15:05,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 38 proven. 5 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-08 22:15:05,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:15:05,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237453045] [2025-01-08 22:15:05,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237453045] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:15:05,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10925004] [2025-01-08 22:15:05,863 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:15:05,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:05,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:15:05,869 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:15:05,870 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:15:05,920 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-01-08 22:15:05,952 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 22:15:05,952 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:15:05,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:05,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:15:05,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:15:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-08 22:15:05,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:15:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-08 22:15:06,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10925004] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:15:06,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:15:06,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-08 22:15:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942179186] [2025-01-08 22:15:06,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:15:06,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:15:06,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:15:06,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:15:06,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:15:06,008 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-08 22:15:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:15:06,031 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2025-01-08 22:15:06,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:15:06,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2025-01-08 22:15:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:15:06,033 INFO L225 Difference]: With dead ends: 64 [2025-01-08 22:15:06,033 INFO L226 Difference]: Without dead ends: 41 [2025-01-08 22:15:06,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:15:06,034 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:15:06,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:15:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-08 22:15:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-08 22:15:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:15:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-01-08 22:15:06,037 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 51 [2025-01-08 22:15:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:15:06,038 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-01-08 22:15:06,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-08 22:15:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-01-08 22:15:06,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-08 22:15:06,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:15:06,039 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:15:06,045 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:15:06,243 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,SelfDestructingSolverStorable6 [2025-01-08 22:15:06,243 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:15:06,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:15:06,244 INFO L85 PathProgramCache]: Analyzing trace with hash -17935310, now seen corresponding path program 5 times [2025-01-08 22:15:06,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:15:06,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056496514] [2025-01-08 22:15:06,244 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:15:06,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:15:06,257 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 78 statements into 12 equivalence classes. [2025-01-08 22:15:06,408 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 78 of 78 statements. [2025-01-08 22:15:06,408 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-01-08 22:15:06,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-08 22:15:07,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:15:07,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056496514] [2025-01-08 22:15:07,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056496514] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:15:07,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639269852] [2025-01-08 22:15:07,767 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:15:07,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:07,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:15:07,772 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:15:07,772 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:15:07,825 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 78 statements into 12 equivalence classes. [2025-01-08 22:15:07,973 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 78 of 78 statements. [2025-01-08 22:15:07,974 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-01-08 22:15:07,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:07,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-01-08 22:15:07,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:15:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-08 22:15:08,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:15:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-08 22:15:08,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639269852] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:15:08,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:15:08,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-01-08 22:15:08,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262145259] [2025-01-08 22:15:08,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:15:08,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-08 22:15:08,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:15:08,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-08 22:15:08,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:15:08,578 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 19 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-08 22:15:08,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:15:08,791 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2025-01-08 22:15:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-08 22:15:08,791 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 19 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2025-01-08 22:15:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:15:08,794 INFO L225 Difference]: With dead ends: 106 [2025-01-08 22:15:08,794 INFO L226 Difference]: Without dead ends: 102 [2025-01-08 22:15:08,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:15:08,795 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:15:08,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 471 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:15:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-08 22:15:08,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2025-01-08 22:15:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 84 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-08 22:15:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2025-01-08 22:15:08,815 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 78 [2025-01-08 22:15:08,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:15:08,816 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2025-01-08 22:15:08,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 19 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-08 22:15:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2025-01-08 22:15:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-08 22:15:08,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:15:08,820 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:15:08,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-08 22:15:09,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:09,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:15:09,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:15:09,022 INFO L85 PathProgramCache]: Analyzing trace with hash -827281936, now seen corresponding path program 1 times [2025-01-08 22:15:09,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:15:09,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988887795] [2025-01-08 22:15:09,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:15:09,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:15:09,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-08 22:15:09,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-08 22:15:09,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:15:09,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 176 proven. 170 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-08 22:15:11,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:15:11,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988887795] [2025-01-08 22:15:11,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988887795] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:15:11,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807592376] [2025-01-08 22:15:11,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:15:11,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:15:11,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:15:11,012 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:15:11,013 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:15:11,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-08 22:15:11,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-08 22:15:11,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:15:11,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:15:11,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-08 22:15:11,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:15:11,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-08 22:15:11,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-08 22:15:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 179 proven. 131 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-01-08 22:15:19,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:15:20,401 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2025-01-08 22:15:20,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2025-01-08 22:15:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 189 proven. 119 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-08 22:15:20,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807592376] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:15:20,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:15:20,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 15] total 49 [2025-01-08 22:15:20,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50877105] [2025-01-08 22:15:20,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:15:20,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-08 22:15:20,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:15:20,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-08 22:15:20,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2184, Unknown=2, NotChecked=0, Total=2352 [2025-01-08 22:15:20,450 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 49 states, 47 states have (on average 2.276595744680851) internal successors, (107), 46 states have internal predecessors, (107), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-08 22:15:24,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:28,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:32,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:39,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:40,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:52,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:56,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:16:04,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:16:09,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:16:13,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:16:17,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:16:25,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:16:29,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:16:33,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:16:37,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:16:45,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]