./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/copy-2-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/copy-2-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 d9e382438d8fbe8dfce0f613a239dc56836f436a035cb511dde070c4306eb1f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:27:38,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:27:38,984 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:27:38,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:27:38,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:27:39,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:27:39,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:27:39,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:27:39,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:27:39,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:27:39,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:27:39,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:27:39,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:27:39,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:27:39,009 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:27:39,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:27:39,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:27:39,009 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:27:39,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:27:39,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:27:39,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:27:39,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:27:39,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:27:39,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:27:39,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:27:39,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:27:39,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:27:39,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:27:39,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:27:39,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:27:39,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:27:39,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:27:39,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:27:39,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:27:39,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:27:39,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:27:39,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:27:39,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:27:39,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:27:39,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:27:39,010 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:27:39,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:27:39,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:27:39,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:27:39,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:27:39,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:27:39,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:27:39,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:27:39,011 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 -> d9e382438d8fbe8dfce0f613a239dc56836f436a035cb511dde070c4306eb1f9 [2025-01-08 22:27:39,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:27:39,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:27:39,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:27:39,279 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:27:39,279 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:27:39,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-2-u.c [2025-01-08 22:27:40,408 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/250acf48a/4519e70f9b134b858f9d3a28f9705870/FLAGd06f53182 [2025-01-08 22:27:40,650 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:27:40,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-2-u.c [2025-01-08 22:27:40,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/250acf48a/4519e70f9b134b858f9d3a28f9705870/FLAGd06f53182 [2025-01-08 22:27:40,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/250acf48a/4519e70f9b134b858f9d3a28f9705870 [2025-01-08 22:27:40,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:27:40,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:27:40,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:27:40,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:27:40,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:27:40,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e6cfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40, skipping insertion in model container [2025-01-08 22:27:40,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:27:40,805 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/copy-2-u.c[320,333] [2025-01-08 22:27:40,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:27:40,829 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:27:40,837 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/copy-2-u.c[320,333] [2025-01-08 22:27:40,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:27:40,855 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:27:40,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40 WrapperNode [2025-01-08 22:27:40,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:27:40,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:27:40,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:27:40,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:27:40,863 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:27:40" (1/1) ... [2025-01-08 22:27:40,870 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:27:40" (1/1) ... [2025-01-08 22:27:40,881 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-01-08 22:27:40,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:27:40,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:27:40,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:27:40,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:27:40,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,904 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:27:40,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:27:40,913 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:27:40,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:27:40,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:27:40,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40" (1/1) ... [2025-01-08 22:27:40,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:27:40,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:40,936 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:27:40,938 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:27:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:27:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:27:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:27:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:27:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:27:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:27:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:27:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:27:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:27:40,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:27:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:27:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:27:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:27:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:27:40,997 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:27:40,998 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:27:41,084 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-08 22:27:41,084 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:27:41,091 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:27:41,091 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:27:41,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:27:41 BoogieIcfgContainer [2025-01-08 22:27:41,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:27:41,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:27:41,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:27:41,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:27:41,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:27:40" (1/3) ... [2025-01-08 22:27:41,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0e3d43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:27:41, skipping insertion in model container [2025-01-08 22:27:41,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:40" (2/3) ... [2025-01-08 22:27:41,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0e3d43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:27:41, skipping insertion in model container [2025-01-08 22:27:41,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:27:41" (3/3) ... [2025-01-08 22:27:41,098 INFO L128 eAbstractionObserver]: Analyzing ICFG copy-2-u.c [2025-01-08 22:27:41,107 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:27:41,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copy-2-u.c that has 1 procedures, 15 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-08 22:27:41,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:27:41,154 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;@7d9df379, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:27:41,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:27:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-08 22:27:41,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:41,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:41,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:41,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash 393300149, now seen corresponding path program 1 times [2025-01-08 22:27:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:41,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219390183] [2025-01-08 22:27:41,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:41,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:41,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-08 22:27:41,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-08 22:27:41,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:41,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:41,359 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:27:41,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:41,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219390183] [2025-01-08 22:27:41,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219390183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:27:41,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:27:41,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:27:41,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190512872] [2025-01-08 22:27:41,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:27:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:27:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:41,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:27:41,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:27:41,383 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:27:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:41,437 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2025-01-08 22:27:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:27:41,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-01-08 22:27:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:41,444 INFO L225 Difference]: With dead ends: 28 [2025-01-08 22:27:41,445 INFO L226 Difference]: Without dead ends: 14 [2025-01-08 22:27:41,447 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:27:41,449 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:41,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-01-08 22:27:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-01-08 22:27:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-01-08 22:27:41,474 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 8 [2025-01-08 22:27:41,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:41,474 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-01-08 22:27:41,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:27:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2025-01-08 22:27:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:27:41,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:41,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:41,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:27:41,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:41,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:41,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1059076037, now seen corresponding path program 1 times [2025-01-08 22:27:41,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:41,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964226159] [2025-01-08 22:27:41,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:41,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:41,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:27:41,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:27:41,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:41,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:41,574 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:27:41,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:41,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964226159] [2025-01-08 22:27:41,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964226159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:27:41,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:27:41,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:27:41,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504328591] [2025-01-08 22:27:41,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:27:41,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:27:41,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:41,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:27:41,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:41,575 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:41,611 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2025-01-08 22:27:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:27:41,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-08 22:27:41,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:41,612 INFO L225 Difference]: With dead ends: 30 [2025-01-08 22:27:41,612 INFO L226 Difference]: Without dead ends: 20 [2025-01-08 22:27:41,612 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:27:41,612 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:41,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 9 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-08 22:27:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2025-01-08 22:27:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-01-08 22:27:41,616 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 10 [2025-01-08 22:27:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:41,616 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-01-08 22:27:41,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2025-01-08 22:27:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-08 22:27:41,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:41,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:41,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:27:41,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:41,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:41,617 INFO L85 PathProgramCache]: Analyzing trace with hash 215354519, now seen corresponding path program 1 times [2025-01-08 22:27:41,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:41,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643693141] [2025-01-08 22:27:41,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:41,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-08 22:27:41,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-08 22:27:41,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:41,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:27:41,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:41,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643693141] [2025-01-08 22:27:41,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643693141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:27:41,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:27:41,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:27:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301327547] [2025-01-08 22:27:41,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:27:41,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:27:41,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:41,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:27:41,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:41,685 INFO L87 Difference]: Start difference. First operand 16 states and 21 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:27:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:41,715 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2025-01-08 22:27:41,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:27:41,716 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:27:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:41,717 INFO L225 Difference]: With dead ends: 35 [2025-01-08 22:27:41,717 INFO L226 Difference]: Without dead ends: 28 [2025-01-08 22:27:41,717 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:27:41,718 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:41,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 11 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-08 22:27:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2025-01-08 22:27:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-01-08 22:27:41,724 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 11 [2025-01-08 22:27:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:41,724 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-01-08 22:27:41,725 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:27:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2025-01-08 22:27:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-08 22:27:41,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:41,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:41,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:27:41,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:41,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash -919024843, now seen corresponding path program 1 times [2025-01-08 22:27:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:41,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508616758] [2025-01-08 22:27:41,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:41,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:41,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-08 22:27:41,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-08 22:27:41,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:41,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:27:41,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:41,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508616758] [2025-01-08 22:27:41,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508616758] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:41,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838713458] [2025-01-08 22:27:41,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:41,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:41,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:41,844 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:27:41,846 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:27:41,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-08 22:27:41,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-08 22:27:41,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:41,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:41,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:27:41,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:27:41,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:27:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:27:41,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838713458] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:27:41,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:27:41,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-08 22:27:41,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479206354] [2025-01-08 22:27:41,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:27:41,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:27:41,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:41,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:27:41,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:27:41,990 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:42,060 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2025-01-08 22:27:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:27:42,060 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-08 22:27:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:42,061 INFO L225 Difference]: With dead ends: 52 [2025-01-08 22:27:42,061 INFO L226 Difference]: Without dead ends: 38 [2025-01-08 22:27:42,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 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:27:42,062 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:42,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 24 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-08 22:27:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-01-08 22:27:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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:27:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-01-08 22:27:42,067 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 14 [2025-01-08 22:27:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:42,067 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-01-08 22:27:42,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-01-08 22:27:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:27:42,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:42,067 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:42,076 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:27:42,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:42,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:42,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash 10444021, now seen corresponding path program 2 times [2025-01-08 22:27:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:42,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293097463] [2025-01-08 22:27:42,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:27:42,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:42,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-08 22:27:42,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:27:42,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:27:42,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:27:42,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:42,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293097463] [2025-01-08 22:27:42,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293097463] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:42,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922925931] [2025-01-08 22:27:42,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:27:42,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:42,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:42,362 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:27:42,364 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:27:42,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-08 22:27:42,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:27:42,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:27:42,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:42,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:27:42,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:27:42,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:27:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:27:42,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922925931] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:27:42,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:27:42,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-08 22:27:42,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150277523] [2025-01-08 22:27:42,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:27:42,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:27:42,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:42,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:27:42,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:27:42,494 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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:27:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:42,536 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2025-01-08 22:27:42,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:27:42,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-08 22:27:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:42,538 INFO L225 Difference]: With dead ends: 73 [2025-01-08 22:27:42,538 INFO L226 Difference]: Without dead ends: 50 [2025-01-08 22:27:42,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:27:42,539 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:42,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-08 22:27:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-08 22:27:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 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:27:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-01-08 22:27:42,546 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 20 [2025-01-08 22:27:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:42,547 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-01-08 22:27:42,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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:27:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-01-08 22:27:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-08 22:27:42,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:42,547 INFO L218 NwaCegarLoop]: trace histogram [16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:42,554 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:27:42,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:42,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:42,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1780998151, now seen corresponding path program 3 times [2025-01-08 22:27:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:42,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201404056] [2025-01-08 22:27:42,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:27:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:42,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 13 equivalence classes. [2025-01-08 22:27:42,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 38 statements. [2025-01-08 22:27:42,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:27:42,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-01-08 22:27:42,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:42,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201404056] [2025-01-08 22:27:42,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201404056] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:42,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191046171] [2025-01-08 22:27:42,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:27:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:42,828 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:27:42,863 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:27:42,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 13 equivalence classes. [2025-01-08 22:27:42,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 38 statements. [2025-01-08 22:27:42,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:27:42,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:42,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:27:42,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-01-08 22:27:42,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:27:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-01-08 22:27:43,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191046171] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:27:43,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:27:43,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-08 22:27:43,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16247404] [2025-01-08 22:27:43,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:27:43,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:27:43,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:43,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:27:43,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:27:43,038 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:43,122 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2025-01-08 22:27:43,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:27:43,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-08 22:27:43,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:43,124 INFO L225 Difference]: With dead ends: 133 [2025-01-08 22:27:43,124 INFO L226 Difference]: Without dead ends: 117 [2025-01-08 22:27:43,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:27:43,124 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 94 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:43,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 27 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:27:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-08 22:27:43,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 68. [2025-01-08 22:27:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 67 states have internal predecessors, (82), 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:27:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2025-01-08 22:27:43,144 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 38 [2025-01-08 22:27:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:43,144 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2025-01-08 22:27:43,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2025-01-08 22:27:43,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-08 22:27:43,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:43,145 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:43,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:27:43,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:43,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:43,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash -641965131, now seen corresponding path program 4 times [2025-01-08 22:27:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409590284] [2025-01-08 22:27:43,346 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:27:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:43,363 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-01-08 22:27:43,391 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-01-08 22:27:43,391 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:27:43,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-01-08 22:27:43,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:43,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409590284] [2025-01-08 22:27:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409590284] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:43,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961581867] [2025-01-08 22:27:43,548 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:27:43,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:43,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:43,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:27:43,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:27:43,615 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-01-08 22:27:43,647 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 56 statements. [2025-01-08 22:27:43,647 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:27:43,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:43,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-01-08 22:27:43,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:43,697 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:27:43,731 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-08 22:27:43,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-01-08 22:27:43,762 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-08 22:27:43,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-01-08 22:27:43,790 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-08 22:27:43,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-01-08 22:27:43,815 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-01-08 22:27:43,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2025-01-08 22:27:43,889 INFO L349 Elim1Store]: treesize reduction 87, result has 21.6 percent of original size [2025-01-08 22:27:43,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 76 [2025-01-08 22:27:43,966 INFO L349 Elim1Store]: treesize reduction 145, result has 21.6 percent of original size [2025-01-08 22:27:43,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 108 [2025-01-08 22:27:44,102 INFO L349 Elim1Store]: treesize reduction 211, result has 21.0 percent of original size [2025-01-08 22:27:44,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 140 [2025-01-08 22:27:55,304 INFO L349 Elim1Store]: treesize reduction 349, result has 17.1 percent of original size [2025-01-08 22:27:55,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 161 treesize of output 172 [2025-01-08 22:28:06,412 INFO L349 Elim1Store]: treesize reduction 463, result has 16.0 percent of original size [2025-01-08 22:28:06,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 190 treesize of output 204 [2025-01-08 22:28:22,806 INFO L349 Elim1Store]: treesize reduction 585, result has 15.1 percent of original size [2025-01-08 22:28:22,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 219 treesize of output 236 [2025-01-08 22:28:28,716 INFO L349 Elim1Store]: treesize reduction 715, result has 14.4 percent of original size [2025-01-08 22:28:28,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 248 treesize of output 268 [2025-01-08 22:28:41,292 INFO L349 Elim1Store]: treesize reduction 917, result has 12.9 percent of original size [2025-01-08 22:28:41,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 277 treesize of output 300 [2025-01-08 22:29:23,118 INFO L349 Elim1Store]: treesize reduction 1095, result has 12.2 percent of original size [2025-01-08 22:29:23,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 306 treesize of output 332