./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/pcomp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/pcomp.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 1472da9c0a8f011e4f758f37d66a1227b497d4a96142a431b3f2f304a275b1b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:32:11,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:32:11,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:32:11,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:32:11,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:32:11,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:32:11,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:32:11,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:32:11,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:32:11,604 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:32:11,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:32:11,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:32:11,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:32:11,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:32:11,605 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:32:11,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:32:11,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:32:11,606 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:32:11,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:32:11,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:32:11,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:32:11,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:32:11,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:32:11,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:32:11,607 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:32:11,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:32:11,607 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:32:11,607 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:32:11,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:32:11,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:32:11,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:32:11,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:32:11,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:32:11,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:32:11,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:32:11,609 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:32:11,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:32:11,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:32:11,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:32:11,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:32:11,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:32:11,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:32:11,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:32:11,609 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 -> 1472da9c0a8f011e4f758f37d66a1227b497d4a96142a431b3f2f304a275b1b7 [2025-02-05 10:32:11,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:32:11,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:32:11,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:32:11,875 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:32:11,876 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:32:11,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/pcomp.c [2025-02-05 10:32:13,132 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/683c82eab/d3022418ece24421969ef5b4586c67d3/FLAG3f2ee6520 [2025-02-05 10:32:13,360 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:32:13,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/pcomp.c [2025-02-05 10:32:13,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/683c82eab/d3022418ece24421969ef5b4586c67d3/FLAG3f2ee6520 [2025-02-05 10:32:13,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/683c82eab/d3022418ece24421969ef5b4586c67d3 [2025-02-05 10:32:13,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:32:13,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:32:13,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:32:13,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:32:13,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:32:13,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c5f70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13, skipping insertion in model container [2025-02-05 10:32:13,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:32:13,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/pcomp.c[588,601] [2025-02-05 10:32:13,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:32:13,855 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:32:13,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/pcomp.c[588,601] [2025-02-05 10:32:13,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:32:13,882 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:32:13,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13 WrapperNode [2025-02-05 10:32:13,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:32:13,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:32:13,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:32:13,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:32:13,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,914 INFO L138 Inliner]: procedures = 16, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2025-02-05 10:32:13,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:32:13,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:32:13,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:32:13,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:32:13,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,940 INFO L175 MemorySlicer]: Split 22 memory accesses to 5 slices as follows [2, 8, 4, 4, 4]. 36 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0, 0]. The 6 writes are split as follows [0, 0, 2, 2, 2]. [2025-02-05 10:32:13,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,945 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:32:13,956 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:32:13,956 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:32:13,956 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:32:13,957 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (1/1) ... [2025-02-05 10:32:13,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:32:13,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:32:13,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:32:13,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:32:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:32:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:32:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:32:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:32:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 10:32:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 10:32:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:32:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:32:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:32:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 10:32:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 10:32:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 10:32:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:32:14,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:32:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:32:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:32:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:32:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 10:32:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 10:32:14,050 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:32:14,051 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:32:14,170 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-05 10:32:14,170 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:32:14,175 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:32:14,176 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:32:14,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:32:14 BoogieIcfgContainer [2025-02-05 10:32:14,176 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:32:14,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:32:14,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:32:14,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:32:14,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:32:13" (1/3) ... [2025-02-05 10:32:14,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5288b38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:32:14, skipping insertion in model container [2025-02-05 10:32:14,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:13" (2/3) ... [2025-02-05 10:32:14,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5288b38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:32:14, skipping insertion in model container [2025-02-05 10:32:14,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:32:14" (3/3) ... [2025-02-05 10:32:14,183 INFO L128 eAbstractionObserver]: Analyzing ICFG pcomp.c [2025-02-05 10:32:14,193 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:32:14,195 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pcomp.c that has 1 procedures, 16 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-05 10:32:14,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:32:14,231 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;@d1eb97b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:32:14,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:32:14,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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-02-05 10:32:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 10:32:14,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:32:14,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:32:14,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:32:14,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:32:14,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1543215825, now seen corresponding path program 1 times [2025-02-05 10:32:14,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:32:14,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102594514] [2025-02-05 10:32:14,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:32:14,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:32:14,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 10:32:14,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 10:32:14,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:32:14,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:32:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:32:14,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102594514] [2025-02-05 10:32:14,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102594514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:32:14,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:32:14,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:32:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292873668] [2025-02-05 10:32:14,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:32:14,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:32:14,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:32:14,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:32:14,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:32:14,360 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-02-05 10:32:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:32:14,368 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2025-02-05 10:32:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:32:14,369 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-02-05 10:32:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:32:14,373 INFO L225 Difference]: With dead ends: 28 [2025-02-05 10:32:14,373 INFO L226 Difference]: Without dead ends: 13 [2025-02-05 10:32:14,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:32:14,377 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:32:14,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:32:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-05 10:32:14,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-05 10:32:14,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-02-05 10:32:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-02-05 10:32:14,410 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 11 [2025-02-05 10:32:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:32:14,410 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-02-05 10:32:14,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-02-05 10:32:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2025-02-05 10:32:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 10:32:14,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:32:14,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:32:14,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:32:14,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:32:14,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:32:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1008941136, now seen corresponding path program 1 times [2025-02-05 10:32:14,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:32:14,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919578283] [2025-02-05 10:32:14,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:32:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:32:14,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 10:32:14,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 10:32:14,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:32:14,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:32:14,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572103593] [2025-02-05 10:32:14,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:32:14,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:14,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:32:14,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:32:14,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:32:14,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 10:32:14,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 10:32:14,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:32:14,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:14,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 10:32:14,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:32:14,558 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 11 treesize of output 7 [2025-02-05 10:32:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:32:14,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:32:14,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:32:14,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919578283] [2025-02-05 10:32:14,602 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:32:14,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572103593] [2025-02-05 10:32:14,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572103593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:32:14,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:32:14,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:32:14,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16005621] [2025-02-05 10:32:14,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:32:14,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:32:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:32:14,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:32:14,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:32:14,606 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-02-05 10:32:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:32:14,663 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-02-05 10:32:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:32:14,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-02-05 10:32:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:32:14,664 INFO L225 Difference]: With dead ends: 24 [2025-02-05 10:32:14,664 INFO L226 Difference]: Without dead ends: 22 [2025-02-05 10:32:14,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:32:14,665 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:32:14,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 43 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:32:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-05 10:32:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2025-02-05 10:32:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-02-05 10:32:14,671 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2025-02-05 10:32:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:32:14,671 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-02-05 10:32:14,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-02-05 10:32:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-02-05 10:32:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 10:32:14,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:32:14,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:32:14,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 10:32:14,873 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-02-05 10:32:14,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:32:14,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:32:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1211448874, now seen corresponding path program 1 times [2025-02-05 10:32:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:32:14,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454978510] [2025-02-05 10:32:14,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:32:14,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:32:14,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 10:32:14,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 10:32:14,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:32:14,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:32:15,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:32:15,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454978510] [2025-02-05 10:32:15,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454978510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:32:15,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:32:15,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:32:15,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23480874] [2025-02-05 10:32:15,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:32:15,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:32:15,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:32:15,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:32:15,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:32:15,048 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-05 10:32:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:32:15,092 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-02-05 10:32:15,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:32:15,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 10:32:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:32:15,093 INFO L225 Difference]: With dead ends: 35 [2025-02-05 10:32:15,093 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 10:32:15,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:32:15,094 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:32:15,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:32:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 10:32:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2025-02-05 10:32:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2025-02-05 10:32:15,098 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 12 [2025-02-05 10:32:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:32:15,098 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-02-05 10:32:15,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-05 10:32:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2025-02-05 10:32:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 10:32:15,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:32:15,099 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:32:15,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:32:15,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:32:15,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:32:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1183373350, now seen corresponding path program 1 times [2025-02-05 10:32:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:32:15,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297930801] [2025-02-05 10:32:15,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:32:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:32:15,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:32:15,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:32:15,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:32:15,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:32:15,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:32:15,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297930801] [2025-02-05 10:32:15,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297930801] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:32:15,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232696962] [2025-02-05 10:32:15,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:32:15,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:15,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:32:15,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:32:15,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:32:15,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:32:15,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:32:15,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:32:15,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:15,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 10:32:15,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:32:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:32:15,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:32:15,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232696962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:32:15,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:32:15,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-02-05 10:32:15,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148385451] [2025-02-05 10:32:15,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:32:15,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:32:15,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:32:15,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:32:15,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:32:15,344 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:32:15,396 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-02-05 10:32:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:32:15,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-05 10:32:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:32:15,397 INFO L225 Difference]: With dead ends: 32 [2025-02-05 10:32:15,397 INFO L226 Difference]: Without dead ends: 21 [2025-02-05 10:32:15,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:32:15,398 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:32:15,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:32:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-05 10:32:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2025-02-05 10:32:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-02-05 10:32:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-02-05 10:32:15,400 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 14 [2025-02-05 10:32:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:32:15,400 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-02-05 10:32:15,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-02-05 10:32:15,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 10:32:15,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:32:15,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:32:15,409 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-02-05 10:32:15,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:15,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:32:15,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:32:15,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1048826634, now seen corresponding path program 1 times [2025-02-05 10:32:15,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:32:15,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595045774] [2025-02-05 10:32:15,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:32:15,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:32:15,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:32:15,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:32:15,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:32:15,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:32:15,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450878671] [2025-02-05 10:32:15,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:32:15,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:15,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:32:15,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:32:15,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:32:15,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:32:15,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:32:15,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:32:15,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:15,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 10:32:15,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:32:15,760 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 11 treesize of output 7 [2025-02-05 10:32:15,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 11 [2025-02-05 10:32:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:32:15,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:32:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:32:15,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:32:15,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595045774] [2025-02-05 10:32:15,984 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:32:15,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450878671] [2025-02-05 10:32:15,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450878671] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:32:15,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:32:15,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-02-05 10:32:15,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400566477] [2025-02-05 10:32:15,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:32:15,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:32:15,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:32:15,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:32:15,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:32:15,988 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-02-05 10:32:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:32:16,219 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-02-05 10:32:16,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:32:16,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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) Word has length 14 [2025-02-05 10:32:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:32:16,220 INFO L225 Difference]: With dead ends: 40 [2025-02-05 10:32:16,220 INFO L226 Difference]: Without dead ends: 38 [2025-02-05 10:32:16,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:32:16,221 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:32:16,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 44 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:32:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-05 10:32:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 20. [2025-02-05 10:32:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-02-05 10:32:16,234 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 14 [2025-02-05 10:32:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:32:16,235 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-05 10:32:16,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-02-05 10:32:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-02-05 10:32:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 10:32:16,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:32:16,235 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:32:16,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:32:16,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:16,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:32:16,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:32:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1425487926, now seen corresponding path program 2 times [2025-02-05 10:32:16,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:32:16,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946627601] [2025-02-05 10:32:16,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:32:16,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:32:16,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-05 10:32:16,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:32:16,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:32:16,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:32:16,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:32:16,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946627601] [2025-02-05 10:32:16,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946627601] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:32:16,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182036738] [2025-02-05 10:32:16,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:32:16,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:16,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:32:16,655 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:32:16,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:32:16,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-05 10:32:16,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:32:16,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:32:16,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:16,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:32:16,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:32:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:32:16,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:32:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:32:16,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182036738] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:32:16,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:32:16,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2025-02-05 10:32:16,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414692632] [2025-02-05 10:32:16,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:32:16,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 10:32:16,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:32:16,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 10:32:16,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:32:16,810 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:32:16,907 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2025-02-05 10:32:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:32:16,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 10:32:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:32:16,907 INFO L225 Difference]: With dead ends: 55 [2025-02-05 10:32:16,907 INFO L226 Difference]: Without dead ends: 43 [2025-02-05 10:32:16,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:32:16,908 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:32:16,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 39 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:32:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-05 10:32:16,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2025-02-05 10:32:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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-02-05 10:32:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-02-05 10:32:16,915 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 16 [2025-02-05 10:32:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:32:16,915 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-02-05 10:32:16,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-02-05 10:32:16,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:32:16,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:32:16,916 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:32:16,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:32:17,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-05 10:32:17,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:32:17,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:32:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash 293696724, now seen corresponding path program 1 times [2025-02-05 10:32:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:32:17,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000207192] [2025-02-05 10:32:17,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:32:17,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:32:17,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:32:17,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:32:17,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:32:17,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:32:17,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758210321] [2025-02-05 10:32:17,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:32:17,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:17,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:32:17,188 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:32:17,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:32:17,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:32:17,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:32:17,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:32:17,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:17,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 10:32:17,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:32:17,338 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 11 treesize of output 7 [2025-02-05 10:32:17,343 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 11 treesize of output 7 [2025-02-05 10:32:17,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:32:17,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:32:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:32:17,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:32:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:32:17,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:32:17,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000207192] [2025-02-05 10:32:17,834 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:32:17,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758210321] [2025-02-05 10:32:17,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758210321] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:32:17,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:32:17,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2025-02-05 10:32:17,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108945168] [2025-02-05 10:32:17,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:32:17,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:32:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:32:17,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:32:17,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:32:17,836 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:32:18,268 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2025-02-05 10:32:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 10:32:18,269 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:32:18,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:32:18,269 INFO L225 Difference]: With dead ends: 62 [2025-02-05 10:32:18,269 INFO L226 Difference]: Without dead ends: 60 [2025-02-05 10:32:18,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-02-05 10:32:18,270 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 72 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:32:18,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 91 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:32:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-05 10:32:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2025-02-05 10:32:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 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-02-05 10:32:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-02-05 10:32:18,277 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 17 [2025-02-05 10:32:18,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:32:18,277 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-02-05 10:32:18,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-02-05 10:32:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 10:32:18,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:32:18,278 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:32:18,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:32:18,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:18,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:32:18,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:32:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash 388384662, now seen corresponding path program 3 times [2025-02-05 10:32:18,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:32:18,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041485546] [2025-02-05 10:32:18,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:32:18,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:32:18,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-02-05 10:32:18,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 10:32:18,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:32:18,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:32:18,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:32:18,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041485546] [2025-02-05 10:32:18,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041485546] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:32:18,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076585305] [2025-02-05 10:32:18,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:32:18,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:18,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:32:18,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:32:18,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:32:18,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-02-05 10:32:18,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 10:32:18,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:32:18,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:18,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:32:18,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:32:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:32:18,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:32:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:32:19,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076585305] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:32:19,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:32:19,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 14 [2025-02-05 10:32:19,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997729248] [2025-02-05 10:32:19,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:32:19,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:32:19,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:32:19,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:32:19,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:32:19,007 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:32:19,198 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2025-02-05 10:32:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 10:32:19,199 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 10:32:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:32:19,199 INFO L225 Difference]: With dead ends: 91 [2025-02-05 10:32:19,200 INFO L226 Difference]: Without dead ends: 64 [2025-02-05 10:32:19,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2025-02-05 10:32:19,200 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:32:19,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:32:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-05 10:32:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 38. [2025-02-05 10:32:19,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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-02-05 10:32:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-02-05 10:32:19,207 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 18 [2025-02-05 10:32:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:32:19,207 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-02-05 10:32:19,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-02-05 10:32:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:32:19,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:32:19,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:32:19,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 10:32:19,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 10:32:19,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:32:19,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:32:19,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1668108982, now seen corresponding path program 4 times [2025-02-05 10:32:19,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:32:19,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203482575] [2025-02-05 10:32:19,413 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:32:19,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:32:19,421 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-02-05 10:32:19,506 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:32:19,507 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:32:19,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:32:19,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400160607] [2025-02-05 10:32:19,510 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:32:19,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:19,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:32:19,512 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:32:19,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:32:19,555 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-02-05 10:32:19,963 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:32:19,963 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:32:19,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:19,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-05 10:32:19,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:32:19,988 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 11 treesize of output 7 [2025-02-05 10:32:19,997 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 11 treesize of output 7 [2025-02-05 10:32:20,025 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 15 treesize of output 1 [2025-02-05 10:32:20,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2025-02-05 10:32:20,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:32:20,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2025-02-05 10:32:20,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:32:20,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 44 [2025-02-05 10:32:20,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:32:20,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:32:20,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 40 [2025-02-05 10:32:20,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:32:20,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 41 [2025-02-05 10:32:20,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:32:20,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:32:20,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:32:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:32:20,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:32:36,799 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification. DAG size of input: 16 DAG size of output: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 10:33:09,151 WARN L286 SmtUtils]: Spent 24.13s on a formula simplification. DAG size of input: 67 DAG size of output: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-05 10:33:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:33:09,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:33:09,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203482575] [2025-02-05 10:33:09,223 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:33:09,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400160607] [2025-02-05 10:33:09,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400160607] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:33:09,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:33:09,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 20 [2025-02-05 10:33:09,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230631516] [2025-02-05 10:33:09,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:33:09,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 10:33:09,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:33:09,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 10:33:09,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-02-05 10:33:09,225 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 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-02-05 10:33:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:33:10,740 INFO L93 Difference]: Finished difference Result 158 states and 188 transitions. [2025-02-05 10:33:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 10:33:10,740 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Word has length 20 [2025-02-05 10:33:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:33:10,741 INFO L225 Difference]: With dead ends: 158 [2025-02-05 10:33:10,742 INFO L226 Difference]: Without dead ends: 156 [2025-02-05 10:33:10,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=263, Invalid=729, Unknown=0, NotChecked=0, Total=992 [2025-02-05 10:33:10,742 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 155 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:33:10,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 188 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:33:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-05 10:33:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 42. [2025-02-05 10:33:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 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-02-05 10:33:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2025-02-05 10:33:10,768 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 20 [2025-02-05 10:33:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:33:10,768 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2025-02-05 10:33:10,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 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-02-05 10:33:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2025-02-05 10:33:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:33:10,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:33:10,769 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:33:10,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 10:33:10,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:33:10,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:33:10,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:33:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash -774985132, now seen corresponding path program 2 times [2025-02-05 10:33:10,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:33:10,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846718225] [2025-02-05 10:33:10,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:33:10,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:33:10,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-05 10:33:10,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:33:10,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:33:10,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:33:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:33:11,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:33:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846718225] [2025-02-05 10:33:11,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846718225] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:33:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399244609] [2025-02-05 10:33:11,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:33:11,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:33:11,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:33:11,126 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:33:11,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 10:33:11,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-05 10:33:11,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:33:11,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:33:11,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:33:11,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:33:11,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:33:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:33:11,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:33:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:33:11,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399244609] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:33:11,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:33:11,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-02-05 10:33:11,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491329888] [2025-02-05 10:33:11,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:33:11,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 10:33:11,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:33:11,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 10:33:11,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:33:11,312 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-02-05 10:33:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:33:11,624 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2025-02-05 10:33:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 10:33:11,624 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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) Word has length 21 [2025-02-05 10:33:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:33:11,625 INFO L225 Difference]: With dead ends: 74 [2025-02-05 10:33:11,625 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 10:33:11,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2025-02-05 10:33:11,626 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:33:11,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 57 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:33:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 10:33:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2025-02-05 10:33:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 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-02-05 10:33:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-02-05 10:33:11,638 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 21 [2025-02-05 10:33:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:33:11,638 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-02-05 10:33:11,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-02-05 10:33:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-02-05 10:33:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 10:33:11,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:33:11,639 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:33:11,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 10:33:11,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:33:11,839 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:33:11,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:33:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash 252047792, now seen corresponding path program 3 times [2025-02-05 10:33:11,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:33:11,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029036827] [2025-02-05 10:33:11,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:33:11,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:33:11,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-02-05 10:33:11,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:33:11,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:33:11,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:33:11,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1894278022] [2025-02-05 10:33:11,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:33:11,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:33:11,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:33:11,952 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:33:11,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 10:33:12,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-02-05 10:33:12,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:33:12,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:33:12,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:33:12,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-05 10:33:12,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:33:12,205 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 11 treesize of output 7 [2025-02-05 10:33:12,213 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 11 treesize of output 7 [2025-02-05 10:33:12,219 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 11 treesize of output 7 [2025-02-05 10:33:12,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:33:12,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:33:12,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-05 10:33:12,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:33:12,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:33:12,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-02-05 10:33:12,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2025-02-05 10:33:12,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:33:12,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2025-02-05 10:33:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:33:12,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:33:31,192 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 10:33:51,232 WARN L286 SmtUtils]: Spent 20.04s on a formula simplification. DAG size of input: 29 DAG size of output: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 10:33:59,247 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)