./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:24:08,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:24:08,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:24:08,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:24:08,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:24:08,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:24:08,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:24:08,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:24:08,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:24:08,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:24:08,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:24:08,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:24:08,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:24:08,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:24:08,488 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:24:08,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:24:08,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:24:08,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:24:08,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:24:08,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:24:08,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:24:08,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:24:08,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:24:08,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:24:08,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:24:08,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:24:08,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:24:08,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:24:08,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:24:08,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:24:08,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:24:08,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:24:08,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:24:08,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:24:08,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:24:08,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:24:08,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:24:08,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:24:08,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:24:08,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:24:08,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:24:08,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:24:08,501 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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-10-12 18:24:08,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:24:08,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:24:08,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:24:08,783 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:24:08,784 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:24:08,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-10-12 18:24:10,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:24:10,883 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:24:10,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-10-12 18:24:10,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a792b12c/d9a7511b55e242768de4657053c42c3a/FLAG4e6406c0e [2024-10-12 18:24:10,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a792b12c/d9a7511b55e242768de4657053c42c3a [2024-10-12 18:24:10,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:24:10,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:24:10,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:24:10,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:24:10,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:24:10,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:24:10" (1/1) ... [2024-10-12 18:24:10,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af89698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:10, skipping insertion in model container [2024-10-12 18:24:10,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:24:10" (1/1) ... [2024-10-12 18:24:11,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:24:11,462 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-10-12 18:24:11,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:24:11,479 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:24:11,546 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-10-12 18:24:11,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:24:11,578 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:24:11,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11 WrapperNode [2024-10-12 18:24:11,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:24:11,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:24:11,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:24:11,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:24:11,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (1/1) ... [2024-10-12 18:24:11,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (1/1) ... [2024-10-12 18:24:11,627 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 187 [2024-10-12 18:24:11,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:24:11,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:24:11,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:24:11,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:24:11,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (1/1) ... [2024-10-12 18:24:11,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (1/1) ... [2024-10-12 18:24:11,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (1/1) ... [2024-10-12 18:24:11,679 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-10-12 18:24:11,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (1/1) ... [2024-10-12 18:24:11,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (1/1) ... [2024-10-12 18:24:11,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (1/1) ... [2024-10-12 18:24:11,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (1/1) ... [2024-10-12 18:24:11,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (1/1) ... [2024-10-12 18:24:11,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (1/1) ... [2024-10-12 18:24:11,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:24:11,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:24:11,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:24:11,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:24:11,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (1/1) ... [2024-10-12 18:24:11,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:24:11,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:11,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:24:11,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:24:11,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:24:11,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:24:11,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 18:24:11,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:24:11,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:24:11,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 18:24:11,830 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-12 18:24:11,830 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-12 18:24:11,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:24:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:24:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 18:24:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:24:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:24:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 18:24:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:24:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:24:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 18:24:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:24:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 18:24:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 18:24:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 18:24:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:24:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:24:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 18:24:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:24:11,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:24:12,004 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:24:12,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:24:12,321 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-12 18:24:12,322 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:24:12,358 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:24:12,359 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-12 18:24:12,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:24:12 BoogieIcfgContainer [2024-10-12 18:24:12,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:24:12,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:24:12,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:24:12,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:24:12,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:24:10" (1/3) ... [2024-10-12 18:24:12,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8cb3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:24:12, skipping insertion in model container [2024-10-12 18:24:12,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:11" (2/3) ... [2024-10-12 18:24:12,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8cb3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:24:12, skipping insertion in model container [2024-10-12 18:24:12,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:24:12" (3/3) ... [2024-10-12 18:24:12,368 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-10-12 18:24:12,384 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:24:12,384 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:24:12,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:24:12,443 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;@1cf21810, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:24:12,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:24:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 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-10-12 18:24:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:24:12,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:12,455 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:12,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:12,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:12,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1280970562, now seen corresponding path program 1 times [2024-10-12 18:24:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:12,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133846330] [2024-10-12 18:24:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:12,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:12,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:24:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:24:12,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:12,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133846330] [2024-10-12 18:24:12,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133846330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:24:12,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:24:12,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:24:12,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811687533] [2024-10-12 18:24:12,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:24:12,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:24:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:12,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:24:12,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:24:12,932 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 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 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-10-12 18:24:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:13,023 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2024-10-12 18:24:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:24:13,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 19 [2024-10-12 18:24:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:13,033 INFO L225 Difference]: With dead ends: 66 [2024-10-12 18:24:13,034 INFO L226 Difference]: Without dead ends: 30 [2024-10-12 18:24:13,037 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-10-12 18:24:13,041 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:13,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:24:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-12 18:24:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-12 18:24:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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-10-12 18:24:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2024-10-12 18:24:13,081 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 19 [2024-10-12 18:24:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:13,083 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2024-10-12 18:24:13,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-10-12 18:24:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2024-10-12 18:24:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:24:13,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:13,085 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:13,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:24:13,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:13,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:13,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1761698767, now seen corresponding path program 1 times [2024-10-12 18:24:13,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:13,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91838026] [2024-10-12 18:24:13,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:13,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:13,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:24:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:24:13,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:13,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91838026] [2024-10-12 18:24:13,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91838026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:24:13,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:24:13,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:24:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82387505] [2024-10-12 18:24:13,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:24:13,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:24:13,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:13,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:24:13,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:24:13,292 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-10-12 18:24:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:13,367 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-10-12 18:24:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:24:13,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 19 [2024-10-12 18:24:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:13,368 INFO L225 Difference]: With dead ends: 53 [2024-10-12 18:24:13,368 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 18:24:13,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-12 18:24:13,370 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:13,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:24:13,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 18:24:13,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-12 18:24:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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-10-12 18:24:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2024-10-12 18:24:13,376 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 19 [2024-10-12 18:24:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:13,377 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-10-12 18:24:13,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-10-12 18:24:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2024-10-12 18:24:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 18:24:13,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:13,378 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:13,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:24:13,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:13,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash -174060619, now seen corresponding path program 1 times [2024-10-12 18:24:13,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:13,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341515282] [2024-10-12 18:24:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:13,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:13,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:13,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:24:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:13,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:24:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:24:13,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:13,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341515282] [2024-10-12 18:24:13,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341515282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:24:13,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:24:13,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:24:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290753631] [2024-10-12 18:24:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:24:13,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:24:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:24:13,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:24:13,572 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-10-12 18:24:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:13,641 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2024-10-12 18:24:13,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:24:13,642 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), 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 27 [2024-10-12 18:24:13,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:13,644 INFO L225 Difference]: With dead ends: 45 [2024-10-12 18:24:13,644 INFO L226 Difference]: Without dead ends: 33 [2024-10-12 18:24:13,644 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-10-12 18:24:13,646 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:13,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:24:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-12 18:24:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-12 18:24:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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-10-12 18:24:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2024-10-12 18:24:13,654 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 27 [2024-10-12 18:24:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:13,654 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-10-12 18:24:13,654 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), 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-10-12 18:24:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2024-10-12 18:24:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:24:13,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:13,655 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:13,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:24:13,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:13,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash 434779626, now seen corresponding path program 1 times [2024-10-12 18:24:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:13,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173864177] [2024-10-12 18:24:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:16,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:16,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:24:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:16,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:24:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:24:16,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:16,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173864177] [2024-10-12 18:24:16,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173864177] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:16,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831125992] [2024-10-12 18:24:16,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:16,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:16,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:16,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:24:16,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:24:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:17,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-10-12 18:24:17,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:24:17,208 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-10-12 18:24:17,400 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-10-12 18:24:17,488 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:24:17,488 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-10-12 18:24:17,566 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-10-12 18:24:17,579 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-10-12 18:24:17,672 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-10-12 18:24:17,681 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-10-12 18:24:17,872 INFO L349 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2024-10-12 18:24:17,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 163 [2024-10-12 18:24:17,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:17,885 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 44 treesize of output 33 [2024-10-12 18:24:17,891 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-10-12 18:24:17,901 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 98 treesize of output 75 [2024-10-12 18:24:17,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 28 [2024-10-12 18:24:17,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-12 18:24:18,002 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-10-12 18:24:18,007 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-10-12 18:24:18,236 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-12 18:24:18,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-12 18:24:18,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:18,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-10-12 18:24:18,283 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-12 18:24:18,283 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-10-12 18:24:18,481 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 40 treesize of output 16 [2024-10-12 18:24:18,610 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 41 treesize of output 39 [2024-10-12 18:24:18,616 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 25 treesize of output 15 [2024-10-12 18:24:18,689 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-10-12 18:24:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:24:18,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:24:23,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831125992] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:23,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:24:23,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2024-10-12 18:24:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795574975] [2024-10-12 18:24:23,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:24:23,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-12 18:24:23,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:23,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-12 18:24:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2143, Unknown=49, NotChecked=0, Total=2352 [2024-10-12 18:24:23,414 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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-10-12 18:24:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:27,801 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2024-10-12 18:24:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 18:24:27,802 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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 28 [2024-10-12 18:24:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:27,803 INFO L225 Difference]: With dead ends: 72 [2024-10-12 18:24:27,803 INFO L226 Difference]: Without dead ends: 70 [2024-10-12 18:24:27,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=298, Invalid=3811, Unknown=51, NotChecked=0, Total=4160 [2024-10-12 18:24:27,806 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 78 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:27,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 384 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 18:24:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-12 18:24:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2024-10-12 18:24:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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-10-12 18:24:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2024-10-12 18:24:27,817 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 28 [2024-10-12 18:24:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:27,818 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2024-10-12 18:24:27,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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-10-12 18:24:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-10-12 18:24:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:24:27,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:27,824 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 18:24:27,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:24:28,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:28,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:28,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:28,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1828890171, now seen corresponding path program 1 times [2024-10-12 18:24:28,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:28,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859626238] [2024-10-12 18:24:28,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:28,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:28,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:28,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:24:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:28,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:24:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:24:28,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859626238] [2024-10-12 18:24:28,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859626238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:24:28,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:24:28,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:24:28,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810529099] [2024-10-12 18:24:28,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:24:28,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:24:28,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:28,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:24:28,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:24:28,225 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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-10-12 18:24:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:28,303 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2024-10-12 18:24:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:24:28,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2024-10-12 18:24:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:28,304 INFO L225 Difference]: With dead ends: 66 [2024-10-12 18:24:28,304 INFO L226 Difference]: Without dead ends: 51 [2024-10-12 18:24:28,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-10-12 18:24:28,305 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:28,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 87 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:24:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-12 18:24:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-10-12 18:24:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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-10-12 18:24:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-10-12 18:24:28,320 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 29 [2024-10-12 18:24:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:28,320 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-10-12 18:24:28,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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-10-12 18:24:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-10-12 18:24:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:24:28,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:28,322 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:28,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:24:28,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2128958037, now seen corresponding path program 2 times [2024-10-12 18:24:28,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:28,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533642758] [2024-10-12 18:24:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:28,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:28,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:24:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:28,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:24:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:24:28,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:28,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533642758] [2024-10-12 18:24:28,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533642758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:24:28,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:24:28,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:24:28,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139909176] [2024-10-12 18:24:28,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:24:28,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:24:28,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:28,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:24:28,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:24:28,515 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-10-12 18:24:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:28,598 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2024-10-12 18:24:28,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:24:28,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 29 [2024-10-12 18:24:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:28,600 INFO L225 Difference]: With dead ends: 67 [2024-10-12 18:24:28,600 INFO L226 Difference]: Without dead ends: 51 [2024-10-12 18:24:28,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:24:28,601 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:28,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 115 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:24:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-12 18:24:28,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-10-12 18:24:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 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-10-12 18:24:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-10-12 18:24:28,618 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 29 [2024-10-12 18:24:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:28,618 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-10-12 18:24:28,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-10-12 18:24:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-10-12 18:24:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 18:24:28,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:28,619 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 18:24:28,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 18:24:28,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:28,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:28,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1486153936, now seen corresponding path program 1 times [2024-10-12 18:24:28,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:28,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752835451] [2024-10-12 18:24:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:28,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:29,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:24:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:29,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:24:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:24:29,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:29,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752835451] [2024-10-12 18:24:29,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752835451] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:29,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839316112] [2024-10-12 18:24:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:29,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:29,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:29,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:24:29,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 18:24:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:29,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 18:24:29,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:24:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:24:29,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:24:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:24:29,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839316112] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:24:29,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:24:29,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2024-10-12 18:24:29,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560661106] [2024-10-12 18:24:29,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:24:29,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 18:24:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:29,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 18:24:29,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:24:29,607 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 18:24:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:29,849 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2024-10-12 18:24:29,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 18:24:29,849 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2024-10-12 18:24:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:29,850 INFO L225 Difference]: With dead ends: 75 [2024-10-12 18:24:29,850 INFO L226 Difference]: Without dead ends: 47 [2024-10-12 18:24:29,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-10-12 18:24:29,851 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:29,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 322 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:24:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-12 18:24:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-12 18:24:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 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-10-12 18:24:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-10-12 18:24:29,859 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 30 [2024-10-12 18:24:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:29,859 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-10-12 18:24:29,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 18:24:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-10-12 18:24:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 18:24:29,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:29,860 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 18:24:29,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 18:24:30,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-12 18:24:30,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:30,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1022802718, now seen corresponding path program 1 times [2024-10-12 18:24:30,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:30,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119208620] [2024-10-12 18:24:30,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:30,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:31,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:24:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:31,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:24:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:31,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:24:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:24:32,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:32,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119208620] [2024-10-12 18:24:32,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119208620] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:32,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384241342] [2024-10-12 18:24:32,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:32,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:32,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:32,090 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:24:32,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 18:24:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:32,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-10-12 18:24:32,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:24:32,856 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-10-12 18:24:33,016 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2024-10-12 18:24:33,018 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2024-10-12 18:24:33,041 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-10-12 18:24:33,047 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2024-10-12 18:24:33,049 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2024-10-12 18:24:33,069 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-12 18:24:33,069 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 33 treesize of output 32 [2024-10-12 18:24:33,085 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2024-10-12 18:24:33,087 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from true [2024-10-12 18:24:33,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from false [2024-10-12 18:24:33,109 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from true [2024-10-12 18:24:33,192 INFO L349 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2024-10-12 18:24:33,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 116 [2024-10-12 18:24:33,201 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 116 treesize of output 110 [2024-10-12 18:24:33,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 38 [2024-10-12 18:24:33,240 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1))))) is different from false [2024-10-12 18:24:33,242 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1))))) is different from true [2024-10-12 18:24:33,254 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 13 treesize of output 5 [2024-10-12 18:24:33,272 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-10-12 18:24:33,275 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-10-12 18:24:33,305 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-10-12 18:24:33,307 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-10-12 18:24:33,319 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-10-12 18:24:33,340 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|)))) is different from false [2024-10-12 18:24:33,343 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|)))) is different from true [2024-10-12 18:24:33,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:33,388 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 22 treesize of output 17 [2024-10-12 18:24:33,418 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)) is different from false [2024-10-12 18:24:33,421 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)) is different from true [2024-10-12 18:24:33,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1))) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))) is different from false [2024-10-12 18:24:33,499 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1))) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))) is different from true [2024-10-12 18:24:33,579 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) is different from false [2024-10-12 18:24:33,583 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) is different from true [2024-10-12 18:24:33,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:33,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:33,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:33,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:33,697 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 50 treesize of output 26 [2024-10-12 18:24:33,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:33,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 67 treesize of output 50 [2024-10-12 18:24:33,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:33,719 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 51 [2024-10-12 18:24:33,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:33,737 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-12 18:24:33,738 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 99 treesize of output 70 [2024-10-12 18:24:33,743 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-10-12 18:24:33,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:33,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:33,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:33,756 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-10-12 18:24:33,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimCell_33 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_33) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0)))) is different from false [2024-10-12 18:24:33,796 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimCell_33 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_33) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0)))) is different from true [2024-10-12 18:24:33,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:24:33,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2024-10-12 18:24:34,008 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimCell_33 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_33) 1) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0))) (and (exists ((v_arrayElimCell_30 Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))))) is different from false [2024-10-12 18:24:34,012 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimCell_33 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_33) 1) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0))) (and (exists ((v_arrayElimCell_30 Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))))) is different from true [2024-10-12 18:24:34,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:24:34,146 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2024-10-12 18:24:34,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:24:34,170 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 56 treesize of output 68 [2024-10-12 18:24:34,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:24:34,182 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-10-12 18:24:34,256 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_33 Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_33) 1) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_42) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_42) 0)))) is different from false [2024-10-12 18:24:34,258 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_33 Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_33) 1) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_42) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_42) 0)))) is different from true [2024-10-12 18:24:34,287 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-10-12 18:24:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-10-12 18:24:34,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:24:34,466 INFO L349 Elim1Store]: treesize reduction 41, result has 53.9 percent of original size [2024-10-12 18:24:34,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 138 [2024-10-12 18:24:34,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:24:34,506 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 225 treesize of output 256 [2024-10-12 18:24:34,518 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 89 treesize of output 83 [2024-10-12 18:24:35,219 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (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|))) (.cse0 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse16 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse8))) (let ((.cse17 (not .cse16)) (.cse14 (store (select .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse22 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))) (let ((.cse9 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse0)) (.cse15 (not .cse22)) (.cse20 (or .cse17 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1415))) (store .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)) (+ 8 v_arrayElimCell_52))))))) (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse1)) (.cse3 (let ((.cse29 (+ |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1415))) (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)) .cse29))) .cse16) (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1415))) (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|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 .cse29))))) .cse20))) (.cse5 (or (not .cse9) .cse15)) (.cse7 (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|))) (.cse4 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse8))) (let ((.cse2 (let ((.cse11 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse21 (and (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1415))) (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_51)))))) (or .cse16 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1415))) (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|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)) (+ 8 v_arrayElimCell_51))))) .cse20))) (and (or .cse9 (and (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse10 (select (store (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1415))) (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)))) (or (= (select .cse10 .cse11) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 (+ 8 v_arrayElimCell_52)))))) (or .cse15 (and (or (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store v_ArrVal_1415 .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)) (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse16) (or .cse17 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store v_ArrVal_1415 .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)) (+ 8 v_arrayElimCell_52)) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse18 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store v_ArrVal_1415 .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)))) (or (= (select .cse18 (+ 8 v_arrayElimCell_52)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse18 (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse7) (or .cse16 (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= (select (select (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1415))) (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|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)) .cse11) |c_ULTIMATE.start_main_~uneq~0#1|))) .cse20)) (or .cse21 .cse6) (or .cse3 (and .cse5 .cse7)) (or .cse22 (let ((.cse23 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (or (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~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_1415) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse23 .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)) .cse11))) .cse16) (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse24 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse23 .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 .cse11)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_52)))))) (or .cse17 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~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_1415) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse23 .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1410) .cse8) .cse1)) (+ 8 v_arrayElimCell_52)))))))) (or .cse21 .cse4))))) (and (or (= .cse0 .cse1) .cse2) (or .cse3 (and .cse4 .cse5 .cse6 .cse7)) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse8) .cse2)))))))) is different from false [2024-10-12 18:24:36,876 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse34 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse12 (select .cse34 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (= .cse12 .cse8)) (.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse34 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse0 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (let ((.cse10 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse14 (store (select .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (not .cse16))) (let ((.cse19 (or (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= (select (select (store (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1415))) (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|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)) (+ 8 v_arrayElimCell_52)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse18)) (.cse25 (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse20 (not .cse10))) (let ((.cse4 (or (not .cse25) .cse20)) (.cse3 (let ((.cse30 (+ |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 8))) (and .cse19 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse29 (select (store (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1415))) (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|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 .cse30)) (= (select .cse29 (+ 8 v_arrayElimCell_52)) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse16 (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1415))) (store .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)) .cse30))))))) (.cse7 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse1)) (.cse5 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse8)) (.cse6 (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (let ((.cse2 (let ((.cse9 (and .cse19 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1415))) (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|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)))) (or (= (select .cse26 (+ 8 v_arrayElimCell_52)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_51)))))) (or .cse16 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1415))) (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)) (+ 8 v_arrayElimCell_51))))))) (.cse15 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (and (or (and .cse4 .cse6) .cse3) (or .cse9 .cse7) (or .cse10 (let ((.cse11 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (or (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse11 .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422)) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)) .cse15) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse16) (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse17 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse11 .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422)) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ 8 v_arrayElimCell_52))) (= (select .cse17 .cse15) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 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_1415) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse11 .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422)) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)) (+ 8 v_arrayElimCell_52)))) .cse18)))) (or .cse9 .cse5) (or (and .cse19 (or .cse20 .cse6 (and (or .cse16 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 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_1415) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store v_ArrVal_1415 .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422)) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)) (+ 8 v_arrayElimCell_51))))) (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse21 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store v_ArrVal_1415 .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422)) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_51)))))) (or .cse18 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 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_1415) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store v_ArrVal_1415 .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422)) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)) (+ 8 v_arrayElimCell_52))))))) (or .cse16 (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1415))) (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)) .cse15)))) (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1415))) (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|) .cse0 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse8) .cse1)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 .cse15)) (= (select .cse23 (+ 8 v_arrayElimCell_52)) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse25))))) (and (or (= .cse0 .cse1) .cse2) (or .cse3 (and .cse4 .cse5 .cse6 .cse7)) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse8) .cse2))))))))) is different from false [2024-10-12 18:24:37,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (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 ((.cse36 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse30 (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 ((.cse12 (select .cse36 .cse30)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse10 (store .cse36 .cse30 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse7 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse18 (= .cse12 .cse0))) (let ((.cse9 (= .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse15 (not .cse18)) (.cse14 (store (select .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 .cse10)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (or .cse15 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse35 (store |c_#memory_int#1| .cse10 v_ArrVal_1415))) (store .cse35 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)) (+ 8 v_arrayElimCell_52)))))) (.cse23 (not .cse9)) (.cse25 (= .cse30 .cse7))) (let ((.cse2 (not (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse30))) (.cse5 (or .cse23 (not .cse25))) (.cse6 (let ((.cse32 (+ .cse30 8))) (and (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse31 (select (store (let ((.cse33 (store |c_#memory_int#1| .cse10 v_ArrVal_1415))) (store .cse33 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 .cse32))))) .cse22 (or .cse18 (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse34 (store |c_#memory_int#1| .cse10 v_ArrVal_1415))) (store .cse34 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse34 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)) .cse32))))))) (.cse3 (= .cse30 .cse8)) (.cse4 (= .cse10 .cse0))) (let ((.cse1 (let ((.cse17 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8)) (.cse26 (and (or .cse18 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int#1| .cse10 v_ArrVal_1415))) (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_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)) (+ 8 v_arrayElimCell_51))))) .cse22 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#1| .cse10 v_ArrVal_1415))) (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_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_51))))))))) (and (or .cse9 (let ((.cse11 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and (or (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse10 v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse11 .cse7 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422)) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)) (+ 8 v_arrayElimCell_52)))) .cse15) (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse16 (select (store (store (store |c_#memory_int#1| .cse10 v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse11 .cse7 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422)) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_52)))))) (or .cse18 (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse10 v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse11 .cse7 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422)) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)) .cse17))))))) (or (and (or .cse18 (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse19 (store |c_#memory_int#1| .cse10 v_ArrVal_1415))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)) .cse17)))) (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int#1| .cse10 v_ArrVal_1415))) (store .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422))) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse17))))) .cse22 (or .cse23 (and (or .cse18 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse10 v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store v_ArrVal_1415 .cse7 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422)) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)) (+ 8 v_arrayElimCell_51))))) (or .cse15 (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (= (select (select (store (store (store |c_#memory_int#1| .cse10 v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store v_ArrVal_1415 .cse7 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422)) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)) (+ 8 v_arrayElimCell_52)) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1415 (Array Int Int)) (v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1420 Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1424 Int)) (let ((.cse24 (select (store (store (store |c_#memory_int#1| .cse10 v_ArrVal_1415) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store v_ArrVal_1415 .cse7 v_ArrVal_1420) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1422)) .cse12 v_ArrVal_1411) (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1424)) .cse12 v_ArrVal_1410) .cse0) .cse8)))) (or (= (select .cse24 (+ 8 v_arrayElimCell_52)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_51))))))) .cse2)) .cse25) (or (and .cse2 .cse5) .cse6) (or .cse26 .cse3) (or .cse26 .cse4))))) (and (or (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (= .cse7 .cse8) .cse1)))))))))) is different from false