./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:49:52,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:49:52,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:49:52,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:49:52,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:49:52,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:49:52,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:49:52,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:49:52,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:49:52,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:49:52,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:49:52,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:49:52,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:49:52,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:49:52,121 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:49:52,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:49:52,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:49:52,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:49:52,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:49:52,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:49:52,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:49:52,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:49:52,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:49:52,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:49:52,122 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:49:52,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:49:52,122 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:49:52,122 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:49:52,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:49:52,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:49:52,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:49:52,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:49:52,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:49:52,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:49:52,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:49:52,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:49:52,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:49:52,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:49:52,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:49:52,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:49:52,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:49:52,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:49:52,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:49:52,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:49:52,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:49:52,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:49:52,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:49:52,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:49:52,125 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2025-01-09 02:49:52,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:49:52,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:49:52,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:49:52,367 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:49:52,367 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:49:52,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2025-01-09 02:49:53,687 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c63c95de/7d862050f43f4373b4e91bd941b412e5/FLAG9f636c252 [2025-01-09 02:49:53,948 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:49:53,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2025-01-09 02:49:53,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c63c95de/7d862050f43f4373b4e91bd941b412e5/FLAG9f636c252 [2025-01-09 02:49:53,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c63c95de/7d862050f43f4373b4e91bd941b412e5 [2025-01-09 02:49:53,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:49:53,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:49:53,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:49:53,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:49:53,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:49:53,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:49:53" (1/1) ... [2025-01-09 02:49:53,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a9f603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:53, skipping insertion in model container [2025-01-09 02:49:53,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:49:53" (1/1) ... [2025-01-09 02:49:53,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:49:54,209 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/list-simple/sll2n_insert_equal.i[24301,24314] [2025-01-09 02:49:54,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:49:54,221 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:49:54,245 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/list-simple/sll2n_insert_equal.i[24301,24314] [2025-01-09 02:49:54,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:49:54,261 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:49:54,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54 WrapperNode [2025-01-09 02:49:54,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:49:54,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:49:54,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:49:54,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:49:54,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,292 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 109 [2025-01-09 02:49:54,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:49:54,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:49:54,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:49:54,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:49:54,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,322 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2025-01-09 02:49:54,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:49:54,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:49:54,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:49:54,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:49:54,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (1/1) ... [2025-01-09 02:49:54,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:49:54,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:54,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:49:54,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:49:54,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:49:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:49:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:49:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:49:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:49:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:49:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 02:49:54,393 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 02:49:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:49:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:49:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:49:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:49:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:49:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:49:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:49:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:49:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:49:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:49:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:49:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:49:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:49:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:49:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:49:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:49:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:49:54,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:49:54,479 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:49:54,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:49:54,659 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-01-09 02:49:54,659 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:49:54,667 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:49:54,668 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:49:54,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:54 BoogieIcfgContainer [2025-01-09 02:49:54,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:49:54,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:49:54,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:49:54,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:49:54,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:49:53" (1/3) ... [2025-01-09 02:49:54,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3a30a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:54, skipping insertion in model container [2025-01-09 02:49:54,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54" (2/3) ... [2025-01-09 02:49:54,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3a30a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:54, skipping insertion in model container [2025-01-09 02:49:54,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:54" (3/3) ... [2025-01-09 02:49:54,677 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2025-01-09 02:49:54,686 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:49:54,688 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_equal.i that has 2 procedures, 28 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 02:49:54,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:49:54,736 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;@76f818c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:49:54,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:49:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:54,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 02:49:54,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:54,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:54,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:54,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:54,750 INFO L85 PathProgramCache]: Analyzing trace with hash -115069216, now seen corresponding path program 1 times [2025-01-09 02:49:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:54,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670258714] [2025-01-09 02:49:54,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:54,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 02:49:54,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 02:49:54,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:54,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:54,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:54,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:54,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670258714] [2025-01-09 02:49:54,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670258714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:54,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:49:54,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:49:55,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038127937] [2025-01-09 02:49:55,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:55,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:49:55,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:55,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:49:55,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:49:55,017 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:49:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:55,045 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2025-01-09 02:49:55,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:49:55,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-09 02:49:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:55,053 INFO L225 Difference]: With dead ends: 54 [2025-01-09 02:49:55,053 INFO L226 Difference]: Without dead ends: 25 [2025-01-09 02:49:55,056 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-09 02:49:55,059 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:55,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-09 02:49:55,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-01-09 02:49:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-01-09 02:49:55,083 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2025-01-09 02:49:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:55,083 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-01-09 02:49:55,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:49:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-01-09 02:49:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:49:55,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:55,084 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:55,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:49:55,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:55,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash -760647256, now seen corresponding path program 1 times [2025-01-09 02:49:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:55,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634008108] [2025-01-09 02:49:55,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:55,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:49:55,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:49:55,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:55,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:49:55,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:55,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634008108] [2025-01-09 02:49:55,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634008108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:55,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838714737] [2025-01-09 02:49:55,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:55,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:55,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:55,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:55,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:49:55,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:49:55,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:49:55,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:55,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:55,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:49:55,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:55,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:49:55,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838714737] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:49:55,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:49:55,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 02:49:55,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283913286] [2025-01-09 02:49:55,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:55,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:49:55,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:55,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:49:55,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:49:55,400 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 02:49:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:55,418 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2025-01-09 02:49:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:49:55,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-01-09 02:49:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:55,424 INFO L225 Difference]: With dead ends: 43 [2025-01-09 02:49:55,424 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 02:49:55,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:49:55,425 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:55,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 02:49:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 02:49:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-01-09 02:49:55,428 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 26 [2025-01-09 02:49:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:55,428 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-01-09 02:49:55,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 02:49:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-01-09 02:49:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:49:55,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:55,429 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:55,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 02:49:55,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:55,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:55,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:55,631 INFO L85 PathProgramCache]: Analyzing trace with hash -784110480, now seen corresponding path program 2 times [2025-01-09 02:49:55,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:55,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627408930] [2025-01-09 02:49:55,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:49:55,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:55,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-09 02:49:55,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 34 statements. [2025-01-09 02:49:55,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 02:49:55,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 02:49:55,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:55,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627408930] [2025-01-09 02:49:55,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627408930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:55,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:49:55,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:49:55,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707301618] [2025-01-09 02:49:55,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:55,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:49:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:55,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:49:55,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:49:55,687 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 02:49:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:55,696 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2025-01-09 02:49:55,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:49:55,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-01-09 02:49:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:55,697 INFO L225 Difference]: With dead ends: 35 [2025-01-09 02:49:55,697 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 02:49:55,697 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-09 02:49:55,698 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:55,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 02:49:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 02:49:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-01-09 02:49:55,701 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 34 [2025-01-09 02:49:55,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:55,701 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-01-09 02:49:55,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 02:49:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-01-09 02:49:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:49:55,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:55,702 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:55,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:49:55,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:55,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash -726852178, now seen corresponding path program 1 times [2025-01-09 02:49:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:55,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929348154] [2025-01-09 02:49:55,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:55,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:49:55,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:49:55,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:55,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 02:49:56,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929348154] [2025-01-09 02:49:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929348154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:56,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:49:56,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 02:49:56,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692814438] [2025-01-09 02:49:56,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:56,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 02:49:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:56,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 02:49:56,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:49:56,436 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:56,584 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-01-09 02:49:56,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 02:49:56,585 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-01-09 02:49:56,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:56,585 INFO L225 Difference]: With dead ends: 39 [2025-01-09 02:49:56,585 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 02:49:56,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-09 02:49:56,586 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:56,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 116 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:49:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 02:49:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-01-09 02:49:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-01-09 02:49:56,590 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 34 [2025-01-09 02:49:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:56,590 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-01-09 02:49:56,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:56,591 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-01-09 02:49:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:49:56,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:56,591 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:56,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:49:56,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:56,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash -726845234, now seen corresponding path program 1 times [2025-01-09 02:49:56,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:56,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798356726] [2025-01-09 02:49:56,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:56,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:56,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:49:56,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:49:56,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:56,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 02:49:56,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:56,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798356726] [2025-01-09 02:49:56,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798356726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:56,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:49:56,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 02:49:56,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702716302] [2025-01-09 02:49:56,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:56,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:49:56,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:56,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:49:56,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:49:56,796 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:56,842 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-01-09 02:49:56,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 02:49:56,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-01-09 02:49:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:56,842 INFO L225 Difference]: With dead ends: 40 [2025-01-09 02:49:56,843 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 02:49:56,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:49:56,843 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:56,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 128 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 02:49:56,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-01-09 02:49:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-01-09 02:49:56,847 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 34 [2025-01-09 02:49:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:56,847 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-01-09 02:49:56,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:56,848 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-01-09 02:49:56,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:49:56,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:56,848 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:56,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:49:56,848 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:56,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash -507271748, now seen corresponding path program 1 times [2025-01-09 02:49:56,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:56,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982578270] [2025-01-09 02:49:56,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:56,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:56,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:49:56,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:49:56,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:56,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:49:57,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:57,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982578270] [2025-01-09 02:49:57,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982578270] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:57,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150926573] [2025-01-09 02:49:57,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:57,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:57,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:57,765 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:57,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:49:57,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:49:57,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:49:57,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:57,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:57,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-01-09 02:49:57,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:58,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-01-09 02:49:58,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:58,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 02:49:58,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 02:49:58,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:49:58,451 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:49:58,451 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 20 treesize of output 23 [2025-01-09 02:49:58,471 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:49:58,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-01-09 02:49:58,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-01-09 02:49:58,776 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 20 treesize of output 15 [2025-01-09 02:49:58,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:49:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:49:58,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:07,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150926573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:07,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:50:07,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2025-01-09 02:50:07,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102326494] [2025-01-09 02:50:07,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:07,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 02:50:07,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:07,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 02:50:07,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1313, Unknown=44, NotChecked=0, Total=1482 [2025-01-09 02:50:07,783 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 34 states, 32 states have (on average 1.4375) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:50:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:08,503 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-01-09 02:50:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 02:50:08,504 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.4375) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-01-09 02:50:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:08,505 INFO L225 Difference]: With dead ends: 50 [2025-01-09 02:50:08,505 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 02:50:08,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=175, Invalid=2036, Unknown=45, NotChecked=0, Total=2256 [2025-01-09 02:50:08,506 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:08,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 276 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 02:50:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 02:50:08,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2025-01-09 02:50:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:50:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-01-09 02:50:08,519 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 35 [2025-01-09 02:50:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:08,519 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-01-09 02:50:08,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.4375) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:50:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-01-09 02:50:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:50:08,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:08,521 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:08,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 02:50:08,721 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-09 02:50:08,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:08,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:08,723 INFO L85 PathProgramCache]: Analyzing trace with hash -507264804, now seen corresponding path program 1 times [2025-01-09 02:50:08,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:08,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095437566] [2025-01-09 02:50:08,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:08,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:08,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:50:08,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:50:08,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:08,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 02:50:08,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:08,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095437566] [2025-01-09 02:50:08,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095437566] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:08,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105836282] [2025-01-09 02:50:08,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:08,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:08,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:08,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:50:08,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:50:08,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:50:08,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:50:08,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:08,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:08,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 02:50:08,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:09,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 02:50:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 02:50:09,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 02:50:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105836282] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:50:09,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:50:09,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 10 [2025-01-09 02:50:09,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001326123] [2025-01-09 02:50:09,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:09,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 02:50:09,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:09,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 02:50:09,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:50:09,095 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:50:13,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:50:17,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:50:21,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:50:25,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:50:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:25,229 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2025-01-09 02:50:25,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 02:50:25,230 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-01-09 02:50:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:25,231 INFO L225 Difference]: With dead ends: 52 [2025-01-09 02:50:25,232 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 02:50:25,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 02:50:25,232 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:25,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 197 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-01-09 02:50:25,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 02:50:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2025-01-09 02:50:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:50:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-01-09 02:50:25,240 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 35 [2025-01-09 02:50:25,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:25,241 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-01-09 02:50:25,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:50:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-01-09 02:50:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:50:25,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:25,243 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:25,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 02:50:25,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:25,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:25,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:25,444 INFO L85 PathProgramCache]: Analyzing trace with hash -515205648, now seen corresponding path program 2 times [2025-01-09 02:50:25,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:25,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406395030] [2025-01-09 02:50:25,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:50:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:25,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 02:50:25,475 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:50:25,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:50:25,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 02:50:25,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:25,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406395030] [2025-01-09 02:50:25,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406395030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:50:25,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:50:25,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:50:25,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628591949] [2025-01-09 02:50:25,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:50:25,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:50:25,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:25,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:50:25,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:50:25,562 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:50:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:25,586 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2025-01-09 02:50:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:50:25,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-01-09 02:50:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:25,587 INFO L225 Difference]: With dead ends: 51 [2025-01-09 02:50:25,587 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 02:50:25,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:50:25,588 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:25,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 52 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:50:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 02:50:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-01-09 02:50:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:50:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-01-09 02:50:25,595 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 36 [2025-01-09 02:50:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:25,595 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-01-09 02:50:25,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:50:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-01-09 02:50:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:50:25,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:25,596 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:25,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 02:50:25,596 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:25,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:25,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1574765801, now seen corresponding path program 1 times [2025-01-09 02:50:25,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:25,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951973850] [2025-01-09 02:50:25,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:25,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:25,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:50:25,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:50:25,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:25,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 02:50:25,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:25,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951973850] [2025-01-09 02:50:25,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951973850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:50:25,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:50:25,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:50:25,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362188881] [2025-01-09 02:50:25,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:50:25,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:50:25,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:25,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:50:25,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:50:25,668 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:50:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:25,689 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2025-01-09 02:50:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:50:25,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-01-09 02:50:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:25,690 INFO L225 Difference]: With dead ends: 46 [2025-01-09 02:50:25,690 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 02:50:25,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:50:25,692 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:25,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 52 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:50:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 02:50:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-01-09 02:50:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:50:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-01-09 02:50:25,699 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 36 [2025-01-09 02:50:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:25,699 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-01-09 02:50:25,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:50:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-01-09 02:50:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 02:50:25,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:25,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:25,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 02:50:25,701 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:25,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2138161527, now seen corresponding path program 1 times [2025-01-09 02:50:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766180325] [2025-01-09 02:50:25,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:25,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 02:50:25,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 02:50:25,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:25,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:50:26,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:26,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766180325] [2025-01-09 02:50:26,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766180325] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:26,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007936129] [2025-01-09 02:50:26,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:26,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:26,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:26,637 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:50:26,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 02:50:26,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 02:50:26,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 02:50:26,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:26,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:26,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-01-09 02:50:26,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:26,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-01-09 02:50:26,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 02:50:27,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:50:27,130 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:50:27,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-01-09 02:50:27,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:50:27,357 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 24 treesize of output 11 [2025-01-09 02:50:27,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:50:27,438 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-09 02:50:27,439 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2025-01-09 02:50:27,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2025-01-09 02:50:27,449 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 36 treesize of output 15 [2025-01-09 02:50:27,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2025-01-09 02:50:27,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 02:50:27,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-01-09 02:50:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:50:27,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:27,753 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_816 (Array Int Int)) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (or (not (= v_ArrVal_817 (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_817 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_816) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_818) .cse1) .cse2)))))) is different from false [2025-01-09 02:50:27,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:27,763 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 68 [2025-01-09 02:50:27,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:27,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 129 [2025-01-09 02:50:27,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:27,782 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 96 [2025-01-09 02:50:27,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2025-01-09 02:50:27,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:27,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 145 [2025-01-09 02:50:27,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-01-09 02:50:28,068 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse1 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse19))) (let ((.cse11 (not .cse1)) (.cse12 (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) v_arrayElimCell_23) v_arrayElimCell_26)) (not (= v_ArrVal_817 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_817 .cse0)))))))) (let ((.cse5 (or .cse11 .cse12)) (.cse2 (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_814))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) v_arrayElimCell_23) v_arrayElimCell_26)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_817 v_arrayElimCell_24)) (not (= v_ArrVal_817 (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_817 .cse0)))))))) (.cse3 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (or (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_814))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) v_arrayElimCell_21) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_817 (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_817 .cse0))))))) .cse1)) (.cse10 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse19)) (.cse7 (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_814))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_23) v_arrayElimCell_26)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_21) v_arrayElimCell_24)) (not (= v_ArrVal_817 (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_817 .cse0))))))))) (.cse8 (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_814))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_23) v_arrayElimCell_26)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_21) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_817 (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_817 .cse0))))))))) (.cse9 (or (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_24 Int) (v_arrayElimCell_21 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_814))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) v_arrayElimCell_21) v_arrayElimCell_24)) (not (= v_ArrVal_817 (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_817 .cse0))))))) .cse1))) (and (or (and (or (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_24 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 v_DerPreprocessor_1) v_arrayElimCell_24))) .cse1) .cse2) .cse3) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int)) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_814))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) v_arrayElimCell_23) v_arrayElimCell_26)) (not (= v_ArrVal_817 (store (select .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_817 .cse0)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_817 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))) (or (forall ((v_ArrVal_814 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) .cse1) (or (and .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse10 (and .cse5 .cse2 (or (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_24 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 v_DerPreprocessor_2) v_arrayElimCell_24))) .cse1))) (or .cse3 (and .cse6 (or .cse10 .cse11 .cse12) .cse7 .cse8 .cse9)) (or .cse11 (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_814))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) v_arrayElimCell_23) v_arrayElimCell_26)) (not (= v_ArrVal_817 (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_817 .cse0))))))))))))) is different from false [2025-01-09 02:50:28,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse18)) (.cse7 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (let ((.cse12 (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int)) (or (not (= v_ArrVal_817 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_817 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) v_arrayElimCell_23) v_arrayElimCell_26))))) (.cse10 (not .cse8))) (let ((.cse9 (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_814))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_817 v_arrayElimCell_24)) (not (= v_ArrVal_817 (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_817 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) v_arrayElimCell_23) v_arrayElimCell_26)))))) (.cse3 (or .cse12 .cse10)) (.cse1 (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_814))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_21) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_817 (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_817 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_23) v_arrayElimCell_26))))))) (.cse0 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| .cse18)) (.cse2 (or (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_24 Int) (v_arrayElimCell_21 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_814))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) v_arrayElimCell_21) v_arrayElimCell_24)) (not (= v_ArrVal_817 (store (select .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_817 .cse7))))))) .cse8)) (.cse4 (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_814))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_21) v_arrayElimCell_24)) (not (= v_ArrVal_817 (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_817 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_23) v_arrayElimCell_26))))))) (.cse5 (or (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_814))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) v_arrayElimCell_21) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_817 (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_817 .cse7))))))) .cse8)) (.cse6 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5)) (or .cse6 (and (or (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_24 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 v_DerPreprocessor_1) v_arrayElimCell_24))) .cse8) .cse9)) (or .cse0 (and (or (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_24 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 v_DerPreprocessor_2) v_arrayElimCell_24))) .cse8) .cse9 .cse3)) (or .cse10 (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_814))) (or (not (= v_ArrVal_817 (store (select .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_817 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) v_arrayElimCell_23) v_arrayElimCell_26)))))) (or (and .cse1 (or .cse12 .cse10 .cse0) .cse2 .cse4 .cse5) .cse6) (or (forall ((v_ArrVal_814 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|)) .cse8) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_814))) (or (not (= v_ArrVal_817 (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_817 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_817) v_arrayElimCell_23) v_arrayElimCell_26)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_817 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))))))))) is different from false [2025-01-09 02:50:28,681 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse18)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse8 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))) (let ((.cse14 (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int)) (or (= (select (select (store (store |c_#memory_int#1| .cse7 v_ArrVal_814) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_817) v_arrayElimCell_23) v_arrayElimCell_26) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_817 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 (select v_ArrVal_817 .cse8))))))) (.cse13 (not .cse6))) (let ((.cse2 (or .cse14 .cse13)) (.cse9 (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int)) (let ((.cse22 (store |c_#memory_int#1| .cse7 v_ArrVal_814))) (or (= (select (select (store .cse22 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_817) v_arrayElimCell_23) v_arrayElimCell_26) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_817 v_arrayElimCell_24)) (not (= v_ArrVal_817 (store (select .cse22 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 (select v_ArrVal_817 .cse8)))))))) (.cse1 (or .cse6 (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse21 (store |c_#memory_int#1| .cse7 v_ArrVal_814))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_817) v_arrayElimCell_21) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (not (= v_ArrVal_817 (store (select .cse21 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 (select v_ArrVal_817 .cse8))))))))) (.cse3 (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (let ((.cse20 (store |c_#memory_int#1| .cse7 v_ArrVal_814))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_817))) (or (= (select (select .cse19 v_arrayElimCell_23) v_arrayElimCell_26) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_21) v_arrayElimCell_24)) (not (= v_ArrVal_817 (store (select .cse20 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 (select v_ArrVal_817 .cse8))))))))) (.cse0 (= .cse7 .cse18)) (.cse4 (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (let ((.cse17 (store |c_#memory_int#1| .cse7 v_ArrVal_814))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_817))) (or (= (select (select .cse16 v_arrayElimCell_23) v_arrayElimCell_26) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_21) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (not (= v_ArrVal_817 (store (select .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 (select v_ArrVal_817 .cse8))))))))) (.cse5 (or .cse6 (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_24 Int) (v_arrayElimCell_21 Int)) (let ((.cse15 (store |c_#memory_int#1| .cse7 v_ArrVal_814))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_817) v_arrayElimCell_21) v_arrayElimCell_24)) (not (= v_ArrVal_817 (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 (select v_ArrVal_817 .cse8))))))))) (.cse10 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5)) (or .cse0 (and .cse2 (or .cse6 (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_24 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse7 v_ArrVal_814) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_DerPreprocessor_2) v_arrayElimCell_24)))) .cse9)) (or .cse6 (forall ((v_ArrVal_814 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse7 v_ArrVal_814) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))) (or (and (or .cse6 (forall ((v_ArrVal_814 (Array Int Int)) (v_arrayElimCell_24 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse7 v_ArrVal_814) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_DerPreprocessor_1) v_arrayElimCell_24)))) .cse9) .cse10) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int)) (let ((.cse11 (store |c_#memory_int#1| .cse7 v_ArrVal_814))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_817 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (= (select (select (store .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_817) v_arrayElimCell_23) v_arrayElimCell_26) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_817 (store (select .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 (select v_ArrVal_817 .cse8))))))) (or (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int)) (let ((.cse12 (store |c_#memory_int#1| .cse7 v_ArrVal_814))) (or (= (select (select (store .cse12 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_817) v_arrayElimCell_23) v_arrayElimCell_26) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_817 (store (select .cse12 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 (select v_ArrVal_817 .cse8))))))) .cse13) (or (and .cse1 .cse3 (or .cse14 .cse0 .cse13) .cse4 .cse5) .cse10)))))) is different from false [2025-01-09 02:50:31,145 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2025-01-09 02:50:31,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 2413 treesize of output 2604 [2025-01-09 02:50:31,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1625 treesize of output 1623 [2025-01-09 02:50:31,502 INFO L224 Elim1Store]: Index analysis took 130 ms [2025-01-09 02:50:33,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:33,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 2133 treesize of output 3583 [2025-01-09 02:50:34,282 INFO L349 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2025-01-09 02:50:34,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1924 treesize of output 1954 [2025-01-09 02:50:34,733 INFO L349 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2025-01-09 02:50:34,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1915 treesize of output 1932 [2025-01-09 02:50:35,659 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-01-09 02:50:35,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1908 treesize of output 1921 [2025-01-09 02:50:36,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:36,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1901 treesize of output 1909 [2025-01-09 02:50:37,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1896 treesize of output 1894 [2025-01-09 02:50:37,504 INFO L349 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2025-01-09 02:50:37,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1894 treesize of output 1924 [2025-01-09 02:50:38,018 INFO L349 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2025-01-09 02:50:38,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1885 treesize of output 1902 [2025-01-09 02:50:38,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:38,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1878 treesize of output 1886 [2025-01-09 02:50:39,749 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-01-09 02:50:39,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1873 treesize of output 1886 [2025-01-09 02:50:40,254 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-01-09 02:50:40,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1866 treesize of output 1879 [2025-01-09 02:50:40,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1859 treesize of output 1857 [2025-01-09 02:50:41,217 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-01-09 02:50:41,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1857 treesize of output 1870 [2025-01-09 02:50:41,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1860 treesize of output 1858 [2025-01-09 02:50:42,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1868 treesize of output 1866 [2025-01-09 02:50:42,747 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-01-09 02:50:42,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1866 treesize of output 1879 [2025-01-09 02:50:43,336 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-01-09 02:50:43,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1859 treesize of output 1872 [2025-01-09 02:50:43,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1852 treesize of output 1850