./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/rev-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/rev-3-u.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 fe3cf414f0e241a9a4e73e59647cf6619ea50b905df4a1c2a404b3413992b780 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:29:48,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:29:48,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:29:48,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:29:48,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:29:48,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:29:48,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:29:48,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:29:48,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:29:48,187 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:29:48,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:29:48,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:29:48,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:29:48,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:29:48,187 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:29:48,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:29:48,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:29:48,188 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:29:48,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:29:48,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:29:48,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:29:48,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:29:48,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:29:48,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:29:48,188 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:29:48,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:29:48,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:29:48,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:29:48,189 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:29:48,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:29:48,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:29:48,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:29:48,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:29:48,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:29:48,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:29:48,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:29:48,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:29:48,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:29:48,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:29:48,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:29:48,190 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:29:48,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:29:48,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:29:48,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:29:48,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:29:48,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:29:48,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:29:48,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:29:48,190 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 -> fe3cf414f0e241a9a4e73e59647cf6619ea50b905df4a1c2a404b3413992b780 [2025-01-08 22:29:48,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:29:48,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:29:48,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:29:48,420 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:29:48,420 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:29:48,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/rev-3-u.c [2025-01-08 22:29:49,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/548cf363b/33bb8701f6cb4e81adc263728be96051/FLAGc780ab744 [2025-01-08 22:29:49,824 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:29:49,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-3-u.c [2025-01-08 22:29:49,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/548cf363b/33bb8701f6cb4e81adc263728be96051/FLAGc780ab744 [2025-01-08 22:29:49,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/548cf363b/33bb8701f6cb4e81adc263728be96051 [2025-01-08 22:29:49,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:29:49,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:29:49,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:29:49,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:29:49,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:29:49,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:29:49" (1/1) ... [2025-01-08 22:29:49,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33aee8d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:49, skipping insertion in model container [2025-01-08 22:29:49,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:29:49" (1/1) ... [2025-01-08 22:29:49,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:29:49,963 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-multidimensional/rev-3-u.c[319,332] [2025-01-08 22:29:49,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:29:49,991 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:29:49,999 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-multidimensional/rev-3-u.c[319,332] [2025-01-08 22:29:50,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:29:50,025 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:29:50,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50 WrapperNode [2025-01-08 22:29:50,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:29:50,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:29:50,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:29:50,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:29:50,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,050 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2025-01-08 22:29:50,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:29:50,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:29:50,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:29:50,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:29:50,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,075 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-01-08 22:29:50,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:29:50,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:29:50,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:29:50,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:29:50,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (1/1) ... [2025-01-08 22:29:50,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:29:50,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:29:50,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:29:50,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:29:50,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:29:50,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:29:50,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:29:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:29:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:29:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:29:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:29:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:29:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:29:50,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:29:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:29:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:29:50,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:29:50,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:29:50,191 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:29:50,193 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:29:50,315 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-08 22:29:50,315 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:29:50,322 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:29:50,323 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:29:50,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:29:50 BoogieIcfgContainer [2025-01-08 22:29:50,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:29:50,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:29:50,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:29:50,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:29:50,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:29:49" (1/3) ... [2025-01-08 22:29:50,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cef19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:29:50, skipping insertion in model container [2025-01-08 22:29:50,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:29:50" (2/3) ... [2025-01-08 22:29:50,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cef19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:29:50, skipping insertion in model container [2025-01-08 22:29:50,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:29:50" (3/3) ... [2025-01-08 22:29:50,332 INFO L128 eAbstractionObserver]: Analyzing ICFG rev-3-u.c [2025-01-08 22:29:50,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:29:50,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rev-3-u.c that has 1 procedures, 18 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-01-08 22:29:50,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:29:50,390 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;@27b1781c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:29:50,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:29:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-08 22:29:50,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:29:50,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:29:50,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:29:50,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:29:50,407 INFO L85 PathProgramCache]: Analyzing trace with hash 692460059, now seen corresponding path program 1 times [2025-01-08 22:29:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:29:50,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774201379] [2025-01-08 22:29:50,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:29:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:29:50,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-08 22:29:50,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-08 22:29:50,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:29:50,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:29:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:29:50,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:29:50,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774201379] [2025-01-08 22:29:50,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774201379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:29:50,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:29:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:29:50,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371255447] [2025-01-08 22:29:50,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:29:50,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:29:50,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:29:50,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:29:50,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:29:50,652 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:29:50,712 INFO L93 Difference]: Finished difference Result 34 states and 52 transitions. [2025-01-08 22:29:50,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:29:50,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-08 22:29:50,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:29:50,720 INFO L225 Difference]: With dead ends: 34 [2025-01-08 22:29:50,721 INFO L226 Difference]: Without dead ends: 18 [2025-01-08 22:29:50,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:29:50,725 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:29:50,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:29:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-08 22:29:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-01-08 22:29:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2025-01-08 22:29:50,748 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 9 [2025-01-08 22:29:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:29:50,749 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-01-08 22:29:50,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2025-01-08 22:29:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-08 22:29:50,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:29:50,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:29:50,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:29:50,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:29:50,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:29:50,751 INFO L85 PathProgramCache]: Analyzing trace with hash 485398671, now seen corresponding path program 1 times [2025-01-08 22:29:50,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:29:50,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368263251] [2025-01-08 22:29:50,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:29:50,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:29:50,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-08 22:29:50,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-08 22:29:50,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:29:50,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:29:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:29:50,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:29:50,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368263251] [2025-01-08 22:29:50,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368263251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:29:50,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:29:50,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:29:50,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055494923] [2025-01-08 22:29:50,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:29:50,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:29:50,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:29:50,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:29:50,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:29:50,871 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-01-08 22:29:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:29:50,920 INFO L93 Difference]: Finished difference Result 39 states and 61 transitions. [2025-01-08 22:29:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:29:50,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-01-08 22:29:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:29:50,921 INFO L225 Difference]: With dead ends: 39 [2025-01-08 22:29:50,921 INFO L226 Difference]: Without dead ends: 26 [2025-01-08 22:29:50,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:29:50,922 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:29:50,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:29:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-08 22:29:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2025-01-08 22:29:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2025-01-08 22:29:50,926 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 11 [2025-01-08 22:29:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:29:50,926 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2025-01-08 22:29:50,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-01-08 22:29:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2025-01-08 22:29:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-08 22:29:50,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:29:50,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:29:50,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:29:50,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:29:50,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:29:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash -254666987, now seen corresponding path program 1 times [2025-01-08 22:29:50,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:29:50,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493024415] [2025-01-08 22:29:50,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:29:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:29:50,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-08 22:29:50,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-08 22:29:50,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:29:50,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:29:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:29:50,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:29:50,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493024415] [2025-01-08 22:29:50,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493024415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:29:50,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:29:50,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:29:50,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741754638] [2025-01-08 22:29:50,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:29:50,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:29:50,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:29:50,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:29:50,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:29:50,982 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:29:51,039 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2025-01-08 22:29:51,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:29:51,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-08 22:29:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:29:51,040 INFO L225 Difference]: With dead ends: 42 [2025-01-08 22:29:51,040 INFO L226 Difference]: Without dead ends: 26 [2025-01-08 22:29:51,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:29:51,041 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:29:51,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 9 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:29:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-08 22:29:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2025-01-08 22:29:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2025-01-08 22:29:51,047 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 13 [2025-01-08 22:29:51,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:29:51,047 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-01-08 22:29:51,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2025-01-08 22:29:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-08 22:29:51,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:29:51,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:29:51,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:29:51,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:29:51,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:29:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1990923851, now seen corresponding path program 1 times [2025-01-08 22:29:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:29:51,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267898504] [2025-01-08 22:29:51,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:29:51,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:29:51,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-08 22:29:51,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-08 22:29:51,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:29:51,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:29:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:29:51,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:29:51,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267898504] [2025-01-08 22:29:51,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267898504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:29:51,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:29:51,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:29:51,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295453995] [2025-01-08 22:29:51,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:29:51,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:29:51,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:29:51,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:29:51,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:29:51,159 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:29:51,209 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2025-01-08 22:29:51,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:29:51,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-01-08 22:29:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:29:51,210 INFO L225 Difference]: With dead ends: 49 [2025-01-08 22:29:51,210 INFO L226 Difference]: Without dead ends: 40 [2025-01-08 22:29:51,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:29:51,210 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:29:51,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 12 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:29:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-08 22:29:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2025-01-08 22:29:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-01-08 22:29:51,217 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2025-01-08 22:29:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:29:51,217 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-01-08 22:29:51,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-01-08 22:29:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:29:51,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:29:51,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:29:51,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:29:51,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:29:51,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:29:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1089748445, now seen corresponding path program 1 times [2025-01-08 22:29:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:29:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052398110] [2025-01-08 22:29:51,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:29:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:29:51,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:29:51,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:29:51,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:29:51,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:29:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:29:51,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:29:51,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052398110] [2025-01-08 22:29:51,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052398110] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:29:51,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483072399] [2025-01-08 22:29:51,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:29:51,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:29:51,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:29:51,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:29:51,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:29:51,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:29:51,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:29:51,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:29:51,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:29:51,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:29:51,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:29:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:29:51,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:29:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:29:51,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483072399] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:29:51,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:29:51,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-08 22:29:51,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645240907] [2025-01-08 22:29:51,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:29:51,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:29:51,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:29:51,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:29:51,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:29:51,470 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:29:51,594 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2025-01-08 22:29:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:29:51,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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 19 [2025-01-08 22:29:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:29:51,597 INFO L225 Difference]: With dead ends: 64 [2025-01-08 22:29:51,597 INFO L226 Difference]: Without dead ends: 44 [2025-01-08 22:29:51,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:29:51,598 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 94 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:29:51,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 18 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:29:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-08 22:29:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2025-01-08 22:29:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2025-01-08 22:29:51,611 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 19 [2025-01-08 22:29:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:29:51,612 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-01-08 22:29:51,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2025-01-08 22:29:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:29:51,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:29:51,612 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:29:51,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:29:51,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:29:51,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:29:51,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:29:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1510829093, now seen corresponding path program 2 times [2025-01-08 22:29:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:29:51,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392683572] [2025-01-08 22:29:51,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:29:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:29:51,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-08 22:29:51,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:29:51,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:29:51,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:29:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-08 22:29:51,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:29:51,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392683572] [2025-01-08 22:29:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392683572] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:29:51,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236232382] [2025-01-08 22:29:51,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:29:51,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:29:51,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:29:51,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:29:51,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:29:52,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-08 22:29:52,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:29:52,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:29:52,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:29:52,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:29:52,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:29:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:29:52,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:29:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:29:52,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236232382] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:29:52,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:29:52,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2025-01-08 22:29:52,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179507819] [2025-01-08 22:29:52,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:29:52,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-08 22:29:52,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:29:52,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-08 22:29:52,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:29:52,192 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:29:52,772 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2025-01-08 22:29:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-08 22:29:52,773 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-08 22:29:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:29:52,774 INFO L225 Difference]: With dead ends: 283 [2025-01-08 22:29:52,774 INFO L226 Difference]: Without dead ends: 248 [2025-01-08 22:29:52,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2025-01-08 22:29:52,776 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 700 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:29:52,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 42 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:29:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-08 22:29:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 96. [2025-01-08 22:29:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.231578947368421) internal successors, (117), 95 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2025-01-08 22:29:52,812 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 25 [2025-01-08 22:29:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:29:52,812 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2025-01-08 22:29:52,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:29:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2025-01-08 22:29:52,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-08 22:29:52,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:29:52,817 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:29:52,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:29:53,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:29:53,018 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:29:53,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:29:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1397963749, now seen corresponding path program 3 times [2025-01-08 22:29:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:29:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414856944] [2025-01-08 22:29:53,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:29:53,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:29:53,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 15 equivalence classes. [2025-01-08 22:29:53,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 61 of 65 statements. [2025-01-08 22:29:53,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-01-08 22:29:53,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:29:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 126 proven. 55 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-01-08 22:29:53,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:29:53,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414856944] [2025-01-08 22:29:53,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414856944] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:29:53,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27624878] [2025-01-08 22:29:53,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:29:53,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:29:53,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:29:53,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:29:53,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:29:53,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 15 equivalence classes. [2025-01-08 22:30:05,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 57 of 65 statements. [2025-01-08 22:30:05,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-01-08 22:30:05,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:30:05,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 148 conjuncts are in the unsatisfiable core [2025-01-08 22:30:05,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:30:05,693 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 11 [2025-01-08 22:30:05,742 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 27 treesize of output 26 [2025-01-08 22:30:05,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:30:05,808 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 40 [2025-01-08 22:30:05,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:30:05,880 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 49 treesize of output 54 [2025-01-08 22:30:05,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:30:05,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 68 [2025-01-08 22:30:06,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:30:06,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 82 [2025-01-08 22:30:06,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:30:06,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 96 [2025-01-08 22:30:06,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:30:06,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 93 treesize of output 110 [2025-01-08 22:30:06,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:30:06,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 124 [2025-01-08 22:30:06,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:30:06,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 121 treesize of output 144 [2025-01-08 22:30:06,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:06,839 INFO L349 Elim1Store]: treesize reduction 442, result has 14.2 percent of original size [2025-01-08 22:30:06,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 151 treesize of output 177 [2025-01-08 22:30:07,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,147 INFO L349 Elim1Store]: treesize reduction 631, result has 12.4 percent of original size [2025-01-08 22:30:07,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 181 treesize of output 210 [2025-01-08 22:30:07,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,381 INFO L349 Elim1Store]: treesize reduction 639, result has 12.2 percent of original size [2025-01-08 22:30:07,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 182 treesize of output 211 [2025-01-08 22:30:07,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,689 INFO L349 Elim1Store]: treesize reduction 801, result has 10.0 percent of original size [2025-01-08 22:30:07,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 77 case distinctions, treesize of input 213 treesize of output 245 [2025-01-08 22:30:07,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:07,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,048 INFO L349 Elim1Store]: treesize reduction 963, result has 8.5 percent of original size [2025-01-08 22:30:08,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 89 case distinctions, treesize of input 244 treesize of output 279 [2025-01-08 22:30:08,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,461 INFO L349 Elim1Store]: treesize reduction 1125, result has 7.3 percent of original size [2025-01-08 22:30:08,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 45 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 102 case distinctions, treesize of input 275 treesize of output 313 [2025-01-08 22:30:08,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:08,977 INFO L349 Elim1Store]: treesize reduction 1287, result has 6.5 percent of original size [2025-01-08 22:30:08,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 45 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 116 case distinctions, treesize of input 306 treesize of output 347 [2025-01-08 22:30:09,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,483 INFO L349 Elim1Store]: treesize reduction 1449, result has 5.8 percent of original size [2025-01-08 22:30:09,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 45 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 131 case distinctions, treesize of input 337 treesize of output 381 [2025-01-08 22:30:09,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:09,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:10,038 INFO L349 Elim1Store]: treesize reduction 1611, result has 5.2 percent of original size [2025-01-08 22:30:10,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 45 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 147 case distinctions, treesize of input 368 treesize of output 415 [2025-01-08 22:30:10,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:10,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:10,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:10,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:10,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:10,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:10,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:10,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:10,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:30:10,689 INFO L349 Elim1Store]: treesize reduction 1765, result has 4.8 percent of original size [2025-01-08 22:30:10,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 45 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 164 case distinctions, treesize of input 398 treesize of output 448 [2025-01-08 22:30:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 317 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-01-08 22:30:12,786 INFO L312 TraceCheckSpWp]: Computing backward predicates...