./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/phases_1-1.c --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/loop-acceleration/phases_1-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc900b1bfcaecf91bc89637deaef4e1ddf2476faf43fa7e6f1e197c315ae3982 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:55:55,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:55:55,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:55:55,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:55:55,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:55:55,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:55:55,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:55:55,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:55:55,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:55:55,829 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:55:55,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:55:55,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:55:55,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:55:55,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:55:55,829 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:55:55,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:55:55,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:55:55,830 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:55:55,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:55:55,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:55:55,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:55:55,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:55:55,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:55:55,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:55:55,830 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:55:55,830 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:55:55,830 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:55:55,830 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:55:55,831 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:55:55,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:55:55,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:55:55,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:55:55,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:55:55,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:55:55,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:55:55,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:55:55,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:55:55,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:55:55,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:55:55,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:55:55,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:55:55,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:55:55,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:55:55,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:55:55,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:55:55,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:55:55,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:55:55,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:55:55,832 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 -> bc900b1bfcaecf91bc89637deaef4e1ddf2476faf43fa7e6f1e197c315ae3982 [2025-01-09 02:55:56,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:55:56,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:55:56,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:55:56,035 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:55:56,035 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:55:56,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/phases_1-1.c [2025-01-09 02:55:57,331 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9488205a6/9dc9036fd4a849d28ed3da359d8242f4/FLAGd6ae204d2 [2025-01-09 02:55:57,566 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:55:57,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-acceleration/phases_1-1.c [2025-01-09 02:55:57,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9488205a6/9dc9036fd4a849d28ed3da359d8242f4/FLAGd6ae204d2 [2025-01-09 02:55:57,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9488205a6/9dc9036fd4a849d28ed3da359d8242f4 [2025-01-09 02:55:57,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:55:57,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:55:57,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:55:57,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:55:57,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:55:57,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:55:57" (1/1) ... [2025-01-09 02:55:57,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2334be49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:57, skipping insertion in model container [2025-01-09 02:55:57,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:55:57" (1/1) ... [2025-01-09 02:55:57,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:55:58,055 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/loop-acceleration/phases_1-1.c[322,335] [2025-01-09 02:55:58,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:55:58,074 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:55:58,081 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/loop-acceleration/phases_1-1.c[322,335] [2025-01-09 02:55:58,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:55:58,090 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:55:58,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58 WrapperNode [2025-01-09 02:55:58,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:55:58,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:55:58,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:55:58,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:55:58,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,107 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 23 [2025-01-09 02:55:58,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:55:58,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:55:58,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:55:58,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:55:58,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,118 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 02:55:58,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,120 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:55:58,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:55:58,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:55:58,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:55:58,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (1/1) ... [2025-01-09 02:55:58,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:55:58,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:58,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:55:58,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:55:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:55:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:55:58,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:55:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:55:58,196 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:55:58,197 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:55:58,259 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-01-09 02:55:58,259 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:55:58,264 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:55:58,265 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:55:58,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:55:58 BoogieIcfgContainer [2025-01-09 02:55:58,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:55:58,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:55:58,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:55:58,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:55:58,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:55:57" (1/3) ... [2025-01-09 02:55:58,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ba4e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:55:58, skipping insertion in model container [2025-01-09 02:55:58,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:58" (2/3) ... [2025-01-09 02:55:58,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ba4e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:55:58, skipping insertion in model container [2025-01-09 02:55:58,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:55:58" (3/3) ... [2025-01-09 02:55:58,272 INFO L128 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2025-01-09 02:55:58,281 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:55:58,283 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG phases_1-1.c that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 02:55:58,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:55:58,341 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;@57eaf472, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:55:58,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:55:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:58,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 02:55:58,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:58,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 02:55:58,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:58,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash 28702733, now seen corresponding path program 1 times [2025-01-09 02:55:58,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:58,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657578263] [2025-01-09 02:55:58,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:55:58,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:58,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 02:55:58,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 02:55:58,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:55:58,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:58,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657578263] [2025-01-09 02:55:58,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657578263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:55:58,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:55:58,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:55:58,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570138691] [2025-01-09 02:55:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:55:58,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:55:58,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:58,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:55:58,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:55:58,584 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:58,623 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-01-09 02:55:58,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:55:58,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 02:55:58,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:58,629 INFO L225 Difference]: With dead ends: 22 [2025-01-09 02:55:58,630 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 02:55:58,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:55:58,633 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:58,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:55:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 02:55:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-01-09 02:55:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-01-09 02:55:58,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2025-01-09 02:55:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:58,652 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-01-09 02:55:58,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-01-09 02:55:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 02:55:58,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:58,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:55:58,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:55:58,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:58,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1805891882, now seen corresponding path program 1 times [2025-01-09 02:55:58,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:58,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474601504] [2025-01-09 02:55:58,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:55:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:58,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 02:55:58,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 02:55:58,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:55:58,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:58,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:58,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474601504] [2025-01-09 02:55:58,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474601504] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:55:58,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64932572] [2025-01-09 02:55:58,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:55:58,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:58,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:58,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:55:58,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:55:58,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 02:55:58,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 02:55:58,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:55:58,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:58,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:55:58,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:55:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:58,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:55:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:58,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64932572] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:55:58,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:55:58,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 02:55:58,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883340061] [2025-01-09 02:55:58,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:55:58,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:55:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:58,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:55:58,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:55:58,828 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:58,865 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2025-01-09 02:55:58,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:55:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 02:55:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:58,866 INFO L225 Difference]: With dead ends: 18 [2025-01-09 02:55:58,866 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 02:55:58,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:55:58,866 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:58,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:55:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 02:55:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-01-09 02:55:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2025-01-09 02:55:58,872 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 7 [2025-01-09 02:55:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:58,873 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-01-09 02:55:58,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2025-01-09 02:55:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 02:55:58,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:58,873 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 02:55:58,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 02:55:59,074 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-09 02:55:59,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:59,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1575254626, now seen corresponding path program 1 times [2025-01-09 02:55:59,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:59,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447095491] [2025-01-09 02:55:59,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:55:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:59,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:55:59,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:55:59,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:55:59,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447095491] [2025-01-09 02:55:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447095491] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:55:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714457549] [2025-01-09 02:55:59,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:55:59,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:59,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:59,168 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:55:59,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:55:59,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:55:59,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:55:59,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:55:59,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:59,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 02:55:59,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:55:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:59,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:55:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 02:55:59,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714457549] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:55:59,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:55:59,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 10 [2025-01-09 02:55:59,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317828093] [2025-01-09 02:55:59,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:55:59,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 02:55:59,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:59,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 02:55:59,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:55:59,316 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:59,366 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-01-09 02:55:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:55:59,366 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 02:55:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:59,366 INFO L225 Difference]: With dead ends: 24 [2025-01-09 02:55:59,366 INFO L226 Difference]: Without dead ends: 17 [2025-01-09 02:55:59,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:55:59,367 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:59,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:55:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-01-09 02:55:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-01-09 02:55:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-01-09 02:55:59,374 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2025-01-09 02:55:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:59,375 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-01-09 02:55:59,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-01-09 02:55:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 02:55:59,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:59,375 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2025-01-09 02:55:59,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:55:59,575 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-09 02:55:59,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:59,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:59,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1926377919, now seen corresponding path program 2 times [2025-01-09 02:55:59,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:59,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582251403] [2025-01-09 02:55:59,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:55:59,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:59,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-09 02:55:59,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 02:55:59,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:55:59,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:59,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:59,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582251403] [2025-01-09 02:55:59,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582251403] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:55:59,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3960924] [2025-01-09 02:55:59,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:55:59,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:59,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:59,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:55:59,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:55:59,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-09 02:55:59,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 02:55:59,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:55:59,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:59,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 02:55:59,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:55:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:59,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:55:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:59,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3960924] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:55:59,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:55:59,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2025-01-09 02:55:59,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303817067] [2025-01-09 02:55:59,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:55:59,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 02:55:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:59,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 02:55:59,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:55:59,998 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:56:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:56:00,130 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2025-01-09 02:56:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 02:56:00,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 02:56:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:56:00,131 INFO L225 Difference]: With dead ends: 36 [2025-01-09 02:56:00,131 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 02:56:00,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=123, Unknown=0, NotChecked=0, Total=210 [2025-01-09 02:56:00,132 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:56:00,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 21 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:56:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 02:56:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 02:56:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:56:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-01-09 02:56:00,140 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 13 [2025-01-09 02:56:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:56:00,140 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-01-09 02:56:00,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:56:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-01-09 02:56:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 02:56:00,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:56:00,141 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2025-01-09 02:56:00,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 02:56:00,341 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-09 02:56:00,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:56:00,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:56:00,342 INFO L85 PathProgramCache]: Analyzing trace with hash -653407827, now seen corresponding path program 3 times [2025-01-09 02:56:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:56:00,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057140413] [2025-01-09 02:56:00,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:56:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:56:00,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 11 equivalence classes. [2025-01-09 02:56:00,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 11 of 25 statements. [2025-01-09 02:56:00,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 02:56:00,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:56:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 02:56:00,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:56:00,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057140413] [2025-01-09 02:56:00,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057140413] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:56:00,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967578180] [2025-01-09 02:56:00,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:56:00,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:56:00,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:56:00,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:56:00,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 02:56:00,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 11 equivalence classes. [2025-01-09 02:56:00,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 11 of 25 statements. [2025-01-09 02:56:00,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 02:56:00,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:56:00,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 02:56:00,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:56:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 02:56:00,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:56:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 02:56:00,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967578180] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:56:00,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:56:00,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 02:56:00,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423845059] [2025-01-09 02:56:00,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:56:00,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:56:00,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:56:00,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:56:00,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:56:00,473 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:56:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:56:00,520 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2025-01-09 02:56:00,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:56:00,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 02:56:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:56:00,522 INFO L225 Difference]: With dead ends: 48 [2025-01-09 02:56:00,522 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 02:56:00,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:56:00,523 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:56:00,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:56:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 02:56:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2025-01-09 02:56:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:56:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-01-09 02:56:00,539 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 25 [2025-01-09 02:56:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:56:00,539 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-01-09 02:56:00,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:56:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-01-09 02:56:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 02:56:00,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:56:00,540 INFO L218 NwaCegarLoop]: trace histogram [13, 9, 4, 1, 1, 1, 1, 1] [2025-01-09 02:56:00,550 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-09 02:56:00,741 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-09 02:56:00,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:56:00,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:56:00,742 INFO L85 PathProgramCache]: Analyzing trace with hash -244539650, now seen corresponding path program 4 times [2025-01-09 02:56:00,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:56:00,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590457396] [2025-01-09 02:56:00,743 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 02:56:00,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:56:00,751 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 02:56:00,762 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 02:56:00,762 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 02:56:00,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:56:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 70 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:56:00,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:56:00,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590457396] [2025-01-09 02:56:00,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590457396] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:56:00,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678734741] [2025-01-09 02:56:00,976 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 02:56:00,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:56:00,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:56:00,980 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:56:00,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 02:56:01,003 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 02:56:01,016 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 02:56:01,016 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 02:56:01,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:56:01,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 02:56:01,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:56:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 55 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 02:56:01,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:56:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 55 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 02:56:01,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678734741] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:56:01,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:56:01,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 26 [2025-01-09 02:56:01,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640495957] [2025-01-09 02:56:01,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:56:01,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 02:56:01,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:56:01,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 02:56:01,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2025-01-09 02:56:01,693 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:56:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:56:05,018 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2025-01-09 02:56:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 02:56:05,019 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-09 02:56:05,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:56:05,020 INFO L225 Difference]: With dead ends: 72 [2025-01-09 02:56:05,020 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 02:56:05,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=464, Invalid=796, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 02:56:05,021 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:56:05,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:56:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 02:56:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-09 02:56:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:56:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2025-01-09 02:56:05,047 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 31 [2025-01-09 02:56:05,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:56:05,048 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2025-01-09 02:56:05,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:56:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2025-01-09 02:56:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 02:56:05,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:56:05,049 INFO L218 NwaCegarLoop]: trace histogram [25, 21, 4, 1, 1, 1, 1, 1] [2025-01-09 02:56:05,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 02:56:05,249 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-09 02:56:05,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:56:05,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:56:05,250 INFO L85 PathProgramCache]: Analyzing trace with hash -562373926, now seen corresponding path program 5 times [2025-01-09 02:56:05,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:56:05,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495793872] [2025-01-09 02:56:05,250 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 02:56:05,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:56:05,273 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 26 equivalence classes. [2025-01-09 02:56:05,373 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 02:56:05,376 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2025-01-09 02:56:05,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:56:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 154 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:56:05,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:56:05,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495793872] [2025-01-09 02:56:05,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495793872] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:56:05,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003519375] [2025-01-09 02:56:05,903 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 02:56:05,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:56:05,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:56:05,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:56:05,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 02:56:05,940 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 26 equivalence classes. [2025-01-09 02:56:06,030 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 02:56:06,031 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2025-01-09 02:56:06,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:56:06,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 02:56:06,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:56:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 25 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:56:06,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:56:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 25 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:56:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003519375] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:56:07,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:56:07,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27, 28] total 54 [2025-01-09 02:56:07,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650603203] [2025-01-09 02:56:07,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:56:07,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 02:56:07,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:56:07,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 02:56:07,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=2058, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 02:56:07,431 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)