./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.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_prepend_unequal.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 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:50:26,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:50:26,955 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:50:26,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:50:26,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:50:26,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:50:27,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:50:27,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:50:27,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:50:27,001 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:50:27,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:50:27,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:50:27,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:50:27,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:50:27,003 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:50:27,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:50:27,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:50:27,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:50:27,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:50:27,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:50:27,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:50:27,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:50:27,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:50:27,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:50:27,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:50:27,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:50:27,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:50:27,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:50:27,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:50:27,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:50:27,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:50:27,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:50:27,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:50:27,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:50:27,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:50:27,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:50:27,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:50:27,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:50:27,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:50:27,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:50:27,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:50:27,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:50:27,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:50:27,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:50:27,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:50:27,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:50:27,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:50:27,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:50:27,006 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2025-01-09 02:50:27,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:50:27,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:50:27,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:50:27,327 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:50:27,328 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:50:27,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2025-01-09 02:50:28,645 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d76d46c9a/03832c513da34406aaa36870a5e532e2/FLAG4dd0156fb [2025-01-09 02:50:29,029 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:50:29,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2025-01-09 02:50:29,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d76d46c9a/03832c513da34406aaa36870a5e532e2/FLAG4dd0156fb [2025-01-09 02:50:29,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d76d46c9a/03832c513da34406aaa36870a5e532e2 [2025-01-09 02:50:29,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:50:29,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:50:29,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:50:29,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:50:29,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:50:29,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45dd29d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29, skipping insertion in model container [2025-01-09 02:50:29,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:50:29,407 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_prepend_unequal.i[24165,24178] [2025-01-09 02:50:29,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:50:29,420 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:50:29,459 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_prepend_unequal.i[24165,24178] [2025-01-09 02:50:29,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:50:29,483 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:50:29,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29 WrapperNode [2025-01-09 02:50:29,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:50:29,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:50:29,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:50:29,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:50:29,492 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:50:29" (1/1) ... [2025-01-09 02:50:29,505 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:50:29" (1/1) ... [2025-01-09 02:50:29,526 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 105 [2025-01-09 02:50:29,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:50:29,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:50:29,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:50:29,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:50:29,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,553 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 5, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2025-01-09 02:50:29,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:50:29,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:50:29,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:50:29,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:50:29,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29" (1/1) ... [2025-01-09 02:50:29,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:50:29,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:29,599 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:50:29,603 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:50:29,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:50:29,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:50:29,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:50:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:50:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:50:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:50:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 02:50:29,628 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 02:50:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:50:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:50:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:50:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:50:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:50:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:50:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:50:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:50:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:50:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:50:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:50:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:50:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:50:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:50:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:50:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:50:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:50:29,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:50:29,765 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:50:29,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:50:29,919 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-01-09 02:50:29,919 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:50:29,926 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:50:29,928 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:50:29,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:50:29 BoogieIcfgContainer [2025-01-09 02:50:29,930 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:50:29,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:50:29,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:50:29,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:50:29,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:50:29" (1/3) ... [2025-01-09 02:50:29,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d7d67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:50:29, skipping insertion in model container [2025-01-09 02:50:29,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:29" (2/3) ... [2025-01-09 02:50:29,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d7d67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:50:29, skipping insertion in model container [2025-01-09 02:50:29,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:50:29" (3/3) ... [2025-01-09 02:50:29,939 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2025-01-09 02:50:29,951 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:50:29,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_unequal.i that has 2 procedures, 26 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 02:50:30,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:50:30,017 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;@fa27a22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:50:30,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:50:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 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:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 02:50:30,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:30,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:30,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:30,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash -36640323, now seen corresponding path program 1 times [2025-01-09 02:50:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:30,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737421442] [2025-01-09 02:50:30,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:30,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:30,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 02:50:30,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 02:50:30,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:30,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:30,353 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:50:30,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737421442] [2025-01-09 02:50:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737421442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:50:30,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:50:30,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:50:30,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723543836] [2025-01-09 02:50:30,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:50:30,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:50:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:30,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:50:30,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:50:30,374 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 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 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:50:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:30,413 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2025-01-09 02:50:30,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:50:30,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-01-09 02:50:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:30,423 INFO L225 Difference]: With dead ends: 50 [2025-01-09 02:50:30,423 INFO L226 Difference]: Without dead ends: 23 [2025-01-09 02:50:30,425 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:50:30,429 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 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:50:30,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:50:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-09 02:50:30,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-01-09 02:50:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-01-09 02:50:30,463 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2025-01-09 02:50:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:30,464 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-01-09 02:50:30,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:50:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-01-09 02:50:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 02:50:30,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:30,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:30,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:50:30,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:30,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1674759291, now seen corresponding path program 1 times [2025-01-09 02:50:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340691134] [2025-01-09 02:50:30,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:30,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 02:50:30,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 02:50:30,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:30,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:30,659 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:50:30,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:30,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340691134] [2025-01-09 02:50:30,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340691134] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:30,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950918254] [2025-01-09 02:50:30,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:30,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:30,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:30,664 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:50:30,677 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:50:30,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 02:50:30,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 02:50:30,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:30,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:30,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:50:30,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:30,872 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:50:30,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:30,925 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:50:30,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950918254] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:50:30,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:50:30,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 02:50:30,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984707009] [2025-01-09 02:50:30,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:30,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:50:30,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:30,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:50:30,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:50:30,929 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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:50:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:30,958 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-01-09 02:50:30,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:50:30,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 22 [2025-01-09 02:50:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:30,960 INFO L225 Difference]: With dead ends: 39 [2025-01-09 02:50:30,960 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 02:50:30,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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:50:30,961 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:30,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:50:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 02:50:30,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-09 02:50:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:50:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-01-09 02:50:30,968 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 22 [2025-01-09 02:50:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:30,969 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-01-09 02:50:30,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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:50:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-01-09 02:50:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 02:50:30,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:30,971 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:30,979 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:50:31,171 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:50:31,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:31,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2007446861, now seen corresponding path program 2 times [2025-01-09 02:50:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:31,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68240066] [2025-01-09 02:50:31,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:50:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:31,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-09 02:50:31,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 30 statements. [2025-01-09 02:50:31,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 02:50:31,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:31,717 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:50:31,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68240066] [2025-01-09 02:50:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68240066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:50:31,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:50:31,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 02:50:31,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439095212] [2025-01-09 02:50:31,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:50:31,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 02:50:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:31,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 02:50:31,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:50:31,721 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:50:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:31,831 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2025-01-09 02:50:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:50:31,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 30 [2025-01-09 02:50:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:31,833 INFO L225 Difference]: With dead ends: 26 [2025-01-09 02:50:31,833 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 02:50:31,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:50:31,834 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:31,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:50:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 02:50:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-09 02:50:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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:50:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-01-09 02:50:31,840 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30 [2025-01-09 02:50:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:31,842 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-01-09 02:50:31,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:50:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-01-09 02:50:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:50:31,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:31,844 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] [2025-01-09 02:50:31,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:50:31,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:31,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash 716163816, now seen corresponding path program 1 times [2025-01-09 02:50:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001110482] [2025-01-09 02:50:31,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:31,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:50:31,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:50:31,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:31,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:50:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:32,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001110482] [2025-01-09 02:50:32,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001110482] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:32,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799140711] [2025-01-09 02:50:32,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:32,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:32,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:32,626 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:50:32,629 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:50:32,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:50:32,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:50:32,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:32,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:32,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 02:50:32,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:32,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:50:32,929 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 29 treesize of output 21 [2025-01-09 02:50:32,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 22 [2025-01-09 02:50:32,965 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 26 treesize of output 18 [2025-01-09 02:50:32,970 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 22 treesize of output 14 [2025-01-09 02:50:32,995 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 20 treesize of output 8 [2025-01-09 02:50:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:50:32,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:33,017 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 108 treesize of output 78 [2025-01-09 02:50:33,027 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 25 treesize of output 21 [2025-01-09 02:50:33,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:33,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:50:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799140711] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:50:33,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:50:33,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 17 [2025-01-09 02:50:33,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371942159] [2025-01-09 02:50:33,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 02:50:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:33,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 02:50:33,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-01-09 02:50:33,116 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 02:50:37,158 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:41,192 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:45,224 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:49,352 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:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:49,414 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-01-09 02:50:49,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 02:50:49,415 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2025-01-09 02:50:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:49,416 INFO L225 Difference]: With dead ends: 33 [2025-01-09 02:50:49,416 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 02:50:49,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-01-09 02:50:49,417 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:49,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 200 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2025-01-09 02:50:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 02:50:49,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-09 02:50:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-01-09 02:50:49,422 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 32 [2025-01-09 02:50:49,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:49,422 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-01-09 02:50:49,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 02:50:49,423 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-01-09 02:50:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:50:49,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:49,423 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] [2025-01-09 02:50:49,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:50:49,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:49,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:49,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:49,625 INFO L85 PathProgramCache]: Analyzing trace with hash 716156872, now seen corresponding path program 1 times [2025-01-09 02:50:49,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:49,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449544447] [2025-01-09 02:50:49,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:49,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:50:49,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:50:49,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:49,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:50:50,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:50,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449544447] [2025-01-09 02:50:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449544447] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:50,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379362021] [2025-01-09 02:50:50,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:50,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:50,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:50,976 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:50,978 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:51,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:50:51,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:50:51,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:51,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:51,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-01-09 02:50:51,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:51,308 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:51,328 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:51,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:50:51,420 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:50:51,615 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:51,621 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:50:51,627 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:50:51,875 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:50:51,875 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:50:51,899 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:50:51,899 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:51,912 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:50:52,033 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-01-09 02:50:52,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2025-01-09 02:50:52,045 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 29 treesize of output 21 [2025-01-09 02:50:52,052 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 37 treesize of output 32 [2025-01-09 02:50:52,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 40 [2025-01-09 02:50:52,071 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 38 treesize of output 25 [2025-01-09 02:50:52,142 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 89 treesize of output 65 [2025-01-09 02:50:52,147 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 69 treesize of output 49 [2025-01-09 02:50:52,222 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 46 treesize of output 22 [2025-01-09 02:50:52,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2025-01-09 02:50:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:50:52,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:52,474 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 208 treesize of output 178 [2025-01-09 02:50:52,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse6 (select .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse7 (= .cse3 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (and (forall ((v_ArrVal_437 (Array Int Int)) (v_ArrVal_440 Int)) (or (forall ((v_arrayElimCell_25 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_437) v_arrayElimCell_25) .cse0))) (= v_ArrVal_440 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.offset| v_ArrVal_440)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_437 (Array Int Int)) (v_ArrVal_440 Int)) (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_437)) (.cse4 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.offset| v_ArrVal_440)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (forall ((v_arrayElimCell_25 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 v_arrayElimCell_25) (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (+ v_ArrVal_440 4) .cse6)) .cse3) .cse4)))))) (or (forall ((v_ArrVal_437 (Array Int Int)) (v_ArrVal_440 Int)) (or (not (= v_ArrVal_440 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.offset| v_ArrVal_440)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_437) .cse5) .cse6)))) (not .cse7)) (or .cse7 (forall ((v_ArrVal_437 (Array Int Int)) (v_arrayElimCell_25 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_437) v_arrayElimCell_25) .cse0)))))))) is different from false [2025-01-09 02:50:53,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379362021] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:53,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:50:53,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 34 [2025-01-09 02:50:53,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885992661] [2025-01-09 02:50:53,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:53,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 02:50:53,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:53,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 02:50:53,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1310, Unknown=1, NotChecked=72, Total=1482 [2025-01-09 02:50:53,070 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 34 states, 32 states have (on average 1.40625) internal successors, (45), 27 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 02:50:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:54,010 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2025-01-09 02:50:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 02:50:54,011 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.40625) internal successors, (45), 27 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2025-01-09 02:50:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:54,011 INFO L225 Difference]: With dead ends: 35 [2025-01-09 02:50:54,012 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 02:50:54,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=179, Invalid=2274, Unknown=1, NotChecked=96, Total=2550 [2025-01-09 02:50:54,013 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:54,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 233 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 02:50:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 02:50:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-01-09 02:50:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-01-09 02:50:54,019 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 32 [2025-01-09 02:50:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:54,019 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-01-09 02:50:54,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.40625) internal successors, (45), 27 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 02:50:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-01-09 02:50:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:50:54,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:54,020 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:50:54,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 02:50:54,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:54,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:54,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1032032931, now seen corresponding path program 1 times [2025-01-09 02:50:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:54,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759744090] [2025-01-09 02:50:54,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:54,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:54,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:50:54,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:50:54,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:54,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:50:55,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:55,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759744090] [2025-01-09 02:50:55,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759744090] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:55,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562311740] [2025-01-09 02:50:55,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:55,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:55,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:55,420 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:55,423 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:55,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:50:55,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:50:55,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:55,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:55,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-01-09 02:50:55,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:55,608 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:55,632 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 15 treesize of output 1 [2025-01-09 02:50:55,684 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 12 treesize of output 4 [2025-01-09 02:50:55,692 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:55,854 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:50:55,854 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 21 treesize of output 24 [2025-01-09 02:50:55,867 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:50:55,867 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:55,928 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 25 treesize of output 17 [2025-01-09 02:50:55,952 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-01-09 02:50:55,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2025-01-09 02:50:55,957 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 42 treesize of output 37 [2025-01-09 02:50:55,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 34 [2025-01-09 02:50:56,012 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 69 treesize of output 49 [2025-01-09 02:50:56,015 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 53 treesize of output 37 [2025-01-09 02:50:56,069 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 9 treesize of output 3 [2025-01-09 02:50:56,149 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 02:50:56,149 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2025-01-09 02:50:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:50:56,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:56,265 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 236 treesize of output 206 [2025-01-09 02:50:56,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:56,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 311 [2025-01-09 02:50:57,197 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2025-01-09 02:50:57,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 82 [2025-01-09 02:50:57,254 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-01-09 02:50:57,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 8 [2025-01-09 02:50:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562311740] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:57,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:50:57,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2025-01-09 02:50:57,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254956737] [2025-01-09 02:50:57,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:57,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 02:50:57,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:57,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 02:50:57,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 02:50:57,566 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 22 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 02:50:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:58,328 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-01-09 02:50:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 02:50:58,328 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 22 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2025-01-09 02:50:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:58,330 INFO L225 Difference]: With dead ends: 36 [2025-01-09 02:50:58,330 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 02:50:58,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=146, Invalid=1746, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 02:50:58,332 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:58,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 295 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 02:50:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 02:50:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2025-01-09 02:50:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-01-09 02:50:58,337 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 34 [2025-01-09 02:50:58,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:58,338 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-01-09 02:50:58,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 22 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 02:50:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-01-09 02:50:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:50:58,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:58,339 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] [2025-01-09 02:50:58,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 02:50:58,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 02:50:58,539 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:58,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1032025987, now seen corresponding path program 1 times [2025-01-09 02:50:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:58,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642105787] [2025-01-09 02:50:58,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:58,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:58,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:50:58,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:50:58,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:58,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:51:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:51:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642105787] [2025-01-09 02:51:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642105787] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:51:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033168982] [2025-01-09 02:51:00,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:51:00,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:51:00,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:51:00,519 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:51:00,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 02:51:00,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:51:00,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:51:00,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:51:00,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:00,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 139 conjuncts are in the unsatisfiable core [2025-01-09 02:51:00,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:51:00,730 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:51:00,742 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:51:00,808 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:51:00,965 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:51:00,965 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:51:00,979 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 16 treesize of output 11 [2025-01-09 02:51:01,046 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:51:01,052 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:51:01,066 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 15 treesize of output 1 [2025-01-09 02:51:01,272 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 45 treesize of output 21 [2025-01-09 02:51:01,278 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 11 treesize of output 3 [2025-01-09 02:51:01,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:51:01,289 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:51:01,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:51:01,517 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 53 treesize of output 36 [2025-01-09 02:51:01,534 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-01-09 02:51:01,535 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 1 case distinctions, treesize of input 24 treesize of output 31 [2025-01-09 02:51:01,560 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:51:01,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 02:51:01,577 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 20 treesize of output 15 [2025-01-09 02:51:01,663 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 77 treesize of output 56 [2025-01-09 02:51:01,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 64 [2025-01-09 02:51:01,677 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 47 treesize of output 42 [2025-01-09 02:51:01,689 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 42 treesize of output 29 [2025-01-09 02:51:01,710 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-01-09 02:51:01,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2025-01-09 02:51:01,780 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 155 treesize of output 115 [2025-01-09 02:51:01,784 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 119 treesize of output 87 [2025-01-09 02:51:02,008 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 02:51:02,009 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 40 [2025-01-09 02:51:02,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2025-01-09 02:51:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:51:02,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:51:02,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:51:02,542 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 286 [2025-01-09 02:51:02,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:51:02,553 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 250 [2025-01-09 02:51:02,579 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_733 Int) (v_ArrVal_730 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse8 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_arrayElimArr_5)) (.cse6 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_arrayElimArr_4)) (.cse9 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| v_ArrVal_733)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (+ v_ArrVal_733 4)) (.cse0 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_ArrVal_730)) (.cse1 (select (select .cse6 .cse9) .cse10)) (.cse2 (select (select .cse8 .cse9) .cse10))) (or (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|) 0)) (not (= (select v_arrayElimArr_4 .cse3) (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (not (= (select v_arrayElimArr_5 .cse3) (select .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (= (let ((.cse7 (+ .cse2 4))) (select (select .cse0 (select (select .cse6 .cse1) .cse7)) (select (select .cse8 .cse1) .cse7))) |c_ULTIMATE.start_main_~data~0#1|)))))) is different from false [2025-01-09 02:51:02,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033168982] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:51:02,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:51:02,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 42 [2025-01-09 02:51:02,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893311531] [2025-01-09 02:51:02,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:51:02,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 02:51:02,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:51:02,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 02:51:02,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=2042, Unknown=3, NotChecked=90, Total=2256 [2025-01-09 02:51:02,583 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 42 states, 40 states have (on average 1.2) internal successors, (48), 33 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:51:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:51:04,002 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-01-09 02:51:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 02:51:04,003 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.2) internal successors, (48), 33 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2025-01-09 02:51:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:51:04,003 INFO L225 Difference]: With dead ends: 39 [2025-01-09 02:51:04,003 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 02:51:04,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=257, Invalid=3776, Unknown=3, NotChecked=124, Total=4160 [2025-01-09 02:51:04,005 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:51:04,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 297 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:51:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 02:51:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2025-01-09 02:51:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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:51:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-01-09 02:51:04,011 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 34 [2025-01-09 02:51:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:51:04,011 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-01-09 02:51:04,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.2) internal successors, (48), 33 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:51:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-01-09 02:51:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:51:04,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:51:04,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:51:04,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 02:51:04,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:51:04,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:51:04,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:51:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash -360425570, now seen corresponding path program 2 times [2025-01-09 02:51:04,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:51:04,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007936129] [2025-01-09 02:51:04,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:51:04,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:51:04,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 02:51:04,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:51:04,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:51:04,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 02:51:04,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:51:04,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007936129] [2025-01-09 02:51:04,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007936129] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:51:04,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058698407] [2025-01-09 02:51:04,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:51:04,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:51:04,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:51:04,333 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:51:04,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 02:51:04,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 02:51:04,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:51:04,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:51:04,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:04,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 02:51:04,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:51:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 02:51:04,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:51:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 02:51:04,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058698407] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:51:04,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:51:04,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-01-09 02:51:04,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638718572] [2025-01-09 02:51:04,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:51:04,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:51:04,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:51:04,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:51:04,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:51:04,600 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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:51:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:51:04,640 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2025-01-09 02:51:04,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:51:04,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 36 [2025-01-09 02:51:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:51:04,641 INFO L225 Difference]: With dead ends: 42 [2025-01-09 02:51:04,641 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 02:51:04,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:51:04,641 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:51:04,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:51:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 02:51:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-01-09 02:51:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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:51:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-01-09 02:51:04,651 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2025-01-09 02:51:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:51:04,652 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-01-09 02:51:04,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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:51:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-01-09 02:51:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:51:04,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:51:04,653 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:51:04,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 02:51:04,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 02:51:04,857 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:51:04,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:51:04,858 INFO L85 PathProgramCache]: Analyzing trace with hash -360432514, now seen corresponding path program 2 times [2025-01-09 02:51:04,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:51:04,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70137224] [2025-01-09 02:51:04,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:51:04,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:51:04,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 02:51:04,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:51:04,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:51:04,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:51:07,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:51:07,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70137224] [2025-01-09 02:51:07,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70137224] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:51:07,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341181926] [2025-01-09 02:51:07,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:51:07,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:51:07,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:51:07,211 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:51:07,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 02:51:07,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 02:51:07,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:51:07,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:51:07,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:07,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 150 conjuncts are in the unsatisfiable core [2025-01-09 02:51:07,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:51:07,451 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:51:07,517 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:51:07,521 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:51:07,710 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:51:07,711 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:51:07,720 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 16 treesize of output 11 [2025-01-09 02:51:07,733 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 16 treesize of output 11 [2025-01-09 02:51:07,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 02:51:07,819 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 22 [2025-01-09 02:51:08,021 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 02:51:08,021 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2025-01-09 02:51:08,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 02:51:08,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:51:08,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:51:08,282 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-01-09 02:51:08,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 68 treesize of output 51 [2025-01-09 02:51:08,309 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-01-09 02:51:08,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2025-01-09 02:51:08,342 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:51:08,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 02:51:08,464 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-09 02:51:08,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-01-09 02:51:08,480 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-01-09 02:51:08,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 86 treesize of output 63 [2025-01-09 02:51:08,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 69 [2025-01-09 02:51:08,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2025-01-09 02:51:08,604 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 116 treesize of output 80 [2025-01-09 02:51:09,007 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-01-09 02:51:09,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 46 [2025-01-09 02:51:09,019 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:51:09,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2025-01-09 02:51:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:51:09,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:51:09,463 INFO L349 Elim1Store]: treesize reduction 155, result has 36.0 percent of original size [2025-01-09 02:51:09,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 99 [2025-01-09 02:51:09,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:51:09,757 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 652 treesize of output 592 [2025-01-09 02:51:09,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:51:09,765 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 582 treesize of output 522 [2025-01-09 02:51:10,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341181926] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:51:10,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:51:10,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2025-01-09 02:51:10,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899970648] [2025-01-09 02:51:10,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:51:10,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 02:51:10,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:51:10,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 02:51:10,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2605, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 02:51:10,970 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 45 states, 43 states have (on average 1.255813953488372) internal successors, (54), 37 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:51:12,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:51:12,376 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2025-01-09 02:51:12,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 02:51:12,376 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.255813953488372) internal successors, (54), 37 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2025-01-09 02:51:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:51:12,377 INFO L225 Difference]: With dead ends: 59 [2025-01-09 02:51:12,377 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 02:51:12,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=229, Invalid=3803, Unknown=0, NotChecked=0, Total=4032 [2025-01-09 02:51:12,379 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 02:51:12,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 291 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 02:51:12,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 02:51:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-01-09 02:51:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:51:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-01-09 02:51:12,386 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 36 [2025-01-09 02:51:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:51:12,386 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-01-09 02:51:12,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.255813953488372) internal successors, (54), 37 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:51:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-01-09 02:51:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 02:51:12,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:51:12,387 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:51:12,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 02:51:12,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:51:12,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:51:12,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:51:12,589 INFO L85 PathProgramCache]: Analyzing trace with hash 928219206, now seen corresponding path program 3 times [2025-01-09 02:51:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:51:12,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206042658] [2025-01-09 02:51:12,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:51:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:51:12,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-01-09 02:51:12,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 02:51:12,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 02:51:12,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 02:51:12,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:51:12,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206042658] [2025-01-09 02:51:12,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206042658] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:51:12,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944124759] [2025-01-09 02:51:12,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:51:12,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:51:12,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:51:12,708 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:51:12,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 02:51:12,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-01-09 02:51:13,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 02:51:13,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 02:51:13,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:13,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 02:51:13,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:51:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 02:51:13,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:51:13,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944124759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:51:13,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:51:13,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-01-09 02:51:13,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566618995] [2025-01-09 02:51:13,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:51:13,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:51:13,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:51:13,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:51:13,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:51:13,335 INFO L87 Difference]: Start difference. First operand 37 states and 41 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:51:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:51:13,351 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2025-01-09 02:51:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:51:13,352 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 44 [2025-01-09 02:51:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:51:13,352 INFO L225 Difference]: With dead ends: 42 [2025-01-09 02:51:13,352 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 02:51:13,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:51:13,353 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:51:13,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:51:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 02:51:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 02:51:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:51:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 02:51:13,354 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2025-01-09 02:51:13,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:51:13,354 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 02:51:13,354 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:51:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 02:51:13,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 02:51:13,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 02:51:13,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 02:51:13,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:51:13,560 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1] [2025-01-09 02:51:13,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 02:51:14,239 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:51:14,251 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-01-09 02:51:14,252 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-01-09 02:51:14,252 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-01-09 02:51:14,252 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-01-09 02:51:14,253 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-01-09 02:51:14,253 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-01-09 02:51:14,253 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2025-01-09 02:51:14,253 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2025-01-09 02:51:14,253 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-01-09 02:51:14,253 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-09 02:51:14,253 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-09 02:51:14,253 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-01-09 02:51:14,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-01-09 02:51:14,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-01-09 02:51:14,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-01-09 02:51:14,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-01-09 02:51:14,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-01-09 02:51:14,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-01-09 02:51:14,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-01-09 02:51:14,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-01-09 02:51:14,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-01-09 02:51:14,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-01-09 02:51:14,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2025-01-09 02:51:14,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2025-01-09 02:51:14,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-01-09 02:51:14,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-09 02:51:14,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-09 02:51:14,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-01-09 02:51:14,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-01-09 02:51:14,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-09 02:51:14,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-09 02:51:14,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2025-01-09 02:51:14,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2025-01-09 02:51:14,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-01-09 02:51:14,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-01-09 02:51:14,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-01-09 02:51:14,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-01-09 02:51:14,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-01-09 02:51:14,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-01-09 02:51:14,263 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-09 02:51:14,263 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-09 02:51:14,263 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,263 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-09 02:51:14,263 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-09 02:51:14,263 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-01-09 02:51:14,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-01-09 02:51:14,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2025-01-09 02:51:14,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2025-01-09 02:51:14,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2025-01-09 02:51:14,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-01-09 02:51:14,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-01-09 02:51:14,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2025-01-09 02:51:14,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-01-09 02:51:14,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-01-09 02:51:14,264 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-01-09 02:51:14,265 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-01-09 02:51:14,267 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,267 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-01-09 02:51:14,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,269 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-01-09 02:51:14,269 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-01-09 02:51:14,269 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-01-09 02:51:14,269 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-01-09 02:51:14,269 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-01-09 02:51:14,269 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,269 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-01-09 02:51:14,269 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-01-09 02:51:14,269 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,269 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-01-09 02:51:14,269 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-01-09 02:51:14,269 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,272 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-09 02:51:14,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-09 02:51:14,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-09 02:51:14,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-09 02:51:14,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-01-09 02:51:14,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-01-09 02:51:14,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2025-01-09 02:51:14,274 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2025-01-09 02:51:14,274 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-01-09 02:51:14,274 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2025-01-09 02:51:14,274 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-01-09 02:51:14,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-01-09 02:51:14,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2025-01-09 02:51:14,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-01-09 02:51:14,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-01-09 02:51:14,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-01-09 02:51:14,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-01-09 02:51:14,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-01-09 02:51:14,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-01-09 02:51:14,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-09 02:51:14,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-09 02:51:14,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2025-01-09 02:51:14,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-01-09 02:51:14,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-01-09 02:51:14,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-01-09 02:51:14,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-01-09 02:51:14,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-01-09 02:51:14,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-01-09 02:51:14,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-01-09 02:51:14,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2025-01-09 02:51:14,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:51:14 BoogieIcfgContainer [2025-01-09 02:51:14,278 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:51:14,278 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:51:14,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:51:14,279 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:51:14,279 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:50:29" (3/4) ... [2025-01-09 02:51:14,281 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 02:51:14,287 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2025-01-09 02:51:14,290 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 02:51:14,290 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 02:51:14,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 02:51:14,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 02:51:14,380 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:51:14,381 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:51:14,381 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:51:14,382 INFO L158 Benchmark]: Toolchain (without parser) took 45312.46ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 121.9MB in the beginning and 204.7MB in the end (delta: -82.8MB). Peak memory consumption was 198.3MB. Max. memory is 16.1GB. [2025-01-09 02:51:14,382 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:51:14,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.89ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 104.1MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:51:14,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.39ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 102.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:51:14,383 INFO L158 Benchmark]: Boogie Preprocessor took 40.14ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 100.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:51:14,383 INFO L158 Benchmark]: RCFGBuilder took 361.69ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 85.0MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:51:14,383 INFO L158 Benchmark]: TraceAbstraction took 44346.08ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 84.4MB in the beginning and 213.1MB in the end (delta: -128.7MB). Peak memory consumption was 156.3MB. Max. memory is 16.1GB. [2025-01-09 02:51:14,383 INFO L158 Benchmark]: Witness Printer took 102.71ms. Allocated memory is still 453.0MB. Free memory was 213.1MB in the beginning and 204.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:51:14,384 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.87ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.89ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 104.1MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.39ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 102.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.14ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 100.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 361.69ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 85.0MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 44346.08ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 84.4MB in the beginning and 213.1MB in the end (delta: -128.7MB). Peak memory consumption was 156.3MB. Max. memory is 16.1GB. * Witness Printer took 102.71ms. Allocated memory is still 453.0MB. Free memory was 213.1MB in the beginning and 204.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 629]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.6s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 18.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 1680 SdHoareTripleChecker+Invalid, 17.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1502 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2863 IncrementalHoareTripleChecker+Invalid, 2883 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 178 mSDtfsCounter, 2863 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 574 GetRequests, 308 SyntacticMatches, 5 SemanticMatches, 261 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2014 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=9, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 584 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 653 ConstructedInterpolants, 37 QuantifiedInterpolants, 7266 SizeOfPredicates, 42 NumberOfNonLiveVariables, 2696 ConjunctsInSsa, 526 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 291/444 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((2 == len) && (data == 1)) && (len == 2)) && (data == 1)) || ((((len == 1) && (data == 1)) && (len == 2)) && (data == 1))) || ((((len <= 0) && (data == 1)) && (len == 2)) && (data == 1))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((data == 1) && (len == 2)) && (2 == count)) || (((count == 3) && (data == 1)) && (len == 2))) || (((count == 1) && (data == 1)) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2025-01-09 02:51:14,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE