./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:41:29,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:41:29,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:41:29,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:41:29,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:41:29,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:41:29,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:41:29,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:41:29,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:41:29,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:41:29,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:41:29,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:41:29,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:41:29,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:41:29,811 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:41:29,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:41:29,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:41:29,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:41:29,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:41:29,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:41:29,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:41:29,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:41:29,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:41:29,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:41:29,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:41:29,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:41:29,812 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:41:29,812 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:41:29,812 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:41:29,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:41:29,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:41:29,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:41:29,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:41:29,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:41:29,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:41:29,813 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:41:29,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:41:29,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:41:29,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:41:29,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:41:29,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:41:29,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:41:29,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:41:29,814 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2025-02-05 14:41:30,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:41:30,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:41:30,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:41:30,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:41:30,062 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:41:30,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2025-02-05 14:41:31,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0fc0d25a6/d07b4eef76ce4d258a521e76b9d7946e/FLAGa54960a38 [2025-02-05 14:41:31,576 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:41:31,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2025-02-05 14:41:31,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0fc0d25a6/d07b4eef76ce4d258a521e76b9d7946e/FLAGa54960a38 [2025-02-05 14:41:31,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0fc0d25a6/d07b4eef76ce4d258a521e76b9d7946e [2025-02-05 14:41:31,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:41:31,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:41:31,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:41:31,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:41:31,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:41:31,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328cec2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31, skipping insertion in model container [2025-02-05 14:41:31,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:41:31,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2025-02-05 14:41:31,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:41:31,833 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:41:31,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2025-02-05 14:41:31,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:41:31,874 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:41:31,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31 WrapperNode [2025-02-05 14:41:31,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:41:31,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:41:31,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:41:31,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:41:31,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,899 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 109 [2025-02-05 14:41:31,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:41:31,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:41:31,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:41:31,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:41:31,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,918 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 6 writes are split as follows [0, 1, 5]. [2025-02-05 14:41:31,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,923 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:41:31,927 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:41:31,927 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:41:31,927 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:41:31,932 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (1/1) ... [2025-02-05 14:41:31,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:41:31,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:31,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:41:31,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-05 14:41:31,987 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:41:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 14:41:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:41:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:41:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 14:41:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:41:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:41:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:41:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 14:41:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:41:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:41:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 14:41:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:41:31,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:41:32,078 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:41:32,080 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:41:32,222 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L618: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-05 14:41:32,233 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-05 14:41:32,244 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-02-05 14:41:32,244 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:41:32,250 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:41:32,250 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:41:32,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:41:32 BoogieIcfgContainer [2025-02-05 14:41:32,250 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:41:32,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:41:32,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:41:32,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:41:32,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:41:31" (1/3) ... [2025-02-05 14:41:32,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571f4be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:41:32, skipping insertion in model container [2025-02-05 14:41:32,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:31" (2/3) ... [2025-02-05 14:41:32,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571f4be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:41:32, skipping insertion in model container [2025-02-05 14:41:32,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:41:32" (3/3) ... [2025-02-05 14:41:32,256 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2025-02-05 14:41:32,267 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:41:32,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_equal.i that has 2 procedures, 28 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-05 14:41:32,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:41:32,320 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;@7f0e525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:41:32,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:41:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:41:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 14:41:32,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:32,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:32,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:32,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1397666006, now seen corresponding path program 1 times [2025-02-05 14:41:32,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:32,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501382220] [2025-02-05 14:41:32,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:32,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:32,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 14:41:32,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 14:41:32,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:32,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:41:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:32,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501382220] [2025-02-05 14:41:32,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501382220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:41:32,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:41:32,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:41:32,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745026659] [2025-02-05 14:41:32,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:41:32,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:41:32,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:32,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:41:32,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:41:32,650 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:41:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:32,699 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2025-02-05 14:41:32,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:41:32,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-02-05 14:41:32,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:32,706 INFO L225 Difference]: With dead ends: 54 [2025-02-05 14:41:32,706 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 14:41:32,708 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-02-05 14:41:32,710 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:32,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:41:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 14:41:32,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-02-05 14:41:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:41:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-02-05 14:41:32,739 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2025-02-05 14:41:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:32,739 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-02-05 14:41:32,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:41:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-02-05 14:41:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:41:32,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:32,742 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:32,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:41:32,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:32,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1028394028, now seen corresponding path program 1 times [2025-02-05 14:41:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:32,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008754248] [2025-02-05 14:41:32,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:32,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:41:32,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:41:32,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:32,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:41:32,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:32,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008754248] [2025-02-05 14:41:32,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008754248] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:32,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030830800] [2025-02-05 14:41:32,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:32,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:32,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:32,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:41:32,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:41:33,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:41:33,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:41:33,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:33,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:33,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 14:41:33,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:41:33,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:41:33,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030830800] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:41:33,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:41:33,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-05 14:41:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613383669] [2025-02-05 14:41:33,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:33,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:41:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:33,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:41:33,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:41:33,179 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 14:41:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:33,197 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2025-02-05 14:41:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:41:33,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-02-05 14:41:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:33,198 INFO L225 Difference]: With dead ends: 43 [2025-02-05 14:41:33,198 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 14:41:33,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:41:33,198 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:33,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:41:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 14:41:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-05 14:41:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:41:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-02-05 14:41:33,203 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 26 [2025-02-05 14:41:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:33,204 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-02-05 14:41:33,204 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-02-05 14:41:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-02-05 14:41:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 14:41:33,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:33,204 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-02-05 14:41:33,215 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-02-05 14:41:33,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:33,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:33,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:33,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1113761582, now seen corresponding path program 2 times [2025-02-05 14:41:33,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:33,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980719549] [2025-02-05 14:41:33,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:41:33,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:33,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-05 14:41:33,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 34 statements. [2025-02-05 14:41:33,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 14:41:33,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 14:41:33,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:33,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980719549] [2025-02-05 14:41:33,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980719549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:41:33,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:41:33,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:41:33,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865842901] [2025-02-05 14:41:33,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:41:33,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:41:33,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:33,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:41:33,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:41:33,500 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 14:41:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:33,513 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2025-02-05 14:41:33,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:41:33,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-02-05 14:41:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:33,515 INFO L225 Difference]: With dead ends: 35 [2025-02-05 14:41:33,515 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 14:41:33,516 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-02-05 14:41:33,517 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:33,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:41:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 14:41:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-05 14:41:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:41:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-02-05 14:41:33,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 34 [2025-02-05 14:41:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:33,524 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-02-05 14:41:33,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 14:41:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-02-05 14:41:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 14:41:33,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:33,526 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-02-05 14:41:33,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:41:33,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:33,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:33,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1142390733, now seen corresponding path program 1 times [2025-02-05 14:41:33,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:33,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159091853] [2025-02-05 14:41:33,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:33,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:33,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:41:33,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:41:33,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:33,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 14:41:34,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:34,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159091853] [2025-02-05 14:41:34,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159091853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:41:34,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:41:34,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 14:41:34,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908555980] [2025-02-05 14:41:34,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:41:34,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 14:41:34,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:34,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 14:41:34,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-05 14:41:34,247 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:41:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:34,388 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-02-05 14:41:34,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 14:41:34,388 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-02-05 14:41:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:34,389 INFO L225 Difference]: With dead ends: 39 [2025-02-05 14:41:34,389 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 14:41:34,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-02-05 14:41:34,390 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:34,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 116 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:41:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 14:41:34,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-02-05 14:41:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:41:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-02-05 14:41:34,393 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 34 [2025-02-05 14:41:34,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:34,393 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-02-05 14:41:34,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:41:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-02-05 14:41:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 14:41:34,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:34,394 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-02-05 14:41:34,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:41:34,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:34,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1142391539, now seen corresponding path program 1 times [2025-02-05 14:41:34,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:34,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141797388] [2025-02-05 14:41:34,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:34,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:34,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:41:34,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:41:34,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:34,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 14:41:34,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:34,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141797388] [2025-02-05 14:41:34,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141797388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:41:34,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:41:34,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:41:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478275713] [2025-02-05 14:41:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:41:34,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:41:34,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:34,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:41:34,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:41:34,531 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-02-05 14:41:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:34,544 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2025-02-05 14:41:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:41:34,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-02-05 14:41:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:34,545 INFO L225 Difference]: With dead ends: 43 [2025-02-05 14:41:34,545 INFO L226 Difference]: Without dead ends: 33 [2025-02-05 14:41:34,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:41:34,546 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:34,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:41:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-05 14:41:34,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-02-05 14:41:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-02-05 14:41:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-02-05 14:41:34,550 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 34 [2025-02-05 14:41:34,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:34,550 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-02-05 14:41:34,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-02-05 14:41:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-02-05 14:41:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 14:41:34,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:34,551 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:34,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 14:41:34,551 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:34,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1116186895, now seen corresponding path program 1 times [2025-02-05 14:41:34,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:34,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570527702] [2025-02-05 14:41:34,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:34,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:34,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:41:34,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:41:34,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:34,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:41:35,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:35,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570527702] [2025-02-05 14:41:35,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570527702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:35,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315878282] [2025-02-05 14:41:35,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:35,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:35,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:35,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:41:35,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:41:35,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:41:35,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:41:35,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:35,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:35,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-02-05 14:41:35,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:35,754 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-02-05 14:41:35,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:41:35,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 14:41:35,941 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-02-05 14:41:35,944 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-02-05 14:41:36,227 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 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-05 14:41:36,378 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-05 14:41:36,378 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-02-05 14:41:36,398 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-05 14:41:36,398 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-02-05 14:41:36,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-05 14:41:36,666 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 0 case distinctions, treesize of input 27 treesize of output 20 [2025-02-05 14:41:36,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 14:41:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:41:36,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:36,806 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_433) (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|)))) is different from false [2025-02-05 14:41:40,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:41:40,210 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 38 treesize of output 42 [2025-02-05 14:41:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315878282] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:40,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:41:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2025-02-05 14:41:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454834690] [2025-02-05 14:41:40,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:40,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 14:41:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:40,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 14:41:40,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1257, Unknown=36, NotChecked=72, Total=1482 [2025-02-05 14:41:40,281 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 34 states, 32 states have (on average 1.4375) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-05 14:41:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:41,008 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-02-05 14:41:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 14:41:41,009 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.4375) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-02-05 14:41:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:41,009 INFO L225 Difference]: With dead ends: 49 [2025-02-05 14:41:41,009 INFO L226 Difference]: Without dead ends: 47 [2025-02-05 14:41:41,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=187, Invalid=2133, Unknown=36, NotChecked=94, Total=2450 [2025-02-05 14:41:41,011 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:41,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 249 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 14:41:41,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-05 14:41:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2025-02-05 14:41:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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-02-05 14:41:41,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-02-05 14:41:41,016 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 35 [2025-02-05 14:41:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:41,016 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-02-05 14:41:41,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.4375) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-05 14:41:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-02-05 14:41:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 14:41:41,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:41,016 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:41,032 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-02-05 14:41:41,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:41,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:41,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:41,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1116187701, now seen corresponding path program 1 times [2025-02-05 14:41:41,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:41,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680160755] [2025-02-05 14:41:41,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:41,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:41,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:41:41,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:41:41,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:41,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 14:41:41,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:41,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680160755] [2025-02-05 14:41:41,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680160755] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:41,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99636652] [2025-02-05 14:41:41,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:41,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:41,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:41,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:41:41,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 14:41:41,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:41:41,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:41:41,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:41,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:41,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 14:41:41,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:41,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-05 14:41:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:41:41,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 14:41:41,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99636652] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:41:41,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:41:41,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 10 [2025-02-05 14:41:41,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224324812] [2025-02-05 14:41:41,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:41,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 14:41:41,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:41,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 14:41:41,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 14:41:41,556 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 14:41:45,574 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-02-05 14:41:49,582 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-02-05 14:41:53,599 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-02-05 14:41:57,650 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-02-05 14:41:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:57,671 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-02-05 14:41:57,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 14:41:57,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-02-05 14:41:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:57,673 INFO L225 Difference]: With dead ends: 51 [2025-02-05 14:41:57,673 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 14:41:57,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-05 14:41:57,673 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:57,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 179 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-02-05 14:41:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 14:41:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2025-02-05 14:41:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 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-02-05 14:41:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-02-05 14:41:57,678 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 35 [2025-02-05 14:41:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:57,678 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-02-05 14:41:57,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 14:41:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-02-05 14:41:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 14:41:57,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:57,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:57,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 14:41:57,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:57,883 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:57,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:57,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1144816852, now seen corresponding path program 1 times [2025-02-05 14:41:57,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:57,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563703359] [2025-02-05 14:41:57,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:57,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:57,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:41:57,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:41:57,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:57,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:41:58,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563703359] [2025-02-05 14:41:58,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563703359] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733430839] [2025-02-05 14:41:58,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:58,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:58,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:58,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:41:58,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 14:41:58,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:41:58,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:41:58,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:58,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:58,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 14:41:58,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:58,547 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-02-05 14:41:58,547 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 31 treesize of output 19 [2025-02-05 14:41:58,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-05 14:41:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:41:58,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:58,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733430839] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:58,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:41:58,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 25 [2025-02-05 14:41:58,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265346838] [2025-02-05 14:41:58,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:58,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 14:41:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:58,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 14:41:58,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2025-02-05 14:41:58,715 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 21 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 14:42:02,747 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-02-05 14:42:06,784 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-02-05 14:42:10,837 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-02-05 14:42:14,888 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-02-05 14:42:19,264 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-02-05 14:42:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:42:19,308 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-02-05 14:42:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 14:42:19,309 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 21 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2025-02-05 14:42:19,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:42:19,309 INFO L225 Difference]: With dead ends: 57 [2025-02-05 14:42:19,309 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 14:42:19,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=1569, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 14:42:19,311 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:42:19,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 363 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 408 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2025-02-05 14:42:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 14:42:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2025-02-05 14:42:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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-02-05 14:42:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2025-02-05 14:42:19,316 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 35 [2025-02-05 14:42:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:42:19,316 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-02-05 14:42:19,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 21 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 14:42:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2025-02-05 14:42:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 14:42:19,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:19,317 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:19,324 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-02-05 14:42:19,521 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,SelfDestructingSolverStorable7 [2025-02-05 14:42:19,521 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:19,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:19,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1191371598, now seen corresponding path program 2 times [2025-02-05 14:42:19,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:19,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583849738] [2025-02-05 14:42:19,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:42:19,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:19,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-05 14:42:19,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 14:42:19,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:42:19,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 14:42:19,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:19,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583849738] [2025-02-05 14:42:19,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583849738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:42:19,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:42:19,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:42:19,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101841691] [2025-02-05 14:42:19,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:42:19,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:42:19,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:42:19,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:42:19,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:42:19,626 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:42:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:42:19,652 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2025-02-05 14:42:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:42:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-02-05 14:42:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:42:19,653 INFO L225 Difference]: With dead ends: 50 [2025-02-05 14:42:19,653 INFO L226 Difference]: Without dead ends: 36 [2025-02-05 14:42:19,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:42:19,655 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 50 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-02-05 14:42:19,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 50 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:42:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-05 14:42:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-02-05 14:42:19,660 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-02-05 14:42:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-02-05 14:42:19,661 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2025-02-05 14:42:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:42:19,661 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-02-05 14:42:19,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:42:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-02-05 14:42:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 14:42:19,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:19,663 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:19,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 14:42:19,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:19,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1086143408, now seen corresponding path program 1 times [2025-02-05 14:42:19,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:19,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163515269] [2025-02-05 14:42:19,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:19,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:42:19,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:42:19,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:19,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:42:21,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:21,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163515269] [2025-02-05 14:42:21,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163515269] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:21,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398822507] [2025-02-05 14:42:21,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:21,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:21,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:42:21,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:42:21,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 14:42:21,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:42:22,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:42:22,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:22,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:22,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-02-05 14:42:22,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:42:22,309 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-02-05 14:42:22,671 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-02-05 14:42:22,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:42:22,877 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-05 14:42:22,878 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-02-05 14:42:23,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 14:42:23,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-05 14:42:23,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 14:42:23,322 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-02-05 14:42:23,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2025-02-05 14:42:23,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-05 14:42:23,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2025-02-05 14:42:23,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2025-02-05 14:42:23,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-05 14:42:23,528 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-02-05 14:42:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:42:23,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:42:23,779 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_881 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (or (not (= v_ArrVal_881 (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_881 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_882) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_883) .cse1) .cse2)))))) is different from false [2025-02-05 14:42:23,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:42:23,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 68 [2025-02-05 14:42:23,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:42:23,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 129 [2025-02-05 14:42:23,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:42:23,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 96 [2025-02-05 14:42:23,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:42:23,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 161 [2025-02-05 14:42:23,841 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 37 treesize of output 29 [2025-02-05 14:42:23,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-02-05 14:42:24,248 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse8 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse17))) (let ((.cse10 (not .cse8)) (.cse12 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_881 (Array Int Int)) (v_arrayElimCell_31 Int)) (or (not (= v_ArrVal_881 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_881 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) v_arrayElimCell_30) v_arrayElimCell_31)))))) (let ((.cse4 (or .cse10 .cse12)) (.cse0 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_881 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_878))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_30) v_arrayElimCell_31))) (not (= v_ArrVal_881 (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_881 .cse7)))) (= (select (select .cse20 v_arrayElimCell_27) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse1 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_27 Int) (v_ArrVal_881 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_878))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_30) v_arrayElimCell_31))) (not (= v_ArrVal_881 (store (select .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_881 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_27) v_arrayElimCell_29))))))) (.cse5 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse17)) (.cse2 (or .cse8 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_881 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_878))) (or (not (= v_ArrVal_881 (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_881 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) v_arrayElimCell_27) v_arrayElimCell_29))))))) (.cse3 (or .cse8 (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_881 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_878))) (or (not (= v_ArrVal_881 (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_881 .cse7)))) (= (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) v_arrayElimCell_27) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse9 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_881 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_878))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) v_arrayElimCell_30) v_arrayElimCell_31))) (not (= v_ArrVal_881 (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_881 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_881 v_arrayElimCell_29)))))) (.cse13 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~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|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_881 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_878))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) v_arrayElimCell_30) v_arrayElimCell_31))) (not (= v_ArrVal_881 (store (select .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_881 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_881 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))) (or .cse8 (forall ((v_ArrVal_878 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (or (and .cse9 (or (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 v_DerPreprocessor_3) v_arrayElimCell_29))) .cse8) .cse4) .cse5) (or .cse10 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_881 (Array Int Int)) (v_arrayElimCell_31 Int)) (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_878))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) v_arrayElimCell_30) v_arrayElimCell_31)) (not (= v_ArrVal_881 (store (select .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_881 .cse7)))))))) (or (and .cse0 .cse1 (or .cse10 .cse12 .cse5) .cse2 .cse3) .cse13) (or (and (or (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 v_DerPreprocessor_2) v_arrayElimCell_29))) .cse8) .cse9) .cse13)))))) is different from false [2025-02-05 14:42:24,586 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse8 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse14))) (let ((.cse3 (not .cse8)) (.cse4 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_881 (Array Int Int)) (v_arrayElimCell_31 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) v_arrayElimCell_30) v_arrayElimCell_31)) (not (= v_ArrVal_881 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_881 .cse10)))))))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_insert_~last~0#1.offset|)) (.cse9 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_881 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_878))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) v_arrayElimCell_30) v_arrayElimCell_31))) (not (= v_ArrVal_881 (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_881 .cse10)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_881 v_arrayElimCell_29)))))) (.cse1 (or (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_881 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_878))) (or (not (= v_ArrVal_881 (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_881 .cse10)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) v_arrayElimCell_27) v_arrayElimCell_29))))) .cse8)) (.cse11 (or .cse3 .cse4)) (.cse2 (or .cse8 (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_881 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_878))) (or (not (= v_ArrVal_881 (store (select .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_881 .cse10)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) v_arrayElimCell_27) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))))) (.cse6 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_27 Int) (v_ArrVal_881 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_878))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_30) v_arrayElimCell_31))) (not (= v_ArrVal_881 (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_881 .cse10)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_27) v_arrayElimCell_29))))))) (.cse7 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_881 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_878))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_30) v_arrayElimCell_31))) (not (= v_ArrVal_881 (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_881 .cse10)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_27) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))))) (.cse5 (= .cse14 |c_ULTIMATE.start_sll_insert_~last~0#1.base|))) (and (or .cse0 (and .cse1 .cse2 (or .cse3 .cse4 .cse5) .cse6 .cse7)) (or .cse8 (forall ((v_ArrVal_878 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (or .cse0 (and .cse9 (or .cse8 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_2) v_arrayElimCell_29)))))) (or (and (or .cse8 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) v_arrayElimCell_29)))) .cse11 .cse9) .cse5) (or (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_881 (Array Int Int)) (v_arrayElimCell_31 Int)) (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_878))) (or (not (= v_ArrVal_881 (store (select .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_881 .cse10)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) v_arrayElimCell_30) v_arrayElimCell_31))))) .cse3) (or (and .cse1 .cse11 .cse2 .cse6 .cse7) .cse5) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_881 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_878))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_881) v_arrayElimCell_30) v_arrayElimCell_31))) (not (= v_ArrVal_881 (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_881 .cse10)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_881 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))))))))) is different from false [2025-02-05 14:42:24,848 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse16))) (let ((.cse10 (not .cse2)) (.cse12 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_881 (Array Int Int)) (v_arrayElimCell_31 Int)) (or (not (= v_ArrVal_881 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_881 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_878) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_881) v_arrayElimCell_30) v_arrayElimCell_31)))))) (let ((.cse4 (or .cse10 .cse12)) (.cse6 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_27 Int) (v_ArrVal_881 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#2| .cse0 v_ArrVal_878))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_881))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 v_arrayElimCell_27) v_arrayElimCell_29)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 v_arrayElimCell_30) v_arrayElimCell_31))) (not (= v_ArrVal_881 (store (select .cse22 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_881 .cse1))))))))) (.cse7 (or (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_881 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse20 (store |c_#memory_int#2| .cse0 v_ArrVal_878))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_881) v_arrayElimCell_27) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (not (= v_ArrVal_881 (store (select .cse20 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_881 .cse1))))))) .cse2)) (.cse8 (or (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_881 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse19 (store |c_#memory_int#2| .cse0 v_ArrVal_878))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse19 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_881) v_arrayElimCell_27) v_arrayElimCell_29)) (not (= v_ArrVal_881 (store (select .cse19 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_881 .cse1))))))) .cse2)) (.cse9 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_881 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#2| .cse0 v_ArrVal_878))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_881))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_30) v_arrayElimCell_31))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_27) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (not (= v_ArrVal_881 (store (select .cse18 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_881 .cse1))))))))) (.cse5 (= .cse16 .cse0)) (.cse3 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_881 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#2| .cse0 v_ArrVal_878))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_881) v_arrayElimCell_30) v_arrayElimCell_31))) (not (= v_ArrVal_881 (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_881 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_881 v_arrayElimCell_29)))))) (.cse13 (= (select (select |c_#memory_$Pointer$#1.offset| |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_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)))) (and (or (and (or (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| .cse0 v_ArrVal_878) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 v_DerPreprocessor_3) v_arrayElimCell_29))) .cse2) .cse3 .cse4) .cse5) (or .cse5 (and .cse6 .cse7 .cse4 .cse8 .cse9)) (or .cse10 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_881 (Array Int Int)) (v_arrayElimCell_31 Int)) (let ((.cse11 (store |c_#memory_int#2| .cse0 v_ArrVal_878))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_881) v_arrayElimCell_30) v_arrayElimCell_31)) (not (= v_ArrVal_881 (store (select .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_881 .cse1)))))))) (or .cse2 (forall ((v_ArrVal_878 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| .cse0 v_ArrVal_878) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))) (or (and .cse6 .cse7 .cse8 .cse9 (or .cse10 .cse12 .cse5)) .cse13) (or (and .cse3 (or .cse2 (forall ((v_ArrVal_878 (Array Int Int)) (v_arrayElimCell_29 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| .cse0 v_ArrVal_878) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 v_DerPreprocessor_2) v_arrayElimCell_29))))) .cse13) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_881 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| .cse0 v_ArrVal_878))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_881) v_arrayElimCell_30) v_arrayElimCell_31))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_881 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (not (= v_ArrVal_881 (store (select .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_881 .cse1)))))))))))) is different from false [2025-02-05 14:42:27,221 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2025-02-05 14:42:27,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 2327 treesize of output 2520 [2025-02-05 14:42:27,487 INFO L224 Elim1Store]: Index analysis took 123 ms [2025-02-05 14:42:29,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:42:29,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 2127 treesize of output 3577 [2025-02-05 14:42:30,752 INFO L349 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2025-02-05 14:42:30,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1918 treesize of output 1948 [2025-02-05 14:42:31,290 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-02-05 14:42:31,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1909 treesize of output 1922 [2025-02-05 14:42:31,780 INFO L349 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2025-02-05 14:42:31,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1902 treesize of output 1919 [2025-02-05 14:42:32,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:42:32,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1895 treesize of output 1903 [2025-02-05 14:42:33,610 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 1890 treesize of output 1888 [2025-02-05 14:42:34,098 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-02-05 14:42:34,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1888 treesize of output 1901 [2025-02-05 14:42:34,565 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 1891 treesize of output 1889 [2025-02-05 14:42:35,079 INFO L349 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2025-02-05 14:42:35,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1889 treesize of output 1919 [2025-02-05 14:42:35,655 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 1880 treesize of output 1878 [2025-02-05 14:42:36,123 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 1878 treesize of output 1876 [2025-02-05 14:42:36,625 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-02-05 14:42:36,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1876 treesize of output 1889 [2025-02-05 14:42:37,163 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-02-05 14:42:37,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1869 treesize of output 1882 [2025-02-05 14:42:37,726 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-02-05 14:42:37,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1862 treesize of output 1875 [2025-02-05 14:42:38,406 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-02-05 14:42:38,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1855 treesize of output 1868 [2025-02-05 14:42:38,910 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 1858 treesize of output 1856 [2025-02-05 14:42:39,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:42:39,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1856 treesize of output 1864 [2025-02-05 14:42:40,576 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 1851 treesize of output 1849 [2025-02-05 14:42:41,170 INFO L349 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2025-02-05 14:42:41,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1849 treesize of output 1866