./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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/dll2c_insert_unequal.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8'] 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/dll2c_insert_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:27:21,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:27:21,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:27:21,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:27:21,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:27:21,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:27:21,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:27:21,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:27:21,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:27:21,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:27:21,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:27:21,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:27:21,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:27:21,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:27:21,992 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:27:21,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:27:21,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:27:21,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:27:21,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:27:21,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:27:21,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:27:21,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:27:21,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:27:21,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:27:21,993 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:27:21,993 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:27:21,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:27:21,994 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:27:21,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:27:21,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:27:21,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:27:21,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:27:21,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:27:21,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:27:21,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:27:21,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:27:21,995 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:27:21,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:27:21,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:27:21,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:27:21,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:27:21,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:27:21,996 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2024-11-06 22:27:22,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:27:22,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:27:22,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:27:22,284 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:27:22,284 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:27:22,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-06 22:27:23,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:27:23,809 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:27:23,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-06 22:27:23,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0d646dc8/15fe752d5c214574ab687a8ac1c4756d/FLAGdd75feb86 [2024-11-06 22:27:24,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0d646dc8/15fe752d5c214574ab687a8ac1c4756d [2024-11-06 22:27:24,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:27:24,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:27:24,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:27:24,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:27:24,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:27:24,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14452f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24, skipping insertion in model container [2024-11-06 22:27:24,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:27:24,527 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/dll2c_insert_unequal.i[25148,25161] [2024-11-06 22:27:24,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:27:24,544 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:27:24,601 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/dll2c_insert_unequal.i[25148,25161] [2024-11-06 22:27:24,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:27:24,635 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:27:24,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24 WrapperNode [2024-11-06 22:27:24,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:27:24,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:27:24,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:27:24,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:27:24,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,692 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 187 [2024-11-06 22:27:24,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:27:24,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:27:24,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:27:24,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:27:24,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,739 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2024-11-06 22:27:24,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:27:24,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:27:24,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:27:24,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:27:24,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2024-11-06 22:27:24,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:27:24,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:27:24,791 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) [2024-11-06 22:27:24,794 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 [2024-11-06 22:27:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 22:27:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 22:27:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-06 22:27:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 22:27:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 22:27:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-06 22:27:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-06 22:27:24,814 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-06 22:27:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 22:27:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:27:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 22:27:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 22:27:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 22:27:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 22:27:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 22:27:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 22:27:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 22:27:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 22:27:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-06 22:27:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-06 22:27:24,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-06 22:27:24,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:27:24,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 22:27:24,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-06 22:27:24,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:27:24,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:27:24,932 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:27:24,934 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:27:25,234 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-06 22:27:25,235 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:27:25,243 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:27:25,243 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-06 22:27:25,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:25 BoogieIcfgContainer [2024-11-06 22:27:25,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:27:25,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:27:25,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:27:25,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:27:25,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:27:24" (1/3) ... [2024-11-06 22:27:25,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1fc791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:25, skipping insertion in model container [2024-11-06 22:27:25,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (2/3) ... [2024-11-06 22:27:25,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1fc791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:25, skipping insertion in model container [2024-11-06 22:27:25,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:25" (3/3) ... [2024-11-06 22:27:25,252 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-11-06 22:27:25,282 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:27:25,283 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:27:25,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:27:25,332 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;@5cae156d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:27:25,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:27:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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) [2024-11-06 22:27:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:27:25,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:27:25,346 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:27:25,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:27:25,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:27:25,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2024-11-06 22:27:25,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:27:25,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96153904] [2024-11-06 22:27:25,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:25,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:27:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:25,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:27:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:25,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 22:27:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 22:27:25,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:27:25,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96153904] [2024-11-06 22:27:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96153904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:27:25,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:27:25,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:27:25,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505734831] [2024-11-06 22:27:25,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:27:25,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:27:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:27:25,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:27:25,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:27:25,734 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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) [2024-11-06 22:27:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:27:25,829 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2024-11-06 22:27:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:27:25,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 25 [2024-11-06 22:27:25,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:27:25,838 INFO L225 Difference]: With dead ends: 79 [2024-11-06 22:27:25,838 INFO L226 Difference]: Without dead ends: 36 [2024-11-06 22:27:25,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:27:25,844 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:27:25,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:27:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-06 22:27:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-06 22:27:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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) [2024-11-06 22:27:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2024-11-06 22:27:25,878 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2024-11-06 22:27:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:27:25,880 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2024-11-06 22:27:25,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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) [2024-11-06 22:27:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2024-11-06 22:27:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:27:25,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:27:25,882 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:27:25,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:27:25,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:27:25,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:27:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2024-11-06 22:27:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:27:25,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918999437] [2024-11-06 22:27:25,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:25,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:27:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:27:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:26,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 22:27:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 22:27:26,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:27:26,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918999437] [2024-11-06 22:27:26,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918999437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:27:26,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:27:26,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:27:26,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013770894] [2024-11-06 22:27:26,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:27:26,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:27:26,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:27:26,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:27:26,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:27:26,187 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-11-06 22:27:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:27:26,265 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2024-11-06 22:27:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:27:26,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 25 [2024-11-06 22:27:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:27:26,268 INFO L225 Difference]: With dead ends: 68 [2024-11-06 22:27:26,268 INFO L226 Difference]: Without dead ends: 41 [2024-11-06 22:27:26,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:27:26,269 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:27:26,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 108 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:27:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-06 22:27:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-06 22:27:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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) [2024-11-06 22:27:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-06 22:27:26,275 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2024-11-06 22:27:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:27:26,276 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-06 22:27:26,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-11-06 22:27:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-06 22:27:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-06 22:27:26,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:27:26,277 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:27:26,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:27:26,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:27:26,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:27:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2024-11-06 22:27:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:27:26,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648813117] [2024-11-06 22:27:26,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:26,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:27:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:26,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:27:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:27:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:26,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 22:27:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:27:26,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:27:26,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648813117] [2024-11-06 22:27:26,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648813117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:27:26,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:27:26,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:27:26,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557884688] [2024-11-06 22:27:26,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:27:26,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:27:26,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:27:26,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:27:26,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:27:26,504 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 22:27:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:27:26,573 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-11-06 22:27:26,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:27:26,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-06 22:27:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:27:26,576 INFO L225 Difference]: With dead ends: 53 [2024-11-06 22:27:26,576 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:27:26,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:27:26,577 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:27:26,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:27:26,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:27:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 22:27:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 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) [2024-11-06 22:27:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-06 22:27:26,585 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 35 [2024-11-06 22:27:26,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:27:26,585 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-06 22:27:26,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 22:27:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-06 22:27:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-06 22:27:26,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:27:26,586 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:27:26,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 22:27:26,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:27:26,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:27:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2024-11-06 22:27:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:27:26,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596794057] [2024-11-06 22:27:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:26,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:27:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:29,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:27:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:29,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:27:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 22:27:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 22:27:29,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:27:29,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596794057] [2024-11-06 22:27:29,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596794057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:27:29,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542483865] [2024-11-06 22:27:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:29,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:27:29,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:27:29,518 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) [2024-11-06 22:27:29,527 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 [2024-11-06 22:27:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:30,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-06 22:27:30,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:27:30,169 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 [2024-11-06 22:27:30,421 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 [2024-11-06 22:27:30,527 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:27:30,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-06 22:27:30,635 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 23 treesize of output 11 [2024-11-06 22:27:30,644 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 11 treesize of output 7 [2024-11-06 22:27:30,767 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-06 22:27:30,767 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 57 treesize of output 50 [2024-11-06 22:27:30,783 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 [2024-11-06 22:27:31,007 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-06 22:27:31,008 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 48 [2024-11-06 22:27:31,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:27:31,020 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 30 treesize of output 27 [2024-11-06 22:27:31,025 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-06 22:27:31,289 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-06 22:27:31,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 24 [2024-11-06 22:27:31,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-06 22:27:31,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-06 22:27:31,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:27:31,589 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-06 22:27:31,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 46 [2024-11-06 22:27:31,628 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-06 22:27:31,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-06 22:27:31,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-06 22:27:31,889 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-06 22:27:31,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2024-11-06 22:27:32,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 26 [2024-11-06 22:27:32,047 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-06 22:27:32,137 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 [2024-11-06 22:27:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:27:32,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:27:32,310 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_606) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_607) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_608 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_608 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false [2024-11-06 22:27:32,340 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (or (not (= v_ArrVal_608 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_608 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_608) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_606) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_607) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-06 22:27:32,369 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_608) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_606) (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) v_ArrVal_607) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_608 (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_608 .cse1))))))) is different from false [2024-11-06 22:27:32,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542483865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:27:32,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:27:32,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 45 [2024-11-06 22:27:32,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273355395] [2024-11-06 22:27:32,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:27:32,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-06 22:27:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:27:32,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-06 22:27:32,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2016, Unknown=3, NotChecked=276, Total=2450 [2024-11-06 22:27:32,559 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 36 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-06 22:27:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:27:34,576 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2024-11-06 22:27:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-06 22:27:34,578 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 36 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2024-11-06 22:27:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:27:34,579 INFO L225 Difference]: With dead ends: 83 [2024-11-06 22:27:34,579 INFO L226 Difference]: Without dead ends: 81 [2024-11-06 22:27:34,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=293, Invalid=3748, Unknown=3, NotChecked=378, Total=4422 [2024-11-06 22:27:34,584 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 104 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:27:34,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 434 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 22:27:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-06 22:27:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2024-11-06 22:27:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:27:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-11-06 22:27:34,602 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 36 [2024-11-06 22:27:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:27:34,602 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-11-06 22:27:34,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 36 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-06 22:27:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-11-06 22:27:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 22:27:34,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:27:34,605 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:27:34,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 22:27:34,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:27:34,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:27:34,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:27:34,807 INFO L85 PathProgramCache]: Analyzing trace with hash -220702884, now seen corresponding path program 1 times [2024-11-06 22:27:34,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:27:34,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675892956] [2024-11-06 22:27:34,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:27:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:34,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:27:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:34,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:27:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:34,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 22:27:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:27:35,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:27:35,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675892956] [2024-11-06 22:27:35,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675892956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:27:35,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:27:35,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:27:35,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906572739] [2024-11-06 22:27:35,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:27:35,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:27:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:27:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:27:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:27:35,012 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 22:27:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:27:35,082 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2024-11-06 22:27:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:27:35,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-06 22:27:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:27:35,084 INFO L225 Difference]: With dead ends: 77 [2024-11-06 22:27:35,084 INFO L226 Difference]: Without dead ends: 60 [2024-11-06 22:27:35,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:27:35,085 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:27:35,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 115 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:27:35,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-06 22:27:35,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-06 22:27:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:27:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2024-11-06 22:27:35,099 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 37 [2024-11-06 22:27:35,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:27:35,100 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2024-11-06 22:27:35,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 22:27:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2024-11-06 22:27:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 22:27:35,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:27:35,103 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:27:35,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 22:27:35,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:27:35,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:27:35,104 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2024-11-06 22:27:35,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:27:35,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103218892] [2024-11-06 22:27:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:35,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:27:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:35,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:27:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:35,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:27:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:35,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 22:27:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 22:27:35,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:27:35,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103218892] [2024-11-06 22:27:35,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103218892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:27:35,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124908315] [2024-11-06 22:27:35,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:27:35,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:27:35,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:27:35,380 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) [2024-11-06 22:27:35,382 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 [2024-11-06 22:27:35,609 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:27:35,609 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:27:35,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 22:27:35,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:27:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:27:35,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:27:35,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124908315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:27:35,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 22:27:35,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-06 22:27:35,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693257253] [2024-11-06 22:27:35,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:27:35,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:27:35,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:27:35,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:27:35,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:27:35,646 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 22:27:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:27:35,680 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2024-11-06 22:27:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:27:35,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-06 22:27:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:27:35,682 INFO L225 Difference]: With dead ends: 78 [2024-11-06 22:27:35,683 INFO L226 Difference]: Without dead ends: 60 [2024-11-06 22:27:35,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-06 22:27:35,684 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 93 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 [2024-11-06 22:27:35,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 93 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:27:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-06 22:27:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-06 22:27:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:27:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-11-06 22:27:35,698 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 37 [2024-11-06 22:27:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:27:35,699 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-11-06 22:27:35,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 22:27:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-11-06 22:27:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-06 22:27:35,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:27:35,700 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:27:35,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 22:27:35,900 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 [2024-11-06 22:27:35,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:27:35,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:27:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2024-11-06 22:27:35,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:27:35,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277424095] [2024-11-06 22:27:35,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:35,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:27:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:27:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:27:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:36,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 22:27:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:27:36,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:27:36,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277424095] [2024-11-06 22:27:36,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277424095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:27:36,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495479207] [2024-11-06 22:27:36,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:36,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:27:36,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:27:36,059 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) [2024-11-06 22:27:36,060 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 [2024-11-06 22:27:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:36,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-06 22:27:36,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:27:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:27:36,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:27:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:27:36,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495479207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:27:36,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:27:36,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-06 22:27:36,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970825257] [2024-11-06 22:27:36,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:27:36,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 22:27:36,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:27:36,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 22:27:36,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 22:27:36,403 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 22:27:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:27:36,536 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2024-11-06 22:27:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 22:27:36,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-06 22:27:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:27:36,537 INFO L225 Difference]: With dead ends: 73 [2024-11-06 22:27:36,537 INFO L226 Difference]: Without dead ends: 58 [2024-11-06 22:27:36,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-06 22:27:36,538 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:27:36,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 207 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:27:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-06 22:27:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-06 22:27:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:27:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2024-11-06 22:27:36,546 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 38 [2024-11-06 22:27:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:27:36,546 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2024-11-06 22:27:36,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 22:27:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2024-11-06 22:27:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-06 22:27:36,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:27:36,547 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:27:36,566 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 [2024-11-06 22:27:36,747 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 [2024-11-06 22:27:36,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:27:36,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:27:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2024-11-06 22:27:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:27:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932960356] [2024-11-06 22:27:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:27:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:36,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:27:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:37,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:27:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:37,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 22:27:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-06 22:27:37,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:27:37,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932960356] [2024-11-06 22:27:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932960356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:27:37,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477291383] [2024-11-06 22:27:37,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:37,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:27:37,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:27:37,089 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) [2024-11-06 22:27:37,090 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 [2024-11-06 22:27:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:37,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-06 22:27:37,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:27:37,416 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 [2024-11-06 22:27:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:27:37,449 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:27:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-06 22:27:37,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477291383] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:27:37,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:27:37,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 16 [2024-11-06 22:27:37,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871650921] [2024-11-06 22:27:37,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:27:37,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-06 22:27:37,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:27:37,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-06 22:27:37,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-06 22:27:37,503 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 22:27:41,517 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] [2024-11-06 22:27:45,533 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] [2024-11-06 22:27:49,557 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] [2024-11-06 22:27:53,570 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] [2024-11-06 22:27:57,592 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] [2024-11-06 22:28:01,822 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] [2024-11-06 22:28:05,841 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] [2024-11-06 22:28:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:05,849 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2024-11-06 22:28:05,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-06 22:28:05,850 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-11-06 22:28:05,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:05,850 INFO L225 Difference]: With dead ends: 94 [2024-11-06 22:28:05,850 INFO L226 Difference]: Without dead ends: 61 [2024-11-06 22:28:05,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-11-06 22:28:05,851 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 33 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:28:05,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 384 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2024-11-06 22:28:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-06 22:28:05,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-06 22:28:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:28:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-11-06 22:28:05,859 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 38 [2024-11-06 22:28:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:05,859 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-11-06 22:28:05,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 22:28:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-11-06 22:28:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 22:28:05,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:05,861 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:28:05,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-06 22:28:06,061 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 [2024-11-06 22:28:06,062 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:06,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1955198847, now seen corresponding path program 1 times [2024-11-06 22:28:06,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:06,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452298556] [2024-11-06 22:28:06,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:06,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:07,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:28:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:28:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:08,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 22:28:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 22:28:08,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:08,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452298556] [2024-11-06 22:28:08,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452298556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:08,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570742114] [2024-11-06 22:28:08,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:08,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:08,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:08,364 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) [2024-11-06 22:28:08,371 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 [2024-11-06 22:28:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:08,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-11-06 22:28:08,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:08,828 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 [2024-11-06 22:28:09,051 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:28:09,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-06 22:28:09,131 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 11 treesize of output 7 [2024-11-06 22:28:09,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-06 22:28:09,340 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-06 22:28:09,340 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 27 [2024-11-06 22:28:09,524 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-06 22:28:09,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 24 [2024-11-06 22:28:09,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-06 22:28:09,682 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 [2024-11-06 22:28:09,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:09,787 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-06 22:28:09,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 46 [2024-11-06 22:28:09,812 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-06 22:28:09,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-06 22:28:10,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2024-11-06 22:28:10,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:10,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 14 [2024-11-06 22:28:10,291 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-06 22:28:10,291 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 62 [2024-11-06 22:28:10,304 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-11-06 22:28:10,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 65 [2024-11-06 22:28:10,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2024-11-06 22:28:10,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-06 22:28:10,328 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 7 [2024-11-06 22:28:10,441 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 65 treesize of output 41 [2024-11-06 22:28:10,553 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 38 treesize of output 22 [2024-11-06 22:28:10,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-06 22:28:10,690 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 15 treesize of output 7 [2024-11-06 22:28:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:28:10,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:28:10,809 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1738 Int) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1737 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1746))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1735) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1741) .cse2) .cse3)) (+ (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1737) .cse2) .cse3) 8))))) is different from false [2024-11-06 22:28:10,885 INFO L349 Elim1Store]: treesize reduction 41, result has 53.9 percent of original size [2024-11-06 22:28:10,885 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 4 case distinctions, treesize of input 117 treesize of output 132 [2024-11-06 22:28:10,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:10,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 213 treesize of output 244 [2024-11-06 22:28:10,944 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 83 treesize of output 77 [2024-11-06 22:28:11,949 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse43 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse7 (select .cse43 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (= .cse7 .cse9))) (let ((.cse34 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse32 (not .cse12)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse43 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_4 Int)) (let ((.cse42 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store v_ArrVal_1746 .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738)) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 (+ 8 v_arrayElimCell_57))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 (+ 8 v_arrayElimCell_58))))))) (.cse15 (or (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_57 Int) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store v_ArrVal_1746 .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738)) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)) (+ 8 v_arrayElimCell_57)))) .cse12)) (.cse13 (or (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store v_ArrVal_1746 .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738)) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)) (+ 8 v_arrayElimCell_58)))) .cse32)) (.cse1 (not .cse34)) (.cse0 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse21 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse9)) (.cse22 (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (.cse25 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse23 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse10)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 8)) (.cse11 (= .cse6 .cse10)) (.cse3 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse9))) (and (or (not .cse0) .cse1 (let ((.cse2 (and .cse14 .cse15))) (and (or .cse2 .cse3) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (let ((.cse4 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store v_ArrVal_1746 .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738)) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse4 .cse5)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse4 (+ 8 v_arrayElimCell_58)))))) (or .cse2 .cse11) (or .cse12 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store v_ArrVal_1746 .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738)) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)) .cse5)))) .cse13))) (or (let ((.cse20 (or .cse32 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746))) (store .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738))) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)) (+ 8 v_arrayElimCell_58))))))) (let ((.cse16 (let ((.cse28 (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_4 Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746))) (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738))) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_57))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_58)))))) (or .cse12 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_57 Int) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746))) (store .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738))) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)) (+ 8 v_arrayElimCell_57)))))))) (and (or .cse12 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746))) (store .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738))) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)) .cse25)))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738))) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 .cse25)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_58)))))) (or .cse28 .cse23) (or .cse28 .cse21) (or (and .cse14 .cse15 .cse13) .cse1 .cse22) .cse20)))) (and (or .cse11 .cse16) (or (and (or (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738))) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)) .cse5))) .cse12) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738))) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 .cse5)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_58)))))) .cse20) (and .cse21 .cse22 .cse23)) (or .cse3 .cse16)))) .cse0) (or .cse34 (let ((.cse37 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (let ((.cse36 (or .cse32 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse37 .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738)) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)) (+ 8 v_arrayElimCell_58))))))) (let ((.cse35 (let ((.cse40 (and (or .cse12 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_57 Int) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse37 .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738)) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)) (+ 8 v_arrayElimCell_57))))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_4 Int)) (let ((.cse41 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse37 .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738)) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 (+ 8 v_arrayElimCell_57))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 (+ 8 v_arrayElimCell_58))))))))) (and .cse36 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (let ((.cse39 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse37 .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738)) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)))) (or (= (select .cse39 .cse5) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 (+ 8 v_arrayElimCell_58)))))) (or .cse12 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse37 .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738)) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)) .cse5) |c_ULTIMATE.start_main_~uneq~0#1|))) (or .cse11 .cse40) (or .cse40 .cse3))))) (and (or .cse35 .cse21) (or (and .cse11 .cse3 .cse22) (and .cse36 (or .cse12 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse37 .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738)) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)) .cse25) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (let ((.cse38 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse37 .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1738)) .cse7 v_ArrVal_1735) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1747) .cse7 v_ArrVal_1741) .cse9) .cse10)))) (or (= (select .cse38 .cse25) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse38 (+ 8 v_arrayElimCell_58)))))))) (or .cse35 .cse23)))))))))))) is different from false [2024-11-06 22:28:12,850 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse45 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse43 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse9 (select .cse45 .cse43)) (.cse11 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (= .cse9 .cse11))) (let ((.cse30 (not .cse5)) (.cse10 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse45 .cse43 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse12 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse35 (= .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (let ((.cse18 (not .cse35)) (.cse32 (= .cse43 .cse7)) (.cse20 (or .cse30 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store v_ArrVal_1746 .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738)) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)) (+ 8 v_arrayElimCell_58)))))) (.cse19 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_4 Int)) (let ((.cse44 (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store v_ArrVal_1746 .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738)) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)))) (or (= (select .cse44 (+ 8 v_arrayElimCell_57)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse44 (+ 8 v_arrayElimCell_58))))))) (.cse21 (or .cse5 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_57 Int) (v_DerPreprocessor_4 Int)) (= (select (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store v_ArrVal_1746 .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738)) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)) (+ 8 v_arrayElimCell_57)) |c_ULTIMATE.start_main_~uneq~0#1|)))) (.cse3 (= .cse43 .cse12)) (.cse2 (not (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse43))) (.cse23 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8)) (.cse4 (= .cse8 .cse11)) (.cse17 (= .cse7 .cse12)) (.cse13 (+ .cse43 8)) (.cse0 (= .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and (or (let ((.cse16 (or .cse30 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse31 (store |c_#memory_int#1| .cse8 v_ArrVal_1746))) (store .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738))) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)) (+ 8 v_arrayElimCell_58))))))) (let ((.cse1 (let ((.cse26 (and (or .cse5 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_57 Int) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int#1| .cse8 v_ArrVal_1746))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738))) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)) (+ 8 v_arrayElimCell_57))))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_4 Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#1| .cse8 v_ArrVal_1746))) (store .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738))) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_57))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_58))))))))) (and (or .cse18 .cse2 (and .cse19 .cse20 .cse21)) (or .cse5 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= (select (select (store (let ((.cse22 (store |c_#memory_int#1| .cse8 v_ArrVal_1746))) (store .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738))) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)) .cse23) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#1| .cse8 v_ArrVal_1746))) (store .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738))) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)))) (or (= (select .cse24 .cse23) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_58)))))) .cse16 (or .cse3 .cse26) (or .cse4 .cse26))))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4) (and (or .cse5 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse6 (store |c_#memory_int#1| .cse8 v_ArrVal_1746))) (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738))) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)) .cse13)))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int#1| .cse8 v_ArrVal_1746))) (store .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738))) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 .cse13)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 (+ 8 v_arrayElimCell_58)))))) .cse16)) (or .cse17 .cse1)))) .cse32) (or .cse18 (not .cse32) (let ((.cse34 (and .cse19 .cse21))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (let ((.cse33 (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store v_ArrVal_1746 .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738)) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (+ 8 v_arrayElimCell_58))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 .cse13))))) (or .cse5 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store v_ArrVal_1746 .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738)) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)) .cse13)))) (or .cse17 .cse34) .cse20 (or .cse34 .cse0)))) (or .cse35 (let ((.cse37 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (let ((.cse39 (or .cse30 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse37 .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738)) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)) (+ 8 v_arrayElimCell_58))))))) (let ((.cse36 (let ((.cse40 (and (or .cse5 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_57 Int) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse37 .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738)) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)) (+ 8 v_arrayElimCell_57))))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_4 Int)) (let ((.cse42 (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse37 .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738)) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 (+ 8 v_arrayElimCell_57))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 (+ 8 v_arrayElimCell_58))))))))) (and (or .cse5 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= (select (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse37 .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738)) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)) .cse13) |c_ULTIMATE.start_main_~uneq~0#1|))) (or .cse17 .cse40) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (let ((.cse41 (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse37 .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738)) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)))) (or (= (select .cse41 .cse13) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 (+ 8 v_arrayElimCell_58)))))) (or .cse0 .cse40) .cse39)))) (and (or .cse36 .cse3) (or (and .cse17 .cse0 .cse2) (and (or .cse5 (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse37 .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738)) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)) .cse23)))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_arrayElimCell_58 Int) (v_DerPreprocessor_4 Int)) (let ((.cse38 (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse37 .cse7 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1738)) .cse9 v_ArrVal_1735) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1747) .cse9 v_ArrVal_1741) .cse11) .cse12)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse38 .cse23)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse38 (+ 8 v_arrayElimCell_58)))))) .cse39)) (or .cse36 .cse4))))))))))))) is different from false